/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_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 08:59:02,364 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 08:59:02,365 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 08:59:02,410 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 08:59:02,410 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 08:59:02,411 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 08:59:02,414 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 08:59:02,416 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 08:59:02,418 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 08:59:02,422 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 08:59:02,423 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 08:59:02,424 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 08:59:02,424 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 08:59:02,426 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 08:59:02,427 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 08:59:02,429 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 08:59:02,430 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 08:59:02,430 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 08:59:02,432 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 08:59:02,437 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 08:59:02,438 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 08:59:02,439 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 08:59:02,440 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 08:59:02,441 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 08:59:02,442 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 08:59:02,447 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 08:59:02,448 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 08:59:02,448 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 08:59:02,448 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 08:59:02,449 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 08:59:02,450 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 08:59:02,450 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 08:59:02,452 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 08:59:02,452 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 08:59:02,453 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 08:59:02,454 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 08:59:02,454 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 08:59:02,454 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 08:59:02,454 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 08:59:02,455 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 08:59:02,455 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 08:59:02,457 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 08:59:02,457 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:02,468 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 08:59:02,468 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 08:59:02,469 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 08:59:02,469 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 08:59:02,469 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 08:59:02,469 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 08:59:02,470 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 08:59:02,470 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 08:59:02,470 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 08:59:02,471 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 08:59:02,471 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 08:59:02,471 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 08:59:02,471 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 08:59:02,471 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 08:59:02,471 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 08:59:02,471 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 08:59:02,472 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 08:59:02,472 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 08:59:02,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 08:59:02,472 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 08:59:02,472 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 08:59:02,472 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 08:59:02,472 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 08:59:02,472 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 08:59:02,473 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 08:59:02,473 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:02,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 08:59:02,725 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 08:59:02,727 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 08:59:02,728 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 08:59:02,729 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 08:59:02,730 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound5.c [2022-04-15 08:59:02,780 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/257b45092/12e65743d05546819a3c9de945693b5f/FLAGa652e23ac [2022-04-15 08:59:03,106 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 08:59:03,106 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound5.c [2022-04-15 08:59:03,113 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/257b45092/12e65743d05546819a3c9de945693b5f/FLAGa652e23ac [2022-04-15 08:59:03,525 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/257b45092/12e65743d05546819a3c9de945693b5f [2022-04-15 08:59:03,532 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 08:59:03,533 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 08:59:03,536 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 08:59:03,536 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 08:59:03,538 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 08:59:03,539 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 08:59:03" (1/1) ... [2022-04-15 08:59:03,540 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73188ca6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:59:03, skipping insertion in model container [2022-04-15 08:59:03,540 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 08:59:03" (1/1) ... [2022-04-15 08:59:03,547 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 08:59:03,556 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 08:59:03,683 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_unwindbound5.c[535,548] [2022-04-15 08:59:03,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 08:59:03,708 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 08:59:03,723 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_unwindbound5.c[535,548] [2022-04-15 08:59:03,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 08:59:03,746 INFO L208 MainTranslator]: Completed translation [2022-04-15 08:59:03,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:59:03 WrapperNode [2022-04-15 08:59:03,746 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 08:59:03,747 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 08:59:03,747 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 08:59:03,747 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 08:59:03,754 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:03" (1/1) ... [2022-04-15 08:59:03,754 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:03" (1/1) ... [2022-04-15 08:59:03,759 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:03" (1/1) ... [2022-04-15 08:59:03,759 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:03" (1/1) ... [2022-04-15 08:59:03,764 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:03" (1/1) ... [2022-04-15 08:59:03,768 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:03" (1/1) ... [2022-04-15 08:59:03,769 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:03" (1/1) ... [2022-04-15 08:59:03,771 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 08:59:03,772 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 08:59:03,772 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 08:59:03,772 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 08:59:03,776 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:59:03" (1/1) ... [2022-04-15 08:59:03,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 08:59:03,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:59:03,803 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:03,807 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:03,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 08:59:03,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 08:59:03,839 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 08:59:03,839 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 08:59:03,839 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 08:59:03,839 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 08:59:03,840 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 08:59:03,840 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 08:59:03,840 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 08:59:03,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 08:59:03,841 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 08:59:03,841 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 08:59:03,842 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 08:59:03,842 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 08:59:03,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 08:59:03,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 08:59:03,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 08:59:03,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 08:59:03,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 08:59:03,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 08:59:03,892 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 08:59:03,893 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 08:59:04,036 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 08:59:04,041 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 08:59:04,042 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-15 08:59:04,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 08:59:04 BoogieIcfgContainer [2022-04-15 08:59:04,043 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 08:59:04,044 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 08:59:04,045 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 08:59:04,047 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 08:59:04,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 08:59:03" (1/3) ... [2022-04-15 08:59:04,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c90032b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 08:59:04, skipping insertion in model container [2022-04-15 08:59:04,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:59:03" (2/3) ... [2022-04-15 08:59:04,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c90032b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 08:59:04, skipping insertion in model container [2022-04-15 08:59:04,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 08:59:04" (3/3) ... [2022-04-15 08:59:04,050 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound5.c [2022-04-15 08:59:04,054 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 08:59:04,054 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 08:59:04,085 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 08:59:04,090 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:04,091 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 08:59:04,117 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:04,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 08:59:04,122 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:59:04,123 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:04,123 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:59:04,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:59:04,141 INFO L85 PathProgramCache]: Analyzing trace with hash 928708300, now seen corresponding path program 1 times [2022-04-15 08:59:04,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:59:04,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [894516015] [2022-04-15 08:59:04,164 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:59:04,165 INFO L85 PathProgramCache]: Analyzing trace with hash 928708300, now seen corresponding path program 2 times [2022-04-15 08:59:04,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:59:04,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480758821] [2022-04-15 08:59:04,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:59:04,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:59:04,243 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:59:04,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1142972994] [2022-04-15 08:59:04,244 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:59:04,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:59:04,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:59:04,246 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:04,250 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:04,313 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 08:59:04,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:59:04,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-15 08:59:04,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:59:04,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:59:04,442 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {40#true} is VALID [2022-04-15 08:59:04,443 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:04,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-15 08:59:04,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #102#return; {40#true} is VALID [2022-04-15 08:59:04,444 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret9 := main(); {40#true} is VALID [2022-04-15 08:59:04,444 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:04,445 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:04,445 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-15 08:59:04,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {40#true} is VALID [2022-04-15 08:59:04,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-15 08:59:04,446 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40#true} {40#true} #90#return; {40#true} is VALID [2022-04-15 08:59:04,446 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:04,446 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-15 08:59:04,447 INFO L290 TraceCheckUtils]: 13: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-15 08:59:04,447 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-15 08:59:04,447 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {41#false} {40#true} #92#return; {41#false} is VALID [2022-04-15 08:59:04,448 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:04,448 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-15 08:59:04,448 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:04,450 INFO L290 TraceCheckUtils]: 19: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-15 08:59:04,450 INFO L290 TraceCheckUtils]: 20: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-15 08:59:04,450 INFO L290 TraceCheckUtils]: 21: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-15 08:59:04,451 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:04,451 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 08:59:04,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:59:04,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480758821] [2022-04-15 08:59:04,453 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:59:04,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142972994] [2022-04-15 08:59:04,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142972994] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:59:04,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:59:04,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-15 08:59:04,457 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:59:04,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [894516015] [2022-04-15 08:59:04,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [894516015] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:59:04,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:59:04,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-15 08:59:04,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8295316] [2022-04-15 08:59:04,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:59:04,465 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:04,466 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:59:04,469 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:04,497 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:04,498 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-15 08:59:04,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:59:04,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-15 08:59:04,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-15 08:59:04,537 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:04,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:04,639 INFO L93 Difference]: Finished difference Result 67 states and 100 transitions. [2022-04-15 08:59:04,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-15 08:59:04,641 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:04,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:59:04,642 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:04,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-15 08:59:04,659 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:04,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-15 08:59:04,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 100 transitions. [2022-04-15 08:59:04,786 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:04,794 INFO L225 Difference]: With dead ends: 67 [2022-04-15 08:59:04,795 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 08:59:04,797 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:04,799 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:04,800 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:04,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 08:59:04,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-15 08:59:04,829 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:59:04,830 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:04,831 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:04,832 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:04,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:04,840 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-15 08:59:04,840 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-15 08:59:04,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:59:04,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:59:04,841 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:04,843 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:04,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:04,848 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-15 08:59:04,849 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-15 08:59:04,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:59:04,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:59:04,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:59:04,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:59:04,851 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:04,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-15 08:59:04,855 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 22 [2022-04-15 08:59:04,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:59:04,856 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-15 08:59:04,856 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:04,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 41 transitions. [2022-04-15 08:59:04,896 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:04,896 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-15 08:59:04,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 08:59:04,897 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:59:04,898 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:04,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 08:59:05,118 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:05,119 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:59:05,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:59:05,120 INFO L85 PathProgramCache]: Analyzing trace with hash -155606603, now seen corresponding path program 1 times [2022-04-15 08:59:05,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:59:05,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [63213117] [2022-04-15 08:59:05,121 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:59:05,121 INFO L85 PathProgramCache]: Analyzing trace with hash -155606603, now seen corresponding path program 2 times [2022-04-15 08:59:05,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:59:05,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199650197] [2022-04-15 08:59:05,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:59:05,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:59:05,140 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:59:05,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [554629550] [2022-04-15 08:59:05,141 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:59:05,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:59:05,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:59:05,142 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:05,147 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:05,196 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 08:59:05,196 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:59:05,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 08:59:05,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:59:05,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:59:05,345 INFO L272 TraceCheckUtils]: 0: Hoare triple {369#true} call ULTIMATE.init(); {369#true} is VALID [2022-04-15 08:59:05,346 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:05,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:05,347 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:05,348 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:05,348 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:05,349 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:05,350 INFO L290 TraceCheckUtils]: 7: Hoare triple {377#(<= ~counter~0 0)} ~cond := #in~cond; {377#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:05,350 INFO L290 TraceCheckUtils]: 8: Hoare triple {377#(<= ~counter~0 0)} assume !(0 == ~cond); {377#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:05,351 INFO L290 TraceCheckUtils]: 9: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:05,351 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:05,352 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:05,352 INFO L290 TraceCheckUtils]: 12: Hoare triple {377#(<= ~counter~0 0)} ~cond := #in~cond; {377#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:05,353 INFO L290 TraceCheckUtils]: 13: Hoare triple {377#(<= ~counter~0 0)} assume !(0 == ~cond); {377#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:05,353 INFO L290 TraceCheckUtils]: 14: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:05,354 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:05,354 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:05,355 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:05,356 INFO L290 TraceCheckUtils]: 18: Hoare triple {426#(<= |main_#t~post6| 0)} assume !(#t~post6 < 5);havoc #t~post6; {370#false} is VALID [2022-04-15 08:59:05,356 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:05,356 INFO L290 TraceCheckUtils]: 20: Hoare triple {370#false} ~cond := #in~cond; {370#false} is VALID [2022-04-15 08:59:05,356 INFO L290 TraceCheckUtils]: 21: Hoare triple {370#false} assume 0 == ~cond; {370#false} is VALID [2022-04-15 08:59:05,356 INFO L290 TraceCheckUtils]: 22: Hoare triple {370#false} assume !false; {370#false} is VALID [2022-04-15 08:59:05,357 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:05,357 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 08:59:05,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:59:05,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199650197] [2022-04-15 08:59:05,357 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:59:05,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554629550] [2022-04-15 08:59:05,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554629550] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:59:05,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:59:05,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 08:59:05,358 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:59:05,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [63213117] [2022-04-15 08:59:05,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [63213117] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:59:05,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:59:05,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 08:59:05,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797818081] [2022-04-15 08:59:05,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:59:05,360 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:05,360 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:59:05,360 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:05,378 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:05,378 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 08:59:05,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:59:05,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 08:59:05,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 08:59:05,379 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:05,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:05,458 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-15 08:59:05,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 08:59:05,459 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:05,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:59:05,459 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:05,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-15 08:59:05,461 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:05,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-15 08:59:05,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2022-04-15 08:59:05,506 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:05,508 INFO L225 Difference]: With dead ends: 41 [2022-04-15 08:59:05,508 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 08:59:05,509 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:05,510 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:05,510 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:05,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 08:59:05,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-15 08:59:05,522 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:59:05,522 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:05,522 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:05,523 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:05,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:05,525 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-15 08:59:05,525 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-15 08:59:05,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:59:05,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:59:05,526 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:05,527 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:05,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:05,529 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-15 08:59:05,529 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-15 08:59:05,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:59:05,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:59:05,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:59:05,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:59:05,530 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:05,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-04-15 08:59:05,532 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 23 [2022-04-15 08:59:05,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:59:05,532 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-04-15 08:59:05,533 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:05,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 43 transitions. [2022-04-15 08:59:05,576 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:05,577 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-15 08:59:05,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 08:59:05,578 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:59:05,578 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:05,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 08:59:05,779 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:05,779 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:59:05,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:59:05,780 INFO L85 PathProgramCache]: Analyzing trace with hash -153938307, now seen corresponding path program 1 times [2022-04-15 08:59:05,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:59:05,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2119819013] [2022-04-15 08:59:05,781 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:59:05,781 INFO L85 PathProgramCache]: Analyzing trace with hash -153938307, now seen corresponding path program 2 times [2022-04-15 08:59:05,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:59:05,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431477938] [2022-04-15 08:59:05,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:59:05,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:59:05,808 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:59:05,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [120824311] [2022-04-15 08:59:05,809 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:59:05,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:59:05,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:59:05,810 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:05,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 08:59:05,890 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 08:59:05,890 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:59:05,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 08:59:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:59:05,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:59:14,374 INFO L272 TraceCheckUtils]: 0: Hoare triple {659#true} call ULTIMATE.init(); {659#true} is VALID [2022-04-15 08:59:14,375 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:14,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-15 08:59:14,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {659#true} {659#true} #102#return; {659#true} is VALID [2022-04-15 08:59:14,379 INFO L272 TraceCheckUtils]: 4: Hoare triple {659#true} call #t~ret9 := main(); {659#true} is VALID [2022-04-15 08:59:14,379 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:14,379 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:14,379 INFO L290 TraceCheckUtils]: 7: Hoare triple {659#true} ~cond := #in~cond; {659#true} is VALID [2022-04-15 08:59:14,380 INFO L290 TraceCheckUtils]: 8: Hoare triple {659#true} assume !(0 == ~cond); {659#true} is VALID [2022-04-15 08:59:14,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-15 08:59:14,380 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {659#true} {659#true} #90#return; {659#true} is VALID [2022-04-15 08:59:14,380 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:14,380 INFO L290 TraceCheckUtils]: 12: Hoare triple {659#true} ~cond := #in~cond; {659#true} is VALID [2022-04-15 08:59:14,380 INFO L290 TraceCheckUtils]: 13: Hoare triple {659#true} assume !(0 == ~cond); {659#true} is VALID [2022-04-15 08:59:14,381 INFO L290 TraceCheckUtils]: 14: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-15 08:59:14,381 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {659#true} {659#true} #92#return; {659#true} is VALID [2022-04-15 08:59:16,384 WARN L290 TraceCheckUtils]: 16: Hoare triple {659#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {712#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is UNKNOWN [2022-04-15 08:59:16,386 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:16,387 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 < 5);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:17,293 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:17,293 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:17,294 INFO L290 TraceCheckUtils]: 21: Hoare triple {726#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {660#false} is VALID [2022-04-15 08:59:17,294 INFO L290 TraceCheckUtils]: 22: Hoare triple {660#false} assume !false; {660#false} is VALID [2022-04-15 08:59:17,294 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:17,295 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 08:59:17,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:59:17,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431477938] [2022-04-15 08:59:17,295 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:59:17,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120824311] [2022-04-15 08:59:17,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120824311] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:59:17,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:59:17,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 08:59:17,296 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:59:17,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2119819013] [2022-04-15 08:59:17,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2119819013] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:59:17,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:59:17,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 08:59:17,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298328841] [2022-04-15 08:59:17,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:59:17,297 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:17,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:59:17,297 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:18,972 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:18,973 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 08:59:18,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:59:18,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 08:59:18,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 08:59:18,974 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:21,046 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:26,630 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 08:59:30,545 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 08:59:35,104 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 08:59:35,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:35,169 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-15 08:59:35,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 08:59:35,170 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:35,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:59:35,170 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 08:59:35,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-15 08:59:35,172 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 08:59:35,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-15 08:59:35,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 68 transitions. [2022-04-15 08:59:43,526 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 65 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 08:59:43,528 INFO L225 Difference]: With dead ends: 53 [2022-04-15 08:59:43,528 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 08:59:43,528 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 08:59:43,529 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 16 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2022-04-15 08:59:43,529 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 116 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 1 Unknown, 0 Unchecked, 9.4s Time] [2022-04-15 08:59:43,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 08:59:43,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-15 08:59:43,550 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:59:43,551 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 08:59:43,551 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 08:59:43,551 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 08:59:43,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:43,554 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-15 08:59:43,554 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-15 08:59:43,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:59:43,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:59:43,556 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 08:59:43,556 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 08:59:43,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:43,559 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-15 08:59:43,559 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-15 08:59:43,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:59:43,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:59:43,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:59:43,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:59:43,560 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 08:59:43,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2022-04-15 08:59:43,563 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 67 transitions. Word has length 23 [2022-04-15 08:59:43,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:59:43,563 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-04-15 08:59:43,564 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 08:59:43,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 67 transitions. [2022-04-15 08:59:50,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 66 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 08:59:50,175 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2022-04-15 08:59:50,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 08:59:50,176 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:59:50,176 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 08:59:50,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-15 08:59:50,377 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 08:59:50,377 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:59:50,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:59:50,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1676885497, now seen corresponding path program 1 times [2022-04-15 08:59:50,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:59:50,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1646993273] [2022-04-15 08:59:50,378 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:59:50,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1676885497, now seen corresponding path program 2 times [2022-04-15 08:59:50,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:59:50,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450219050] [2022-04-15 08:59:50,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:59:50,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:59:50,405 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:59:50,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [535198661] [2022-04-15 08:59:50,405 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:59:50,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:59:50,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:59:50,407 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 08:59:50,423 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 08:59:50,472 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:59:50,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:59:50,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 08:59:50,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:59:50,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:59:50,681 INFO L272 TraceCheckUtils]: 0: Hoare triple {1042#true} call ULTIMATE.init(); {1042#true} is VALID [2022-04-15 08:59:50,681 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 08:59:50,682 INFO L290 TraceCheckUtils]: 2: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-15 08:59:50,682 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1042#true} {1042#true} #102#return; {1042#true} is VALID [2022-04-15 08:59:50,682 INFO L272 TraceCheckUtils]: 4: Hoare triple {1042#true} call #t~ret9 := main(); {1042#true} is VALID [2022-04-15 08:59:50,682 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 08:59:50,682 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 08:59:50,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-15 08:59:50,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-15 08:59:50,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-15 08:59:50,683 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1042#true} {1042#true} #90#return; {1042#true} is VALID [2022-04-15 08:59:50,683 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 08:59:50,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-15 08:59:50,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-15 08:59:50,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-15 08:59:50,684 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1042#true} {1042#true} #92#return; {1042#true} is VALID [2022-04-15 08:59:50,684 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 08:59:50,685 INFO L290 TraceCheckUtils]: 17: Hoare triple {1042#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1042#true} is VALID [2022-04-15 08:59:50,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {1042#true} assume !!(#t~post6 < 5);havoc #t~post6; {1042#true} is VALID [2022-04-15 08:59:50,685 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 08:59:50,685 INFO L290 TraceCheckUtils]: 20: Hoare triple {1042#true} ~cond := #in~cond; {1107#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:59:50,686 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 08:59:50,686 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 08:59:50,687 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 08:59:50,688 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 08:59:50,689 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 08:59:50,689 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 08:59:50,689 INFO L290 TraceCheckUtils]: 27: Hoare triple {1130#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1043#false} is VALID [2022-04-15 08:59:50,690 INFO L290 TraceCheckUtils]: 28: Hoare triple {1043#false} assume !false; {1043#false} is VALID [2022-04-15 08:59:50,690 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 08:59:50,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:59:51,138 INFO L290 TraceCheckUtils]: 28: Hoare triple {1043#false} assume !false; {1043#false} is VALID [2022-04-15 08:59:51,139 INFO L290 TraceCheckUtils]: 27: Hoare triple {1130#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1043#false} is VALID [2022-04-15 08:59:51,139 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 08:59:51,140 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 08:59:51,141 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 08:59:51,144 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 08:59:51,151 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 08:59:51,152 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 08:59:51,152 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 08:59:51,153 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 08:59:51,153 INFO L290 TraceCheckUtils]: 18: Hoare triple {1042#true} assume !!(#t~post6 < 5);havoc #t~post6; {1042#true} is VALID [2022-04-15 08:59:51,153 INFO L290 TraceCheckUtils]: 17: Hoare triple {1042#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1042#true} is VALID [2022-04-15 08:59:51,153 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 08:59:51,153 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1042#true} {1042#true} #92#return; {1042#true} is VALID [2022-04-15 08:59:51,153 INFO L290 TraceCheckUtils]: 14: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-15 08:59:51,154 INFO L290 TraceCheckUtils]: 13: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-15 08:59:51,154 INFO L290 TraceCheckUtils]: 12: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-15 08:59:51,155 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 08:59:51,155 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1042#true} {1042#true} #90#return; {1042#true} is VALID [2022-04-15 08:59:51,155 INFO L290 TraceCheckUtils]: 9: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-15 08:59:51,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-15 08:59:51,157 INFO L290 TraceCheckUtils]: 7: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-15 08:59:51,169 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 08:59:51,170 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 08:59:51,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {1042#true} call #t~ret9 := main(); {1042#true} is VALID [2022-04-15 08:59:51,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1042#true} {1042#true} #102#return; {1042#true} is VALID [2022-04-15 08:59:51,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-15 08:59:51,170 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 08:59:51,170 INFO L272 TraceCheckUtils]: 0: Hoare triple {1042#true} call ULTIMATE.init(); {1042#true} is VALID [2022-04-15 08:59:51,171 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 08:59:51,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:59:51,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450219050] [2022-04-15 08:59:51,171 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:59:51,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535198661] [2022-04-15 08:59:51,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535198661] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:59:51,171 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:59:51,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-15 08:59:51,172 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:59:51,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1646993273] [2022-04-15 08:59:51,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1646993273] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:59:51,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:59:51,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 08:59:51,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22497055] [2022-04-15 08:59:51,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:59:51,173 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 08:59:51,173 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:59:51,173 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 08:59:51,195 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 08:59:51,195 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 08:59:51,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:59:51,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 08:59:51,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-15 08:59:51,196 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 08:59:51,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:51,603 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2022-04-15 08:59:51,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 08:59:51,604 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 08:59:51,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:59:51,604 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 08:59:51,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-15 08:59:51,606 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 08:59:51,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-15 08:59:51,608 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-15 08:59:51,655 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 08:59:51,656 INFO L225 Difference]: With dead ends: 57 [2022-04-15 08:59:51,657 INFO L226 Difference]: Without dead ends: 52 [2022-04-15 08:59:51,657 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 08:59:51,658 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 08:59:51,658 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 08:59:51,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-15 08:59:51,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 36. [2022-04-15 08:59:51,680 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:59:51,680 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 08:59:51,680 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 08:59:51,681 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 08:59:51,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:51,684 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-15 08:59:51,684 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-15 08:59:51,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:59:51,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:59:51,685 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 52 states. [2022-04-15 08:59:51,685 INFO L87 Difference]: Start difference. First operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 52 states. [2022-04-15 08:59:51,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:51,688 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-15 08:59:51,688 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-15 08:59:51,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:59:51,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:59:51,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:59:51,689 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:59:51,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 08:59:51,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-04-15 08:59:51,691 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 29 [2022-04-15 08:59:51,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:59:51,691 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-04-15 08:59:51,691 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 08:59:51,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 43 transitions. [2022-04-15 08:59:52,557 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:52,557 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-15 08:59:52,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 08:59:52,558 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:59:52,558 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 08:59:52,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 08:59:52,759 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 08:59:52,759 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:59:52,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:59:52,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1154059858, now seen corresponding path program 1 times [2022-04-15 08:59:52,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:59:52,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [446518384] [2022-04-15 08:59:52,761 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:59:52,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1154059858, now seen corresponding path program 2 times [2022-04-15 08:59:52,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:59:52,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407265554] [2022-04-15 08:59:52,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:59:52,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:59:52,789 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:59:52,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [783969056] [2022-04-15 08:59:52,789 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:59:52,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:59:52,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:59:52,791 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 08:59:52,792 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 08:59:52,962 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:59:52,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:59:52,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 08:59:52,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:59:52,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:59:53,154 INFO L272 TraceCheckUtils]: 0: Hoare triple {1521#true} call ULTIMATE.init(); {1521#true} is VALID [2022-04-15 08:59:53,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {1521#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1529#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:53,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {1529#(<= ~counter~0 0)} assume true; {1529#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:53,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1529#(<= ~counter~0 0)} {1521#true} #102#return; {1529#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:53,156 INFO L272 TraceCheckUtils]: 4: Hoare triple {1529#(<= ~counter~0 0)} call #t~ret9 := main(); {1529#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:53,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {1529#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {1529#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:53,157 INFO L272 TraceCheckUtils]: 6: Hoare triple {1529#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1529#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:53,157 INFO L290 TraceCheckUtils]: 7: Hoare triple {1529#(<= ~counter~0 0)} ~cond := #in~cond; {1529#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:53,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {1529#(<= ~counter~0 0)} assume !(0 == ~cond); {1529#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:53,163 INFO L290 TraceCheckUtils]: 9: Hoare triple {1529#(<= ~counter~0 0)} assume true; {1529#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:53,163 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1529#(<= ~counter~0 0)} {1529#(<= ~counter~0 0)} #90#return; {1529#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:53,164 INFO L272 TraceCheckUtils]: 11: Hoare triple {1529#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1529#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:53,164 INFO L290 TraceCheckUtils]: 12: Hoare triple {1529#(<= ~counter~0 0)} ~cond := #in~cond; {1529#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:53,164 INFO L290 TraceCheckUtils]: 13: Hoare triple {1529#(<= ~counter~0 0)} assume !(0 == ~cond); {1529#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:53,165 INFO L290 TraceCheckUtils]: 14: Hoare triple {1529#(<= ~counter~0 0)} assume true; {1529#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:53,165 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1529#(<= ~counter~0 0)} {1529#(<= ~counter~0 0)} #92#return; {1529#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:53,165 INFO L290 TraceCheckUtils]: 16: Hoare triple {1529#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1529#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:53,166 INFO L290 TraceCheckUtils]: 17: Hoare triple {1529#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1578#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:53,166 INFO L290 TraceCheckUtils]: 18: Hoare triple {1578#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {1578#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:53,167 INFO L272 TraceCheckUtils]: 19: Hoare triple {1578#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1578#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:53,167 INFO L290 TraceCheckUtils]: 20: Hoare triple {1578#(<= ~counter~0 1)} ~cond := #in~cond; {1578#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:53,167 INFO L290 TraceCheckUtils]: 21: Hoare triple {1578#(<= ~counter~0 1)} assume !(0 == ~cond); {1578#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:53,168 INFO L290 TraceCheckUtils]: 22: Hoare triple {1578#(<= ~counter~0 1)} assume true; {1578#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:53,168 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1578#(<= ~counter~0 1)} {1578#(<= ~counter~0 1)} #94#return; {1578#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:53,169 INFO L290 TraceCheckUtils]: 24: Hoare triple {1578#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1578#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:53,169 INFO L290 TraceCheckUtils]: 25: Hoare triple {1578#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1603#(<= |main_#t~post7| 1)} is VALID [2022-04-15 08:59:53,170 INFO L290 TraceCheckUtils]: 26: Hoare triple {1603#(<= |main_#t~post7| 1)} assume !(#t~post7 < 5);havoc #t~post7; {1522#false} is VALID [2022-04-15 08:59:53,170 INFO L290 TraceCheckUtils]: 27: Hoare triple {1522#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {1522#false} is VALID [2022-04-15 08:59:53,170 INFO L290 TraceCheckUtils]: 28: Hoare triple {1522#false} assume !(#t~post8 < 5);havoc #t~post8; {1522#false} is VALID [2022-04-15 08:59:53,170 INFO L290 TraceCheckUtils]: 29: Hoare triple {1522#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1522#false} is VALID [2022-04-15 08:59:53,170 INFO L290 TraceCheckUtils]: 30: Hoare triple {1522#false} assume !(#t~post6 < 5);havoc #t~post6; {1522#false} is VALID [2022-04-15 08:59:53,170 INFO L272 TraceCheckUtils]: 31: Hoare triple {1522#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1522#false} is VALID [2022-04-15 08:59:53,170 INFO L290 TraceCheckUtils]: 32: Hoare triple {1522#false} ~cond := #in~cond; {1522#false} is VALID [2022-04-15 08:59:53,170 INFO L290 TraceCheckUtils]: 33: Hoare triple {1522#false} assume 0 == ~cond; {1522#false} is VALID [2022-04-15 08:59:53,170 INFO L290 TraceCheckUtils]: 34: Hoare triple {1522#false} assume !false; {1522#false} is VALID [2022-04-15 08:59:53,171 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 08:59:53,171 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 08:59:53,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:59:53,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407265554] [2022-04-15 08:59:53,171 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:59:53,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783969056] [2022-04-15 08:59:53,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783969056] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:59:53,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:59:53,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 08:59:53,172 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:59:53,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [446518384] [2022-04-15 08:59:53,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [446518384] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:59:53,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:59:53,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 08:59:53,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484010094] [2022-04-15 08:59:53,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:59:53,173 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 08:59:53,173 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:59:53,173 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 08:59:53,198 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 08:59:53,198 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 08:59:53,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:59:53,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 08:59:53,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 08:59:53,199 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 08:59:53,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:53,325 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2022-04-15 08:59:53,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 08:59:53,326 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 08:59:53,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:59:53,326 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 08:59:53,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-15 08:59:53,328 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 08:59:53,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-15 08:59:53,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 77 transitions. [2022-04-15 08:59:53,392 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 08:59:53,394 INFO L225 Difference]: With dead ends: 65 [2022-04-15 08:59:53,394 INFO L226 Difference]: Without dead ends: 44 [2022-04-15 08:59:53,394 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 08:59:53,395 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 08:59:53,395 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 08:59:53,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-15 08:59:53,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-15 08:59:53,428 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:59:53,429 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 08:59:53,429 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 08:59:53,429 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 08:59:53,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:53,431 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-15 08:59:53,431 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-15 08:59:53,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:59:53,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:59:53,432 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-15 08:59:53,432 INFO L87 Difference]: Start difference. First operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-15 08:59:53,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:53,434 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-15 08:59:53,434 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-15 08:59:53,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:59:53,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:59:53,440 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:59:53,440 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:59:53,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 08:59:53,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-04-15 08:59:53,442 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 35 [2022-04-15 08:59:53,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:59:53,442 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-04-15 08:59:53,442 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 08:59:53,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 51 transitions. [2022-04-15 08:59:54,555 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 08:59:54,555 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-15 08:59:54,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 08:59:54,556 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:59:54,556 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 08:59:54,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 08:59:54,757 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 08:59:54,757 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:59:54,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:59:54,758 INFO L85 PathProgramCache]: Analyzing trace with hash -174895632, now seen corresponding path program 1 times [2022-04-15 08:59:54,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:59:54,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1343197959] [2022-04-15 08:59:54,758 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:59:54,758 INFO L85 PathProgramCache]: Analyzing trace with hash -174895632, now seen corresponding path program 2 times [2022-04-15 08:59:54,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:59:54,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394145979] [2022-04-15 08:59:54,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:59:54,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:59:54,772 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:59:54,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [255106950] [2022-04-15 08:59:54,772 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:59:54,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:59:54,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:59:54,775 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 08:59:54,777 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 08:59:54,833 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:59:54,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:59:54,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 08:59:54,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:59:54,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:59:55,075 INFO L272 TraceCheckUtils]: 0: Hoare triple {1936#true} call ULTIMATE.init(); {1936#true} is VALID [2022-04-15 08:59:55,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {1936#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1944#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:55,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {1944#(<= ~counter~0 0)} assume true; {1944#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:55,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1944#(<= ~counter~0 0)} {1936#true} #102#return; {1944#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:55,077 INFO L272 TraceCheckUtils]: 4: Hoare triple {1944#(<= ~counter~0 0)} call #t~ret9 := main(); {1944#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:55,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {1944#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {1944#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:55,078 INFO L272 TraceCheckUtils]: 6: Hoare triple {1944#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1944#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:55,078 INFO L290 TraceCheckUtils]: 7: Hoare triple {1944#(<= ~counter~0 0)} ~cond := #in~cond; {1944#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:55,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {1944#(<= ~counter~0 0)} assume !(0 == ~cond); {1944#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:55,079 INFO L290 TraceCheckUtils]: 9: Hoare triple {1944#(<= ~counter~0 0)} assume true; {1944#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:55,080 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1944#(<= ~counter~0 0)} {1944#(<= ~counter~0 0)} #90#return; {1944#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:55,080 INFO L272 TraceCheckUtils]: 11: Hoare triple {1944#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1944#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:55,081 INFO L290 TraceCheckUtils]: 12: Hoare triple {1944#(<= ~counter~0 0)} ~cond := #in~cond; {1944#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:55,082 INFO L290 TraceCheckUtils]: 13: Hoare triple {1944#(<= ~counter~0 0)} assume !(0 == ~cond); {1944#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:55,082 INFO L290 TraceCheckUtils]: 14: Hoare triple {1944#(<= ~counter~0 0)} assume true; {1944#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:55,083 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1944#(<= ~counter~0 0)} {1944#(<= ~counter~0 0)} #92#return; {1944#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:55,083 INFO L290 TraceCheckUtils]: 16: Hoare triple {1944#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1944#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:55,084 INFO L290 TraceCheckUtils]: 17: Hoare triple {1944#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1993#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:55,084 INFO L290 TraceCheckUtils]: 18: Hoare triple {1993#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {1993#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:55,085 INFO L272 TraceCheckUtils]: 19: Hoare triple {1993#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1993#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:55,085 INFO L290 TraceCheckUtils]: 20: Hoare triple {1993#(<= ~counter~0 1)} ~cond := #in~cond; {1993#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:55,086 INFO L290 TraceCheckUtils]: 21: Hoare triple {1993#(<= ~counter~0 1)} assume !(0 == ~cond); {1993#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:55,086 INFO L290 TraceCheckUtils]: 22: Hoare triple {1993#(<= ~counter~0 1)} assume true; {1993#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:55,087 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1993#(<= ~counter~0 1)} {1993#(<= ~counter~0 1)} #94#return; {1993#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:55,087 INFO L290 TraceCheckUtils]: 24: Hoare triple {1993#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1993#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:55,091 INFO L290 TraceCheckUtils]: 25: Hoare triple {1993#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2018#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:55,091 INFO L290 TraceCheckUtils]: 26: Hoare triple {2018#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {2018#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:55,092 INFO L272 TraceCheckUtils]: 27: Hoare triple {2018#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2018#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:55,092 INFO L290 TraceCheckUtils]: 28: Hoare triple {2018#(<= ~counter~0 2)} ~cond := #in~cond; {2018#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:55,093 INFO L290 TraceCheckUtils]: 29: Hoare triple {2018#(<= ~counter~0 2)} assume !(0 == ~cond); {2018#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:55,093 INFO L290 TraceCheckUtils]: 30: Hoare triple {2018#(<= ~counter~0 2)} assume true; {2018#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:55,094 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2018#(<= ~counter~0 2)} {2018#(<= ~counter~0 2)} #96#return; {2018#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:55,094 INFO L290 TraceCheckUtils]: 32: Hoare triple {2018#(<= ~counter~0 2)} assume !(~r~0 > 0); {2018#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:55,095 INFO L290 TraceCheckUtils]: 33: Hoare triple {2018#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2043#(<= |main_#t~post8| 2)} is VALID [2022-04-15 08:59:55,095 INFO L290 TraceCheckUtils]: 34: Hoare triple {2043#(<= |main_#t~post8| 2)} assume !(#t~post8 < 5);havoc #t~post8; {1937#false} is VALID [2022-04-15 08:59:55,095 INFO L290 TraceCheckUtils]: 35: Hoare triple {1937#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1937#false} is VALID [2022-04-15 08:59:55,095 INFO L290 TraceCheckUtils]: 36: Hoare triple {1937#false} assume !(#t~post6 < 5);havoc #t~post6; {1937#false} is VALID [2022-04-15 08:59:55,096 INFO L272 TraceCheckUtils]: 37: Hoare triple {1937#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1937#false} is VALID [2022-04-15 08:59:55,096 INFO L290 TraceCheckUtils]: 38: Hoare triple {1937#false} ~cond := #in~cond; {1937#false} is VALID [2022-04-15 08:59:55,096 INFO L290 TraceCheckUtils]: 39: Hoare triple {1937#false} assume 0 == ~cond; {1937#false} is VALID [2022-04-15 08:59:55,096 INFO L290 TraceCheckUtils]: 40: Hoare triple {1937#false} assume !false; {1937#false} is VALID [2022-04-15 08:59:55,096 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 08:59:55,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:59:55,329 INFO L290 TraceCheckUtils]: 40: Hoare triple {1937#false} assume !false; {1937#false} is VALID [2022-04-15 08:59:55,329 INFO L290 TraceCheckUtils]: 39: Hoare triple {1937#false} assume 0 == ~cond; {1937#false} is VALID [2022-04-15 08:59:55,329 INFO L290 TraceCheckUtils]: 38: Hoare triple {1937#false} ~cond := #in~cond; {1937#false} is VALID [2022-04-15 08:59:55,330 INFO L272 TraceCheckUtils]: 37: Hoare triple {1937#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1937#false} is VALID [2022-04-15 08:59:55,330 INFO L290 TraceCheckUtils]: 36: Hoare triple {1937#false} assume !(#t~post6 < 5);havoc #t~post6; {1937#false} is VALID [2022-04-15 08:59:55,330 INFO L290 TraceCheckUtils]: 35: Hoare triple {1937#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1937#false} is VALID [2022-04-15 08:59:55,330 INFO L290 TraceCheckUtils]: 34: Hoare triple {2083#(< |main_#t~post8| 5)} assume !(#t~post8 < 5);havoc #t~post8; {1937#false} is VALID [2022-04-15 08:59:55,331 INFO L290 TraceCheckUtils]: 33: Hoare triple {2087#(< ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2083#(< |main_#t~post8| 5)} is VALID [2022-04-15 08:59:55,331 INFO L290 TraceCheckUtils]: 32: Hoare triple {2087#(< ~counter~0 5)} assume !(~r~0 > 0); {2087#(< ~counter~0 5)} is VALID [2022-04-15 08:59:55,332 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1936#true} {2087#(< ~counter~0 5)} #96#return; {2087#(< ~counter~0 5)} is VALID [2022-04-15 08:59:55,332 INFO L290 TraceCheckUtils]: 30: Hoare triple {1936#true} assume true; {1936#true} is VALID [2022-04-15 08:59:55,332 INFO L290 TraceCheckUtils]: 29: Hoare triple {1936#true} assume !(0 == ~cond); {1936#true} is VALID [2022-04-15 08:59:55,332 INFO L290 TraceCheckUtils]: 28: Hoare triple {1936#true} ~cond := #in~cond; {1936#true} is VALID [2022-04-15 08:59:55,332 INFO L272 TraceCheckUtils]: 27: Hoare triple {2087#(< ~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)); {1936#true} is VALID [2022-04-15 08:59:55,333 INFO L290 TraceCheckUtils]: 26: Hoare triple {2087#(< ~counter~0 5)} assume !!(#t~post7 < 5);havoc #t~post7; {2087#(< ~counter~0 5)} is VALID [2022-04-15 08:59:55,333 INFO L290 TraceCheckUtils]: 25: Hoare triple {2112#(< ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2087#(< ~counter~0 5)} is VALID [2022-04-15 08:59:55,334 INFO L290 TraceCheckUtils]: 24: Hoare triple {2112#(< ~counter~0 4)} assume !!(0 != ~r~0); {2112#(< ~counter~0 4)} is VALID [2022-04-15 08:59:55,335 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1936#true} {2112#(< ~counter~0 4)} #94#return; {2112#(< ~counter~0 4)} is VALID [2022-04-15 08:59:55,335 INFO L290 TraceCheckUtils]: 22: Hoare triple {1936#true} assume true; {1936#true} is VALID [2022-04-15 08:59:55,335 INFO L290 TraceCheckUtils]: 21: Hoare triple {1936#true} assume !(0 == ~cond); {1936#true} is VALID [2022-04-15 08:59:55,335 INFO L290 TraceCheckUtils]: 20: Hoare triple {1936#true} ~cond := #in~cond; {1936#true} is VALID [2022-04-15 08:59:55,335 INFO L272 TraceCheckUtils]: 19: Hoare triple {2112#(< ~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)); {1936#true} is VALID [2022-04-15 08:59:55,336 INFO L290 TraceCheckUtils]: 18: Hoare triple {2112#(< ~counter~0 4)} assume !!(#t~post6 < 5);havoc #t~post6; {2112#(< ~counter~0 4)} is VALID [2022-04-15 08:59:55,336 INFO L290 TraceCheckUtils]: 17: Hoare triple {2018#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2112#(< ~counter~0 4)} is VALID [2022-04-15 08:59:55,337 INFO L290 TraceCheckUtils]: 16: Hoare triple {2018#(<= ~counter~0 2)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2018#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:55,337 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1936#true} {2018#(<= ~counter~0 2)} #92#return; {2018#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:55,337 INFO L290 TraceCheckUtils]: 14: Hoare triple {1936#true} assume true; {1936#true} is VALID [2022-04-15 08:59:55,338 INFO L290 TraceCheckUtils]: 13: Hoare triple {1936#true} assume !(0 == ~cond); {1936#true} is VALID [2022-04-15 08:59:55,338 INFO L290 TraceCheckUtils]: 12: Hoare triple {1936#true} ~cond := #in~cond; {1936#true} is VALID [2022-04-15 08:59:55,338 INFO L272 TraceCheckUtils]: 11: Hoare triple {2018#(<= ~counter~0 2)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1936#true} is VALID [2022-04-15 08:59:55,338 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1936#true} {2018#(<= ~counter~0 2)} #90#return; {2018#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:55,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {1936#true} assume true; {1936#true} is VALID [2022-04-15 08:59:55,339 INFO L290 TraceCheckUtils]: 8: Hoare triple {1936#true} assume !(0 == ~cond); {1936#true} is VALID [2022-04-15 08:59:55,339 INFO L290 TraceCheckUtils]: 7: Hoare triple {1936#true} ~cond := #in~cond; {1936#true} is VALID [2022-04-15 08:59:55,339 INFO L272 TraceCheckUtils]: 6: Hoare triple {2018#(<= ~counter~0 2)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1936#true} is VALID [2022-04-15 08:59:55,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {2018#(<= ~counter~0 2)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {2018#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:55,340 INFO L272 TraceCheckUtils]: 4: Hoare triple {2018#(<= ~counter~0 2)} call #t~ret9 := main(); {2018#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:55,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2018#(<= ~counter~0 2)} {1936#true} #102#return; {2018#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:55,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {2018#(<= ~counter~0 2)} assume true; {2018#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:55,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {1936#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2018#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:55,341 INFO L272 TraceCheckUtils]: 0: Hoare triple {1936#true} call ULTIMATE.init(); {1936#true} is VALID [2022-04-15 08:59:55,341 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 08:59:55,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:59:55,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394145979] [2022-04-15 08:59:55,342 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:59:55,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255106950] [2022-04-15 08:59:55,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255106950] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 08:59:55,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 08:59:55,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2022-04-15 08:59:55,343 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:59:55,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1343197959] [2022-04-15 08:59:55,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1343197959] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:59:55,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:59:55,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 08:59:55,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440901111] [2022-04-15 08:59:55,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:59:55,344 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 08:59:55,344 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:59:55,344 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 08:59:55,375 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 08:59:55,376 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 08:59:55,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:59:55,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 08:59:55,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-15 08:59:55,377 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 08:59:55,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:55,562 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2022-04-15 08:59:55,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 08:59:55,563 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 08:59:55,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:59:55,563 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 08:59:55,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-15 08:59:55,565 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 08:59:55,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-15 08:59:55,567 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 87 transitions. [2022-04-15 08:59:55,638 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 08:59:55,642 INFO L225 Difference]: With dead ends: 74 [2022-04-15 08:59:55,642 INFO L226 Difference]: Without dead ends: 53 [2022-04-15 08:59:55,642 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-15 08:59:55,644 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 22 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:59:55,645 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 125 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:59:55,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-15 08:59:55,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-04-15 08:59:55,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:59:55,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 08:59:55,697 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 08:59:55,698 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 08:59:55,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:55,699 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-15 08:59:55,699 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-15 08:59:55,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:59:55,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:59:55,700 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 53 states. [2022-04-15 08:59:55,700 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 53 states. [2022-04-15 08:59:55,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:55,706 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-15 08:59:55,706 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-15 08:59:55,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:59:55,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:59:55,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:59:55,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:59:55,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 08:59:55,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2022-04-15 08:59:55,709 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 41 [2022-04-15 08:59:55,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:59:55,709 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2022-04-15 08:59:55,709 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 08:59:55,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 60 transitions. [2022-04-15 08:59:56,302 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 08:59:56,302 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2022-04-15 08:59:56,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 08:59:56,303 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:59:56,303 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 08:59:56,328 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 08:59:56,503 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 08:59:56,504 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:59:56,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:59:56,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1292932747, now seen corresponding path program 1 times [2022-04-15 08:59:56,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:59:56,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [326191342] [2022-04-15 08:59:56,505 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:59:56,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1292932747, now seen corresponding path program 2 times [2022-04-15 08:59:56,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:59:56,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118605080] [2022-04-15 08:59:56,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:59:56,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:59:56,529 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:59:56,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1072119183] [2022-04-15 08:59:56,530 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:59:56,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:59:56,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:59:56,532 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 08:59:56,534 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 08:59:56,575 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:59:56,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:59:56,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 08:59:56,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:59:56,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:59:56,832 INFO L272 TraceCheckUtils]: 0: Hoare triple {2548#true} call ULTIMATE.init(); {2548#true} is VALID [2022-04-15 08:59:56,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {2548#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; {2556#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:56,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {2556#(<= ~counter~0 0)} assume true; {2556#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:56,840 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2556#(<= ~counter~0 0)} {2548#true} #102#return; {2556#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:56,841 INFO L272 TraceCheckUtils]: 4: Hoare triple {2556#(<= ~counter~0 0)} call #t~ret9 := main(); {2556#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:56,843 INFO L290 TraceCheckUtils]: 5: Hoare triple {2556#(<= ~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; {2556#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:56,844 INFO L272 TraceCheckUtils]: 6: Hoare triple {2556#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2556#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:56,845 INFO L290 TraceCheckUtils]: 7: Hoare triple {2556#(<= ~counter~0 0)} ~cond := #in~cond; {2556#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:56,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {2556#(<= ~counter~0 0)} assume !(0 == ~cond); {2556#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:56,846 INFO L290 TraceCheckUtils]: 9: Hoare triple {2556#(<= ~counter~0 0)} assume true; {2556#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:56,847 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2556#(<= ~counter~0 0)} {2556#(<= ~counter~0 0)} #90#return; {2556#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:56,847 INFO L272 TraceCheckUtils]: 11: Hoare triple {2556#(<= ~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)); {2556#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:56,848 INFO L290 TraceCheckUtils]: 12: Hoare triple {2556#(<= ~counter~0 0)} ~cond := #in~cond; {2556#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:56,848 INFO L290 TraceCheckUtils]: 13: Hoare triple {2556#(<= ~counter~0 0)} assume !(0 == ~cond); {2556#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:56,848 INFO L290 TraceCheckUtils]: 14: Hoare triple {2556#(<= ~counter~0 0)} assume true; {2556#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:56,849 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2556#(<= ~counter~0 0)} {2556#(<= ~counter~0 0)} #92#return; {2556#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:56,849 INFO L290 TraceCheckUtils]: 16: Hoare triple {2556#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2556#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:56,850 INFO L290 TraceCheckUtils]: 17: Hoare triple {2556#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2605#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:56,850 INFO L290 TraceCheckUtils]: 18: Hoare triple {2605#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {2605#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:56,851 INFO L272 TraceCheckUtils]: 19: Hoare triple {2605#(<= ~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)); {2605#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:56,851 INFO L290 TraceCheckUtils]: 20: Hoare triple {2605#(<= ~counter~0 1)} ~cond := #in~cond; {2605#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:56,852 INFO L290 TraceCheckUtils]: 21: Hoare triple {2605#(<= ~counter~0 1)} assume !(0 == ~cond); {2605#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:56,852 INFO L290 TraceCheckUtils]: 22: Hoare triple {2605#(<= ~counter~0 1)} assume true; {2605#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:56,853 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2605#(<= ~counter~0 1)} {2605#(<= ~counter~0 1)} #94#return; {2605#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:56,853 INFO L290 TraceCheckUtils]: 24: Hoare triple {2605#(<= ~counter~0 1)} assume !!(0 != ~r~0); {2605#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:56,854 INFO L290 TraceCheckUtils]: 25: Hoare triple {2605#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2630#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:56,854 INFO L290 TraceCheckUtils]: 26: Hoare triple {2630#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {2630#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:56,855 INFO L272 TraceCheckUtils]: 27: Hoare triple {2630#(<= ~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)); {2630#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:56,855 INFO L290 TraceCheckUtils]: 28: Hoare triple {2630#(<= ~counter~0 2)} ~cond := #in~cond; {2630#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:56,856 INFO L290 TraceCheckUtils]: 29: Hoare triple {2630#(<= ~counter~0 2)} assume !(0 == ~cond); {2630#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:56,856 INFO L290 TraceCheckUtils]: 30: Hoare triple {2630#(<= ~counter~0 2)} assume true; {2630#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:56,857 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2630#(<= ~counter~0 2)} {2630#(<= ~counter~0 2)} #96#return; {2630#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:56,857 INFO L290 TraceCheckUtils]: 32: Hoare triple {2630#(<= ~counter~0 2)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2630#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:56,857 INFO L290 TraceCheckUtils]: 33: Hoare triple {2630#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2655#(<= |main_#t~post7| 2)} is VALID [2022-04-15 08:59:56,858 INFO L290 TraceCheckUtils]: 34: Hoare triple {2655#(<= |main_#t~post7| 2)} assume !(#t~post7 < 5);havoc #t~post7; {2549#false} is VALID [2022-04-15 08:59:56,858 INFO L290 TraceCheckUtils]: 35: Hoare triple {2549#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2549#false} is VALID [2022-04-15 08:59:56,858 INFO L290 TraceCheckUtils]: 36: Hoare triple {2549#false} assume !(#t~post8 < 5);havoc #t~post8; {2549#false} is VALID [2022-04-15 08:59:56,858 INFO L290 TraceCheckUtils]: 37: Hoare triple {2549#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2549#false} is VALID [2022-04-15 08:59:56,858 INFO L290 TraceCheckUtils]: 38: Hoare triple {2549#false} assume !(#t~post6 < 5);havoc #t~post6; {2549#false} is VALID [2022-04-15 08:59:56,859 INFO L272 TraceCheckUtils]: 39: Hoare triple {2549#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)); {2549#false} is VALID [2022-04-15 08:59:56,859 INFO L290 TraceCheckUtils]: 40: Hoare triple {2549#false} ~cond := #in~cond; {2549#false} is VALID [2022-04-15 08:59:56,859 INFO L290 TraceCheckUtils]: 41: Hoare triple {2549#false} assume 0 == ~cond; {2549#false} is VALID [2022-04-15 08:59:56,859 INFO L290 TraceCheckUtils]: 42: Hoare triple {2549#false} assume !false; {2549#false} is VALID [2022-04-15 08:59:56,859 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 08:59:56,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:59:57,073 INFO L290 TraceCheckUtils]: 42: Hoare triple {2549#false} assume !false; {2549#false} is VALID [2022-04-15 08:59:57,074 INFO L290 TraceCheckUtils]: 41: Hoare triple {2549#false} assume 0 == ~cond; {2549#false} is VALID [2022-04-15 08:59:57,074 INFO L290 TraceCheckUtils]: 40: Hoare triple {2549#false} ~cond := #in~cond; {2549#false} is VALID [2022-04-15 08:59:57,074 INFO L272 TraceCheckUtils]: 39: Hoare triple {2549#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)); {2549#false} is VALID [2022-04-15 08:59:57,074 INFO L290 TraceCheckUtils]: 38: Hoare triple {2549#false} assume !(#t~post6 < 5);havoc #t~post6; {2549#false} is VALID [2022-04-15 08:59:57,074 INFO L290 TraceCheckUtils]: 37: Hoare triple {2549#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2549#false} is VALID [2022-04-15 08:59:57,074 INFO L290 TraceCheckUtils]: 36: Hoare triple {2549#false} assume !(#t~post8 < 5);havoc #t~post8; {2549#false} is VALID [2022-04-15 08:59:57,074 INFO L290 TraceCheckUtils]: 35: Hoare triple {2549#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2549#false} is VALID [2022-04-15 08:59:57,075 INFO L290 TraceCheckUtils]: 34: Hoare triple {2707#(< |main_#t~post7| 5)} assume !(#t~post7 < 5);havoc #t~post7; {2549#false} is VALID [2022-04-15 08:59:57,075 INFO L290 TraceCheckUtils]: 33: Hoare triple {2711#(< ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2707#(< |main_#t~post7| 5)} is VALID [2022-04-15 08:59:57,076 INFO L290 TraceCheckUtils]: 32: Hoare triple {2711#(< ~counter~0 5)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2711#(< ~counter~0 5)} is VALID [2022-04-15 08:59:57,077 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2548#true} {2711#(< ~counter~0 5)} #96#return; {2711#(< ~counter~0 5)} is VALID [2022-04-15 08:59:57,077 INFO L290 TraceCheckUtils]: 30: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-15 08:59:57,077 INFO L290 TraceCheckUtils]: 29: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-15 08:59:57,077 INFO L290 TraceCheckUtils]: 28: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-15 08:59:57,077 INFO L272 TraceCheckUtils]: 27: Hoare triple {2711#(< ~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)); {2548#true} is VALID [2022-04-15 08:59:57,078 INFO L290 TraceCheckUtils]: 26: Hoare triple {2711#(< ~counter~0 5)} assume !!(#t~post7 < 5);havoc #t~post7; {2711#(< ~counter~0 5)} is VALID [2022-04-15 08:59:57,078 INFO L290 TraceCheckUtils]: 25: Hoare triple {2736#(< ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2711#(< ~counter~0 5)} is VALID [2022-04-15 08:59:57,079 INFO L290 TraceCheckUtils]: 24: Hoare triple {2736#(< ~counter~0 4)} assume !!(0 != ~r~0); {2736#(< ~counter~0 4)} is VALID [2022-04-15 08:59:57,080 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2548#true} {2736#(< ~counter~0 4)} #94#return; {2736#(< ~counter~0 4)} is VALID [2022-04-15 08:59:57,080 INFO L290 TraceCheckUtils]: 22: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-15 08:59:57,080 INFO L290 TraceCheckUtils]: 21: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-15 08:59:57,080 INFO L290 TraceCheckUtils]: 20: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-15 08:59:57,080 INFO L272 TraceCheckUtils]: 19: Hoare triple {2736#(< ~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)); {2548#true} is VALID [2022-04-15 08:59:57,080 INFO L290 TraceCheckUtils]: 18: Hoare triple {2736#(< ~counter~0 4)} assume !!(#t~post6 < 5);havoc #t~post6; {2736#(< ~counter~0 4)} is VALID [2022-04-15 08:59:57,081 INFO L290 TraceCheckUtils]: 17: Hoare triple {2630#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2736#(< ~counter~0 4)} is VALID [2022-04-15 08:59:57,081 INFO L290 TraceCheckUtils]: 16: Hoare triple {2630#(<= ~counter~0 2)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2630#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:57,081 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2548#true} {2630#(<= ~counter~0 2)} #92#return; {2630#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:57,082 INFO L290 TraceCheckUtils]: 14: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-15 08:59:57,082 INFO L290 TraceCheckUtils]: 13: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-15 08:59:57,082 INFO L290 TraceCheckUtils]: 12: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-15 08:59:57,082 INFO L272 TraceCheckUtils]: 11: Hoare triple {2630#(<= ~counter~0 2)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {2548#true} is VALID [2022-04-15 08:59:57,082 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2548#true} {2630#(<= ~counter~0 2)} #90#return; {2630#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:57,082 INFO L290 TraceCheckUtils]: 9: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-15 08:59:57,082 INFO L290 TraceCheckUtils]: 8: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-15 08:59:57,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-15 08:59:57,083 INFO L272 TraceCheckUtils]: 6: Hoare triple {2630#(<= ~counter~0 2)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2548#true} is VALID [2022-04-15 08:59:57,083 INFO L290 TraceCheckUtils]: 5: Hoare triple {2630#(<= ~counter~0 2)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {2630#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:57,083 INFO L272 TraceCheckUtils]: 4: Hoare triple {2630#(<= ~counter~0 2)} call #t~ret9 := main(); {2630#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:57,084 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2630#(<= ~counter~0 2)} {2548#true} #102#return; {2630#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:57,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {2630#(<= ~counter~0 2)} assume true; {2630#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:57,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {2548#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; {2630#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:57,085 INFO L272 TraceCheckUtils]: 0: Hoare triple {2548#true} call ULTIMATE.init(); {2548#true} is VALID [2022-04-15 08:59:57,085 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 08:59:57,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:59:57,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118605080] [2022-04-15 08:59:57,085 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:59:57,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072119183] [2022-04-15 08:59:57,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072119183] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:59:57,085 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:59:57,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-15 08:59:57,085 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:59:57,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [326191342] [2022-04-15 08:59:57,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [326191342] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:59:57,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:59:57,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 08:59:57,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82112326] [2022-04-15 08:59:57,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:59:57,086 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 08:59:57,086 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:59:57,087 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 08:59:57,116 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 08:59:57,117 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 08:59:57,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:59:57,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 08:59:57,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-15 08:59:57,117 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 08:59:57,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:57,313 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2022-04-15 08:59:57,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 08:59:57,313 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 08:59:57,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:59:57,314 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 08:59:57,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-04-15 08:59:57,316 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 08:59:57,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-04-15 08:59:57,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 87 transitions. [2022-04-15 08:59:57,393 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 08:59:57,394 INFO L225 Difference]: With dead ends: 75 [2022-04-15 08:59:57,394 INFO L226 Difference]: Without dead ends: 54 [2022-04-15 08:59:57,394 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-15 08:59:57,395 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 15 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:59:57,395 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 110 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:59:57,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-15 08:59:57,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-15 08:59:57,456 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:59:57,456 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 08:59:57,457 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 08:59:57,458 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 08:59:57,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:57,460 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-15 08:59:57,460 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-04-15 08:59:57,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:59:57,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:59:57,461 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-15 08:59:57,461 INFO L87 Difference]: Start difference. First operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-15 08:59:57,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:57,463 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-15 08:59:57,463 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-04-15 08:59:57,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:59:57,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:59:57,464 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:59:57,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:59:57,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 08:59:57,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2022-04-15 08:59:57,466 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 43 [2022-04-15 08:59:57,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:59:57,466 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2022-04-15 08:59:57,466 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 08:59:57,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 62 transitions. [2022-04-15 08:59:59,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 61 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 08:59:59,549 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-04-15 08:59:59,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 08:59:59,550 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:59:59,550 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 08:59:59,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-15 08:59:59,750 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 08:59:59,751 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:59:59,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:59:59,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1407897436, now seen corresponding path program 1 times [2022-04-15 08:59:59,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:59:59,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1737453086] [2022-04-15 08:59:59,752 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:59:59,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1407897436, now seen corresponding path program 2 times [2022-04-15 08:59:59,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:59:59,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123746074] [2022-04-15 08:59:59,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:59:59,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:59:59,768 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:59:59,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [937277377] [2022-04-15 08:59:59,768 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:59:59,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:59:59,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:59:59,771 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 08:59:59,795 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 08:59:59,823 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:59:59,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:59:59,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-15 08:59:59,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:59:59,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:00:00,005 INFO L272 TraceCheckUtils]: 0: Hoare triple {3182#true} call ULTIMATE.init(); {3182#true} is VALID [2022-04-15 09:00:00,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {3182#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; {3182#true} is VALID [2022-04-15 09:00:00,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {3182#true} assume true; {3182#true} is VALID [2022-04-15 09:00:00,005 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3182#true} {3182#true} #102#return; {3182#true} is VALID [2022-04-15 09:00:00,005 INFO L272 TraceCheckUtils]: 4: Hoare triple {3182#true} call #t~ret9 := main(); {3182#true} is VALID [2022-04-15 09:00:00,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {3182#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; {3182#true} is VALID [2022-04-15 09:00:00,006 INFO L272 TraceCheckUtils]: 6: Hoare triple {3182#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {3182#true} is VALID [2022-04-15 09:00:00,006 INFO L290 TraceCheckUtils]: 7: Hoare triple {3182#true} ~cond := #in~cond; {3182#true} is VALID [2022-04-15 09:00:00,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {3182#true} assume !(0 == ~cond); {3182#true} is VALID [2022-04-15 09:00:00,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {3182#true} assume true; {3182#true} is VALID [2022-04-15 09:00:00,006 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3182#true} {3182#true} #90#return; {3182#true} is VALID [2022-04-15 09:00:00,006 INFO L272 TraceCheckUtils]: 11: Hoare triple {3182#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)); {3182#true} is VALID [2022-04-15 09:00:00,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {3182#true} ~cond := #in~cond; {3182#true} is VALID [2022-04-15 09:00:00,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {3182#true} assume !(0 == ~cond); {3182#true} is VALID [2022-04-15 09:00:00,006 INFO L290 TraceCheckUtils]: 14: Hoare triple {3182#true} assume true; {3182#true} is VALID [2022-04-15 09:00:00,007 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3182#true} {3182#true} #92#return; {3182#true} is VALID [2022-04-15 09:00:00,007 INFO L290 TraceCheckUtils]: 16: Hoare triple {3182#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {3182#true} is VALID [2022-04-15 09:00:00,007 INFO L290 TraceCheckUtils]: 17: Hoare triple {3182#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3182#true} is VALID [2022-04-15 09:00:00,007 INFO L290 TraceCheckUtils]: 18: Hoare triple {3182#true} assume !!(#t~post6 < 5);havoc #t~post6; {3182#true} is VALID [2022-04-15 09:00:00,007 INFO L272 TraceCheckUtils]: 19: Hoare triple {3182#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)); {3182#true} is VALID [2022-04-15 09:00:00,007 INFO L290 TraceCheckUtils]: 20: Hoare triple {3182#true} ~cond := #in~cond; {3182#true} is VALID [2022-04-15 09:00:00,007 INFO L290 TraceCheckUtils]: 21: Hoare triple {3182#true} assume !(0 == ~cond); {3182#true} is VALID [2022-04-15 09:00:00,007 INFO L290 TraceCheckUtils]: 22: Hoare triple {3182#true} assume true; {3182#true} is VALID [2022-04-15 09:00:00,008 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3182#true} {3182#true} #94#return; {3182#true} is VALID [2022-04-15 09:00:00,008 INFO L290 TraceCheckUtils]: 24: Hoare triple {3182#true} assume !!(0 != ~r~0); {3259#(not (= main_~r~0 0))} is VALID [2022-04-15 09:00:00,008 INFO L290 TraceCheckUtils]: 25: Hoare triple {3259#(not (= main_~r~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3259#(not (= main_~r~0 0))} is VALID [2022-04-15 09:00:00,008 INFO L290 TraceCheckUtils]: 26: Hoare triple {3259#(not (= main_~r~0 0))} assume !!(#t~post7 < 5);havoc #t~post7; {3259#(not (= main_~r~0 0))} is VALID [2022-04-15 09:00:00,009 INFO L272 TraceCheckUtils]: 27: Hoare triple {3259#(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)); {3182#true} is VALID [2022-04-15 09:00:00,009 INFO L290 TraceCheckUtils]: 28: Hoare triple {3182#true} ~cond := #in~cond; {3182#true} is VALID [2022-04-15 09:00:00,009 INFO L290 TraceCheckUtils]: 29: Hoare triple {3182#true} assume !(0 == ~cond); {3182#true} is VALID [2022-04-15 09:00:00,009 INFO L290 TraceCheckUtils]: 30: Hoare triple {3182#true} assume true; {3182#true} is VALID [2022-04-15 09:00:00,010 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3182#true} {3259#(not (= main_~r~0 0))} #96#return; {3259#(not (= main_~r~0 0))} is VALID [2022-04-15 09:00:00,010 INFO L290 TraceCheckUtils]: 32: Hoare triple {3259#(not (= main_~r~0 0))} assume !(~r~0 > 0); {3284#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 09:00:00,010 INFO L290 TraceCheckUtils]: 33: Hoare triple {3284#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3284#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 09:00:00,011 INFO L290 TraceCheckUtils]: 34: Hoare triple {3284#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} assume !!(#t~post8 < 5);havoc #t~post8; {3284#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 09:00:00,011 INFO L272 TraceCheckUtils]: 35: Hoare triple {3284#(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)); {3182#true} is VALID [2022-04-15 09:00:00,011 INFO L290 TraceCheckUtils]: 36: Hoare triple {3182#true} ~cond := #in~cond; {3182#true} is VALID [2022-04-15 09:00:00,011 INFO L290 TraceCheckUtils]: 37: Hoare triple {3182#true} assume !(0 == ~cond); {3182#true} is VALID [2022-04-15 09:00:00,011 INFO L290 TraceCheckUtils]: 38: Hoare triple {3182#true} assume true; {3182#true} is VALID [2022-04-15 09:00:00,019 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3182#true} {3284#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} #98#return; {3284#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 09:00:00,020 INFO L290 TraceCheckUtils]: 40: Hoare triple {3284#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} assume !(~r~0 < 0); {3183#false} is VALID [2022-04-15 09:00:00,020 INFO L290 TraceCheckUtils]: 41: Hoare triple {3183#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3183#false} is VALID [2022-04-15 09:00:00,020 INFO L290 TraceCheckUtils]: 42: Hoare triple {3183#false} assume !(#t~post6 < 5);havoc #t~post6; {3183#false} is VALID [2022-04-15 09:00:00,020 INFO L272 TraceCheckUtils]: 43: Hoare triple {3183#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)); {3183#false} is VALID [2022-04-15 09:00:00,021 INFO L290 TraceCheckUtils]: 44: Hoare triple {3183#false} ~cond := #in~cond; {3183#false} is VALID [2022-04-15 09:00:00,025 INFO L290 TraceCheckUtils]: 45: Hoare triple {3183#false} assume 0 == ~cond; {3183#false} is VALID [2022-04-15 09:00:00,025 INFO L290 TraceCheckUtils]: 46: Hoare triple {3183#false} assume !false; {3183#false} is VALID [2022-04-15 09:00:00,025 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:00,025 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 09:00:00,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:00:00,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123746074] [2022-04-15 09:00:00,026 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:00:00,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937277377] [2022-04-15 09:00:00,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937277377] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:00:00,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:00:00,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 09:00:00,027 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:00:00,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1737453086] [2022-04-15 09:00:00,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1737453086] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:00:00,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:00:00,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 09:00:00,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33123595] [2022-04-15 09:00:00,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:00:00,030 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:00,030 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:00:00,030 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:00,060 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:00,061 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 09:00:00,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:00:00,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 09:00:00,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-15 09:00:00,061 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 09:00:00,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:00:00,260 INFO L93 Difference]: Finished difference Result 101 states and 131 transitions. [2022-04-15 09:00:00,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 09:00:00,261 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:00,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:00:00,261 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:00,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-15 09:00:00,263 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:00,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-15 09:00:00,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 108 transitions. [2022-04-15 09:00:00,341 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:00,342 INFO L225 Difference]: With dead ends: 101 [2022-04-15 09:00:00,342 INFO L226 Difference]: Without dead ends: 80 [2022-04-15 09:00:00,343 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:00,343 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 19 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 09:00:00,344 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 131 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 09:00:00,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-15 09:00:00,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2022-04-15 09:00:00,406 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:00:00,406 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 09:00:00,406 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 09:00:00,407 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 09:00:00,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:00:00,409 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2022-04-15 09:00:00,409 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2022-04-15 09:00:00,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:00:00,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:00:00,410 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 80 states. [2022-04-15 09:00:00,410 INFO L87 Difference]: Start difference. First operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 80 states. [2022-04-15 09:00:00,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:00:00,413 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2022-04-15 09:00:00,413 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2022-04-15 09:00:00,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:00:00,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:00:00,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:00:00,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:00:00,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 09:00:00,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 87 transitions. [2022-04-15 09:00:00,416 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 87 transitions. Word has length 47 [2022-04-15 09:00:00,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:00:00,416 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 87 transitions. [2022-04-15 09:00:00,416 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:00,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 87 transitions. [2022-04-15 09:00:01,185 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:01,186 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2022-04-15 09:00:01,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 09:00:01,186 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:00:01,186 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:01,202 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:01,387 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:01,388 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:00:01,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:00:01,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1915058849, now seen corresponding path program 1 times [2022-04-15 09:00:01,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:00:01,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [664504788] [2022-04-15 09:00:01,389 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:00:01,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1915058849, now seen corresponding path program 2 times [2022-04-15 09:00:01,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:00:01,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986783098] [2022-04-15 09:00:01,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:00:01,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:00:01,401 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:00:01,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [636847974] [2022-04-15 09:00:01,402 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:00:01,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:00:01,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:00:01,403 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:01,405 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:01,451 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:00:01,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:00:01,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 09:00:01,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:00:01,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:00:01,710 INFO L272 TraceCheckUtils]: 0: Hoare triple {3828#true} call ULTIMATE.init(); {3828#true} is VALID [2022-04-15 09:00:01,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {3828#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; {3836#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:01,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {3836#(<= ~counter~0 0)} assume true; {3836#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:01,712 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3836#(<= ~counter~0 0)} {3828#true} #102#return; {3836#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:01,713 INFO L272 TraceCheckUtils]: 4: Hoare triple {3836#(<= ~counter~0 0)} call #t~ret9 := main(); {3836#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:01,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {3836#(<= ~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; {3836#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:01,714 INFO L272 TraceCheckUtils]: 6: Hoare triple {3836#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {3836#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:01,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {3836#(<= ~counter~0 0)} ~cond := #in~cond; {3836#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:01,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {3836#(<= ~counter~0 0)} assume !(0 == ~cond); {3836#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:01,715 INFO L290 TraceCheckUtils]: 9: Hoare triple {3836#(<= ~counter~0 0)} assume true; {3836#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:01,715 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3836#(<= ~counter~0 0)} {3836#(<= ~counter~0 0)} #90#return; {3836#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:01,716 INFO L272 TraceCheckUtils]: 11: Hoare triple {3836#(<= ~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)); {3836#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:01,717 INFO L290 TraceCheckUtils]: 12: Hoare triple {3836#(<= ~counter~0 0)} ~cond := #in~cond; {3836#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:01,717 INFO L290 TraceCheckUtils]: 13: Hoare triple {3836#(<= ~counter~0 0)} assume !(0 == ~cond); {3836#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:01,717 INFO L290 TraceCheckUtils]: 14: Hoare triple {3836#(<= ~counter~0 0)} assume true; {3836#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:01,718 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3836#(<= ~counter~0 0)} {3836#(<= ~counter~0 0)} #92#return; {3836#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:01,718 INFO L290 TraceCheckUtils]: 16: Hoare triple {3836#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {3836#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:01,719 INFO L290 TraceCheckUtils]: 17: Hoare triple {3836#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3885#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:01,720 INFO L290 TraceCheckUtils]: 18: Hoare triple {3885#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {3885#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:01,720 INFO L272 TraceCheckUtils]: 19: Hoare triple {3885#(<= ~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)); {3885#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:01,721 INFO L290 TraceCheckUtils]: 20: Hoare triple {3885#(<= ~counter~0 1)} ~cond := #in~cond; {3885#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:01,721 INFO L290 TraceCheckUtils]: 21: Hoare triple {3885#(<= ~counter~0 1)} assume !(0 == ~cond); {3885#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:01,722 INFO L290 TraceCheckUtils]: 22: Hoare triple {3885#(<= ~counter~0 1)} assume true; {3885#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:01,722 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3885#(<= ~counter~0 1)} {3885#(<= ~counter~0 1)} #94#return; {3885#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:01,723 INFO L290 TraceCheckUtils]: 24: Hoare triple {3885#(<= ~counter~0 1)} assume !!(0 != ~r~0); {3885#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:01,723 INFO L290 TraceCheckUtils]: 25: Hoare triple {3885#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3910#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:01,724 INFO L290 TraceCheckUtils]: 26: Hoare triple {3910#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {3910#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:01,725 INFO L272 TraceCheckUtils]: 27: Hoare triple {3910#(<= ~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)); {3910#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:01,725 INFO L290 TraceCheckUtils]: 28: Hoare triple {3910#(<= ~counter~0 2)} ~cond := #in~cond; {3910#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:01,725 INFO L290 TraceCheckUtils]: 29: Hoare triple {3910#(<= ~counter~0 2)} assume !(0 == ~cond); {3910#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:01,726 INFO L290 TraceCheckUtils]: 30: Hoare triple {3910#(<= ~counter~0 2)} assume true; {3910#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:01,727 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3910#(<= ~counter~0 2)} {3910#(<= ~counter~0 2)} #96#return; {3910#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:01,727 INFO L290 TraceCheckUtils]: 32: Hoare triple {3910#(<= ~counter~0 2)} assume !(~r~0 > 0); {3910#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:01,728 INFO L290 TraceCheckUtils]: 33: Hoare triple {3910#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3935#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:01,728 INFO L290 TraceCheckUtils]: 34: Hoare triple {3935#(<= ~counter~0 3)} assume !!(#t~post8 < 5);havoc #t~post8; {3935#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:01,729 INFO L272 TraceCheckUtils]: 35: Hoare triple {3935#(<= ~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)); {3935#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:01,729 INFO L290 TraceCheckUtils]: 36: Hoare triple {3935#(<= ~counter~0 3)} ~cond := #in~cond; {3935#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:01,729 INFO L290 TraceCheckUtils]: 37: Hoare triple {3935#(<= ~counter~0 3)} assume !(0 == ~cond); {3935#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:01,730 INFO L290 TraceCheckUtils]: 38: Hoare triple {3935#(<= ~counter~0 3)} assume true; {3935#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:01,731 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3935#(<= ~counter~0 3)} {3935#(<= ~counter~0 3)} #98#return; {3935#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:01,731 INFO L290 TraceCheckUtils]: 40: Hoare triple {3935#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {3935#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:01,731 INFO L290 TraceCheckUtils]: 41: Hoare triple {3935#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3960#(<= |main_#t~post8| 3)} is VALID [2022-04-15 09:00:01,732 INFO L290 TraceCheckUtils]: 42: Hoare triple {3960#(<= |main_#t~post8| 3)} assume !(#t~post8 < 5);havoc #t~post8; {3829#false} is VALID [2022-04-15 09:00:01,732 INFO L290 TraceCheckUtils]: 43: Hoare triple {3829#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3829#false} is VALID [2022-04-15 09:00:01,732 INFO L290 TraceCheckUtils]: 44: Hoare triple {3829#false} assume !(#t~post6 < 5);havoc #t~post6; {3829#false} is VALID [2022-04-15 09:00:01,732 INFO L272 TraceCheckUtils]: 45: Hoare triple {3829#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)); {3829#false} is VALID [2022-04-15 09:00:01,732 INFO L290 TraceCheckUtils]: 46: Hoare triple {3829#false} ~cond := #in~cond; {3829#false} is VALID [2022-04-15 09:00:01,732 INFO L290 TraceCheckUtils]: 47: Hoare triple {3829#false} assume 0 == ~cond; {3829#false} is VALID [2022-04-15 09:00:01,742 INFO L290 TraceCheckUtils]: 48: Hoare triple {3829#false} assume !false; {3829#false} is VALID [2022-04-15 09:00:01,742 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:01,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:00:02,055 INFO L290 TraceCheckUtils]: 48: Hoare triple {3829#false} assume !false; {3829#false} is VALID [2022-04-15 09:00:02,055 INFO L290 TraceCheckUtils]: 47: Hoare triple {3829#false} assume 0 == ~cond; {3829#false} is VALID [2022-04-15 09:00:02,055 INFO L290 TraceCheckUtils]: 46: Hoare triple {3829#false} ~cond := #in~cond; {3829#false} is VALID [2022-04-15 09:00:02,056 INFO L272 TraceCheckUtils]: 45: Hoare triple {3829#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)); {3829#false} is VALID [2022-04-15 09:00:02,056 INFO L290 TraceCheckUtils]: 44: Hoare triple {3829#false} assume !(#t~post6 < 5);havoc #t~post6; {3829#false} is VALID [2022-04-15 09:00:02,056 INFO L290 TraceCheckUtils]: 43: Hoare triple {3829#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3829#false} is VALID [2022-04-15 09:00:02,056 INFO L290 TraceCheckUtils]: 42: Hoare triple {4000#(< |main_#t~post8| 5)} assume !(#t~post8 < 5);havoc #t~post8; {3829#false} is VALID [2022-04-15 09:00:02,057 INFO L290 TraceCheckUtils]: 41: Hoare triple {4004#(< ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4000#(< |main_#t~post8| 5)} is VALID [2022-04-15 09:00:02,057 INFO L290 TraceCheckUtils]: 40: Hoare triple {4004#(< ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {4004#(< ~counter~0 5)} is VALID [2022-04-15 09:00:02,058 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3828#true} {4004#(< ~counter~0 5)} #98#return; {4004#(< ~counter~0 5)} is VALID [2022-04-15 09:00:02,058 INFO L290 TraceCheckUtils]: 38: Hoare triple {3828#true} assume true; {3828#true} is VALID [2022-04-15 09:00:02,058 INFO L290 TraceCheckUtils]: 37: Hoare triple {3828#true} assume !(0 == ~cond); {3828#true} is VALID [2022-04-15 09:00:02,058 INFO L290 TraceCheckUtils]: 36: Hoare triple {3828#true} ~cond := #in~cond; {3828#true} is VALID [2022-04-15 09:00:02,058 INFO L272 TraceCheckUtils]: 35: Hoare triple {4004#(< ~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)); {3828#true} is VALID [2022-04-15 09:00:02,058 INFO L290 TraceCheckUtils]: 34: Hoare triple {4004#(< ~counter~0 5)} assume !!(#t~post8 < 5);havoc #t~post8; {4004#(< ~counter~0 5)} is VALID [2022-04-15 09:00:02,059 INFO L290 TraceCheckUtils]: 33: Hoare triple {3935#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4004#(< ~counter~0 5)} is VALID [2022-04-15 09:00:02,059 INFO L290 TraceCheckUtils]: 32: Hoare triple {3935#(<= ~counter~0 3)} assume !(~r~0 > 0); {3935#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:02,060 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3828#true} {3935#(<= ~counter~0 3)} #96#return; {3935#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:02,060 INFO L290 TraceCheckUtils]: 30: Hoare triple {3828#true} assume true; {3828#true} is VALID [2022-04-15 09:00:02,060 INFO L290 TraceCheckUtils]: 29: Hoare triple {3828#true} assume !(0 == ~cond); {3828#true} is VALID [2022-04-15 09:00:02,060 INFO L290 TraceCheckUtils]: 28: Hoare triple {3828#true} ~cond := #in~cond; {3828#true} is VALID [2022-04-15 09:00:02,060 INFO L272 TraceCheckUtils]: 27: Hoare triple {3935#(<= ~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)); {3828#true} is VALID [2022-04-15 09:00:02,061 INFO L290 TraceCheckUtils]: 26: Hoare triple {3935#(<= ~counter~0 3)} assume !!(#t~post7 < 5);havoc #t~post7; {3935#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:02,061 INFO L290 TraceCheckUtils]: 25: Hoare triple {3910#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3935#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:02,062 INFO L290 TraceCheckUtils]: 24: Hoare triple {3910#(<= ~counter~0 2)} assume !!(0 != ~r~0); {3910#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:02,062 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3828#true} {3910#(<= ~counter~0 2)} #94#return; {3910#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:02,063 INFO L290 TraceCheckUtils]: 22: Hoare triple {3828#true} assume true; {3828#true} is VALID [2022-04-15 09:00:02,063 INFO L290 TraceCheckUtils]: 21: Hoare triple {3828#true} assume !(0 == ~cond); {3828#true} is VALID [2022-04-15 09:00:02,063 INFO L290 TraceCheckUtils]: 20: Hoare triple {3828#true} ~cond := #in~cond; {3828#true} is VALID [2022-04-15 09:00:02,063 INFO L272 TraceCheckUtils]: 19: Hoare triple {3910#(<= ~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)); {3828#true} is VALID [2022-04-15 09:00:02,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {3910#(<= ~counter~0 2)} assume !!(#t~post6 < 5);havoc #t~post6; {3910#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:02,064 INFO L290 TraceCheckUtils]: 17: Hoare triple {3885#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3910#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:02,064 INFO L290 TraceCheckUtils]: 16: Hoare triple {3885#(<= ~counter~0 1)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {3885#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:02,065 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3828#true} {3885#(<= ~counter~0 1)} #92#return; {3885#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:02,065 INFO L290 TraceCheckUtils]: 14: Hoare triple {3828#true} assume true; {3828#true} is VALID [2022-04-15 09:00:02,065 INFO L290 TraceCheckUtils]: 13: Hoare triple {3828#true} assume !(0 == ~cond); {3828#true} is VALID [2022-04-15 09:00:02,065 INFO L290 TraceCheckUtils]: 12: Hoare triple {3828#true} ~cond := #in~cond; {3828#true} is VALID [2022-04-15 09:00:02,065 INFO L272 TraceCheckUtils]: 11: Hoare triple {3885#(<= ~counter~0 1)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {3828#true} is VALID [2022-04-15 09:00:02,066 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3828#true} {3885#(<= ~counter~0 1)} #90#return; {3885#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:02,066 INFO L290 TraceCheckUtils]: 9: Hoare triple {3828#true} assume true; {3828#true} is VALID [2022-04-15 09:00:02,066 INFO L290 TraceCheckUtils]: 8: Hoare triple {3828#true} assume !(0 == ~cond); {3828#true} is VALID [2022-04-15 09:00:02,066 INFO L290 TraceCheckUtils]: 7: Hoare triple {3828#true} ~cond := #in~cond; {3828#true} is VALID [2022-04-15 09:00:02,068 INFO L272 TraceCheckUtils]: 6: Hoare triple {3885#(<= ~counter~0 1)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {3828#true} is VALID [2022-04-15 09:00:02,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {3885#(<= ~counter~0 1)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {3885#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:02,069 INFO L272 TraceCheckUtils]: 4: Hoare triple {3885#(<= ~counter~0 1)} call #t~ret9 := main(); {3885#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:02,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3885#(<= ~counter~0 1)} {3828#true} #102#return; {3885#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:02,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {3885#(<= ~counter~0 1)} assume true; {3885#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:02,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {3828#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; {3885#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:02,071 INFO L272 TraceCheckUtils]: 0: Hoare triple {3828#true} call ULTIMATE.init(); {3828#true} is VALID [2022-04-15 09:00:02,071 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:02,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:00:02,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986783098] [2022-04-15 09:00:02,071 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:00:02,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636847974] [2022-04-15 09:00:02,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636847974] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:00:02,071 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:00:02,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-15 09:00:02,074 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:00:02,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [664504788] [2022-04-15 09:00:02,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [664504788] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:00:02,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:00:02,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 09:00:02,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151726030] [2022-04-15 09:00:02,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:00:02,076 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:02,076 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:00:02,076 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:02,119 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:02,119 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 09:00:02,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:00:02,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 09:00:02,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-15 09:00:02,120 INFO L87 Difference]: Start difference. First operand 70 states and 87 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 09:00:02,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:00:02,399 INFO L93 Difference]: Finished difference Result 118 states and 153 transitions. [2022-04-15 09:00:02,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 09:00:02,399 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:02,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:00:02,401 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:02,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-15 09:00:02,411 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:02,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-15 09:00:02,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 101 transitions. [2022-04-15 09:00:02,486 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:02,488 INFO L225 Difference]: With dead ends: 118 [2022-04-15 09:00:02,488 INFO L226 Difference]: Without dead ends: 81 [2022-04-15 09:00:02,489 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-15 09:00:02,489 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 31 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 09:00:02,490 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 123 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 09:00:02,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-15 09:00:02,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2022-04-15 09:00:02,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:00:02,563 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 09:00:02,564 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 09:00:02,564 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 09:00:02,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:00:02,566 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-15 09:00:02,566 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-15 09:00:02,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:00:02,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:00:02,567 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 81 states. [2022-04-15 09:00:02,567 INFO L87 Difference]: Start difference. First operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 81 states. [2022-04-15 09:00:02,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:00:02,569 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-15 09:00:02,569 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-15 09:00:02,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:00:02,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:00:02,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:00:02,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:00:02,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 09:00:02,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 99 transitions. [2022-04-15 09:00:02,572 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 99 transitions. Word has length 49 [2022-04-15 09:00:02,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:00:02,572 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 99 transitions. [2022-04-15 09:00:02,573 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:02,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 99 transitions. [2022-04-15 09:00:04,439 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:00:04,439 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2022-04-15 09:00:04,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 09:00:04,440 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:00:04,440 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:04,463 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:04,640 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:04,641 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:00:04,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:00:04,641 INFO L85 PathProgramCache]: Analyzing trace with hash -60460648, now seen corresponding path program 3 times [2022-04-15 09:00:04,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:00:04,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [565494657] [2022-04-15 09:00:04,642 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:00:04,642 INFO L85 PathProgramCache]: Analyzing trace with hash -60460648, now seen corresponding path program 4 times [2022-04-15 09:00:04,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:00:04,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069306244] [2022-04-15 09:00:04,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:00:04,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:00:04,658 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:00:04,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2121568276] [2022-04-15 09:00:04,659 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 09:00:04,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:00:04,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:00:04,661 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:04,664 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:04,734 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 09:00:04,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:00:04,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 09:00:04,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:00:04,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:00:04,988 INFO L272 TraceCheckUtils]: 0: Hoare triple {4690#true} call ULTIMATE.init(); {4690#true} is VALID [2022-04-15 09:00:04,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {4690#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; {4698#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:04,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {4698#(<= ~counter~0 0)} assume true; {4698#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:04,990 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4698#(<= ~counter~0 0)} {4690#true} #102#return; {4698#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:04,990 INFO L272 TraceCheckUtils]: 4: Hoare triple {4698#(<= ~counter~0 0)} call #t~ret9 := main(); {4698#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:04,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {4698#(<= ~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; {4698#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:04,991 INFO L272 TraceCheckUtils]: 6: Hoare triple {4698#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {4698#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:04,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {4698#(<= ~counter~0 0)} ~cond := #in~cond; {4698#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:04,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {4698#(<= ~counter~0 0)} assume !(0 == ~cond); {4698#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:04,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {4698#(<= ~counter~0 0)} assume true; {4698#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:04,993 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4698#(<= ~counter~0 0)} {4698#(<= ~counter~0 0)} #90#return; {4698#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:04,993 INFO L272 TraceCheckUtils]: 11: Hoare triple {4698#(<= ~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)); {4698#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:04,994 INFO L290 TraceCheckUtils]: 12: Hoare triple {4698#(<= ~counter~0 0)} ~cond := #in~cond; {4698#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:04,994 INFO L290 TraceCheckUtils]: 13: Hoare triple {4698#(<= ~counter~0 0)} assume !(0 == ~cond); {4698#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:04,994 INFO L290 TraceCheckUtils]: 14: Hoare triple {4698#(<= ~counter~0 0)} assume true; {4698#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:04,995 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4698#(<= ~counter~0 0)} {4698#(<= ~counter~0 0)} #92#return; {4698#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:04,995 INFO L290 TraceCheckUtils]: 16: Hoare triple {4698#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4698#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:04,996 INFO L290 TraceCheckUtils]: 17: Hoare triple {4698#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4747#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:04,996 INFO L290 TraceCheckUtils]: 18: Hoare triple {4747#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {4747#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:04,997 INFO L272 TraceCheckUtils]: 19: Hoare triple {4747#(<= ~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)); {4747#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:04,997 INFO L290 TraceCheckUtils]: 20: Hoare triple {4747#(<= ~counter~0 1)} ~cond := #in~cond; {4747#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:04,998 INFO L290 TraceCheckUtils]: 21: Hoare triple {4747#(<= ~counter~0 1)} assume !(0 == ~cond); {4747#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:04,998 INFO L290 TraceCheckUtils]: 22: Hoare triple {4747#(<= ~counter~0 1)} assume true; {4747#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:04,999 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4747#(<= ~counter~0 1)} {4747#(<= ~counter~0 1)} #94#return; {4747#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:04,999 INFO L290 TraceCheckUtils]: 24: Hoare triple {4747#(<= ~counter~0 1)} assume !!(0 != ~r~0); {4747#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:05,000 INFO L290 TraceCheckUtils]: 25: Hoare triple {4747#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4772#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:05,000 INFO L290 TraceCheckUtils]: 26: Hoare triple {4772#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {4772#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:05,001 INFO L272 TraceCheckUtils]: 27: Hoare triple {4772#(<= ~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)); {4772#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:05,002 INFO L290 TraceCheckUtils]: 28: Hoare triple {4772#(<= ~counter~0 2)} ~cond := #in~cond; {4772#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:05,002 INFO L290 TraceCheckUtils]: 29: Hoare triple {4772#(<= ~counter~0 2)} assume !(0 == ~cond); {4772#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:05,002 INFO L290 TraceCheckUtils]: 30: Hoare triple {4772#(<= ~counter~0 2)} assume true; {4772#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:05,003 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4772#(<= ~counter~0 2)} {4772#(<= ~counter~0 2)} #96#return; {4772#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:05,004 INFO L290 TraceCheckUtils]: 32: Hoare triple {4772#(<= ~counter~0 2)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4772#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:05,004 INFO L290 TraceCheckUtils]: 33: Hoare triple {4772#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4797#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:05,005 INFO L290 TraceCheckUtils]: 34: Hoare triple {4797#(<= ~counter~0 3)} assume !!(#t~post7 < 5);havoc #t~post7; {4797#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:05,005 INFO L272 TraceCheckUtils]: 35: Hoare triple {4797#(<= ~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)); {4797#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:05,006 INFO L290 TraceCheckUtils]: 36: Hoare triple {4797#(<= ~counter~0 3)} ~cond := #in~cond; {4797#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:05,006 INFO L290 TraceCheckUtils]: 37: Hoare triple {4797#(<= ~counter~0 3)} assume !(0 == ~cond); {4797#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:05,006 INFO L290 TraceCheckUtils]: 38: Hoare triple {4797#(<= ~counter~0 3)} assume true; {4797#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:05,007 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4797#(<= ~counter~0 3)} {4797#(<= ~counter~0 3)} #96#return; {4797#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:05,008 INFO L290 TraceCheckUtils]: 40: Hoare triple {4797#(<= ~counter~0 3)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4797#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:05,008 INFO L290 TraceCheckUtils]: 41: Hoare triple {4797#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4822#(<= |main_#t~post7| 3)} is VALID [2022-04-15 09:00:05,009 INFO L290 TraceCheckUtils]: 42: Hoare triple {4822#(<= |main_#t~post7| 3)} assume !(#t~post7 < 5);havoc #t~post7; {4691#false} is VALID [2022-04-15 09:00:05,009 INFO L290 TraceCheckUtils]: 43: Hoare triple {4691#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4691#false} is VALID [2022-04-15 09:00:05,009 INFO L290 TraceCheckUtils]: 44: Hoare triple {4691#false} assume !(#t~post8 < 5);havoc #t~post8; {4691#false} is VALID [2022-04-15 09:00:05,009 INFO L290 TraceCheckUtils]: 45: Hoare triple {4691#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4691#false} is VALID [2022-04-15 09:00:05,009 INFO L290 TraceCheckUtils]: 46: Hoare triple {4691#false} assume !(#t~post6 < 5);havoc #t~post6; {4691#false} is VALID [2022-04-15 09:00:05,009 INFO L272 TraceCheckUtils]: 47: Hoare triple {4691#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)); {4691#false} is VALID [2022-04-15 09:00:05,009 INFO L290 TraceCheckUtils]: 48: Hoare triple {4691#false} ~cond := #in~cond; {4691#false} is VALID [2022-04-15 09:00:05,009 INFO L290 TraceCheckUtils]: 49: Hoare triple {4691#false} assume 0 == ~cond; {4691#false} is VALID [2022-04-15 09:00:05,009 INFO L290 TraceCheckUtils]: 50: Hoare triple {4691#false} assume !false; {4691#false} is VALID [2022-04-15 09:00:05,010 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:05,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:00:05,314 INFO L290 TraceCheckUtils]: 50: Hoare triple {4691#false} assume !false; {4691#false} is VALID [2022-04-15 09:00:05,314 INFO L290 TraceCheckUtils]: 49: Hoare triple {4691#false} assume 0 == ~cond; {4691#false} is VALID [2022-04-15 09:00:05,314 INFO L290 TraceCheckUtils]: 48: Hoare triple {4691#false} ~cond := #in~cond; {4691#false} is VALID [2022-04-15 09:00:05,314 INFO L272 TraceCheckUtils]: 47: Hoare triple {4691#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)); {4691#false} is VALID [2022-04-15 09:00:05,314 INFO L290 TraceCheckUtils]: 46: Hoare triple {4691#false} assume !(#t~post6 < 5);havoc #t~post6; {4691#false} is VALID [2022-04-15 09:00:05,314 INFO L290 TraceCheckUtils]: 45: Hoare triple {4691#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4691#false} is VALID [2022-04-15 09:00:05,314 INFO L290 TraceCheckUtils]: 44: Hoare triple {4691#false} assume !(#t~post8 < 5);havoc #t~post8; {4691#false} is VALID [2022-04-15 09:00:05,315 INFO L290 TraceCheckUtils]: 43: Hoare triple {4691#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4691#false} is VALID [2022-04-15 09:00:05,315 INFO L290 TraceCheckUtils]: 42: Hoare triple {4874#(< |main_#t~post7| 5)} assume !(#t~post7 < 5);havoc #t~post7; {4691#false} is VALID [2022-04-15 09:00:05,315 INFO L290 TraceCheckUtils]: 41: Hoare triple {4878#(< ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4874#(< |main_#t~post7| 5)} is VALID [2022-04-15 09:00:05,316 INFO L290 TraceCheckUtils]: 40: Hoare triple {4878#(< ~counter~0 5)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4878#(< ~counter~0 5)} is VALID [2022-04-15 09:00:05,317 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4690#true} {4878#(< ~counter~0 5)} #96#return; {4878#(< ~counter~0 5)} is VALID [2022-04-15 09:00:05,317 INFO L290 TraceCheckUtils]: 38: Hoare triple {4690#true} assume true; {4690#true} is VALID [2022-04-15 09:00:05,317 INFO L290 TraceCheckUtils]: 37: Hoare triple {4690#true} assume !(0 == ~cond); {4690#true} is VALID [2022-04-15 09:00:05,317 INFO L290 TraceCheckUtils]: 36: Hoare triple {4690#true} ~cond := #in~cond; {4690#true} is VALID [2022-04-15 09:00:05,317 INFO L272 TraceCheckUtils]: 35: Hoare triple {4878#(< ~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)); {4690#true} is VALID [2022-04-15 09:00:05,317 INFO L290 TraceCheckUtils]: 34: Hoare triple {4878#(< ~counter~0 5)} assume !!(#t~post7 < 5);havoc #t~post7; {4878#(< ~counter~0 5)} is VALID [2022-04-15 09:00:05,318 INFO L290 TraceCheckUtils]: 33: Hoare triple {4797#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4878#(< ~counter~0 5)} is VALID [2022-04-15 09:00:05,318 INFO L290 TraceCheckUtils]: 32: Hoare triple {4797#(<= ~counter~0 3)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4797#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:05,319 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4690#true} {4797#(<= ~counter~0 3)} #96#return; {4797#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:05,319 INFO L290 TraceCheckUtils]: 30: Hoare triple {4690#true} assume true; {4690#true} is VALID [2022-04-15 09:00:05,319 INFO L290 TraceCheckUtils]: 29: Hoare triple {4690#true} assume !(0 == ~cond); {4690#true} is VALID [2022-04-15 09:00:05,319 INFO L290 TraceCheckUtils]: 28: Hoare triple {4690#true} ~cond := #in~cond; {4690#true} is VALID [2022-04-15 09:00:05,319 INFO L272 TraceCheckUtils]: 27: Hoare triple {4797#(<= ~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)); {4690#true} is VALID [2022-04-15 09:00:05,320 INFO L290 TraceCheckUtils]: 26: Hoare triple {4797#(<= ~counter~0 3)} assume !!(#t~post7 < 5);havoc #t~post7; {4797#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:05,320 INFO L290 TraceCheckUtils]: 25: Hoare triple {4772#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4797#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:05,321 INFO L290 TraceCheckUtils]: 24: Hoare triple {4772#(<= ~counter~0 2)} assume !!(0 != ~r~0); {4772#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:05,321 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4690#true} {4772#(<= ~counter~0 2)} #94#return; {4772#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:05,321 INFO L290 TraceCheckUtils]: 22: Hoare triple {4690#true} assume true; {4690#true} is VALID [2022-04-15 09:00:05,322 INFO L290 TraceCheckUtils]: 21: Hoare triple {4690#true} assume !(0 == ~cond); {4690#true} is VALID [2022-04-15 09:00:05,322 INFO L290 TraceCheckUtils]: 20: Hoare triple {4690#true} ~cond := #in~cond; {4690#true} is VALID [2022-04-15 09:00:05,322 INFO L272 TraceCheckUtils]: 19: Hoare triple {4772#(<= ~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)); {4690#true} is VALID [2022-04-15 09:00:05,322 INFO L290 TraceCheckUtils]: 18: Hoare triple {4772#(<= ~counter~0 2)} assume !!(#t~post6 < 5);havoc #t~post6; {4772#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:05,323 INFO L290 TraceCheckUtils]: 17: Hoare triple {4747#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4772#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:05,323 INFO L290 TraceCheckUtils]: 16: Hoare triple {4747#(<= ~counter~0 1)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4747#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:05,324 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4690#true} {4747#(<= ~counter~0 1)} #92#return; {4747#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:05,324 INFO L290 TraceCheckUtils]: 14: Hoare triple {4690#true} assume true; {4690#true} is VALID [2022-04-15 09:00:05,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {4690#true} assume !(0 == ~cond); {4690#true} is VALID [2022-04-15 09:00:05,324 INFO L290 TraceCheckUtils]: 12: Hoare triple {4690#true} ~cond := #in~cond; {4690#true} is VALID [2022-04-15 09:00:05,324 INFO L272 TraceCheckUtils]: 11: Hoare triple {4747#(<= ~counter~0 1)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {4690#true} is VALID [2022-04-15 09:00:05,325 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4690#true} {4747#(<= ~counter~0 1)} #90#return; {4747#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:05,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {4690#true} assume true; {4690#true} is VALID [2022-04-15 09:00:05,325 INFO L290 TraceCheckUtils]: 8: Hoare triple {4690#true} assume !(0 == ~cond); {4690#true} is VALID [2022-04-15 09:00:05,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {4690#true} ~cond := #in~cond; {4690#true} is VALID [2022-04-15 09:00:05,325 INFO L272 TraceCheckUtils]: 6: Hoare triple {4747#(<= ~counter~0 1)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {4690#true} is VALID [2022-04-15 09:00:05,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {4747#(<= ~counter~0 1)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {4747#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:05,326 INFO L272 TraceCheckUtils]: 4: Hoare triple {4747#(<= ~counter~0 1)} call #t~ret9 := main(); {4747#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:05,326 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4747#(<= ~counter~0 1)} {4690#true} #102#return; {4747#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:05,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {4747#(<= ~counter~0 1)} assume true; {4747#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:05,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {4690#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; {4747#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:05,327 INFO L272 TraceCheckUtils]: 0: Hoare triple {4690#true} call ULTIMATE.init(); {4690#true} is VALID [2022-04-15 09:00:05,327 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:05,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:00:05,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069306244] [2022-04-15 09:00:05,328 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:00:05,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121568276] [2022-04-15 09:00:05,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121568276] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:00:05,328 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:00:05,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-15 09:00:05,328 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:00:05,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [565494657] [2022-04-15 09:00:05,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [565494657] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:00:05,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:00:05,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 09:00:05,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531497479] [2022-04-15 09:00:05,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:00:05,329 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:05,330 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:00:05,330 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:05,370 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:05,370 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 09:00:05,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:00:05,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 09:00:05,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-15 09:00:05,371 INFO L87 Difference]: Start difference. First operand 80 states and 99 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 09:00:05,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:00:05,621 INFO L93 Difference]: Finished difference Result 119 states and 154 transitions. [2022-04-15 09:00:05,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 09:00:05,621 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:05,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:00:05,622 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:05,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2022-04-15 09:00:05,623 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:05,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2022-04-15 09:00:05,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 101 transitions. [2022-04-15 09:00:05,704 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:05,705 INFO L225 Difference]: With dead ends: 119 [2022-04-15 09:00:05,705 INFO L226 Difference]: Without dead ends: 82 [2022-04-15 09:00:05,706 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-15 09:00:05,706 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 14 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 09:00:05,707 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 149 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 09:00:05,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-15 09:00:05,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-04-15 09:00:05,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:00:05,804 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 09:00:05,805 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 09:00:05,805 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 09:00:05,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:00:05,807 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2022-04-15 09:00:05,807 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-15 09:00:05,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:00:05,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:00:05,808 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 82 states. [2022-04-15 09:00:05,808 INFO L87 Difference]: Start difference. First operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 82 states. [2022-04-15 09:00:05,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:00:05,810 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2022-04-15 09:00:05,810 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-15 09:00:05,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:00:05,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:00:05,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:00:05,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:00:05,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 09:00:05,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2022-04-15 09:00:05,812 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 51 [2022-04-15 09:00:05,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:00:05,812 INFO L478 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2022-04-15 09:00:05,813 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:05,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 101 transitions. [2022-04-15 09:00:07,085 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:07,086 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-15 09:00:07,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-15 09:00:07,086 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:00:07,086 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:07,092 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:07,286 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:07,287 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:00:07,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:00:07,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1067781299, now seen corresponding path program 1 times [2022-04-15 09:00:07,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:00:07,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [455042941] [2022-04-15 09:00:07,288 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:00:07,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1067781299, now seen corresponding path program 2 times [2022-04-15 09:00:07,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:00:07,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505864840] [2022-04-15 09:00:07,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:00:07,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:00:07,305 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:00:07,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1432690065] [2022-04-15 09:00:07,306 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:00:07,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:00:07,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:00:07,307 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:07,307 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:07,356 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:00:07,357 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:00:07,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 09:00:07,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:00:07,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:00:07,654 INFO L272 TraceCheckUtils]: 0: Hoare triple {5574#true} call ULTIMATE.init(); {5574#true} is VALID [2022-04-15 09:00:07,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {5574#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; {5582#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:07,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {5582#(<= ~counter~0 0)} assume true; {5582#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:07,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5582#(<= ~counter~0 0)} {5574#true} #102#return; {5582#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:07,656 INFO L272 TraceCheckUtils]: 4: Hoare triple {5582#(<= ~counter~0 0)} call #t~ret9 := main(); {5582#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:07,656 INFO L290 TraceCheckUtils]: 5: Hoare triple {5582#(<= ~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; {5582#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:07,657 INFO L272 TraceCheckUtils]: 6: Hoare triple {5582#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {5582#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:07,657 INFO L290 TraceCheckUtils]: 7: Hoare triple {5582#(<= ~counter~0 0)} ~cond := #in~cond; {5582#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:07,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {5582#(<= ~counter~0 0)} assume !(0 == ~cond); {5582#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:07,658 INFO L290 TraceCheckUtils]: 9: Hoare triple {5582#(<= ~counter~0 0)} assume true; {5582#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:07,659 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5582#(<= ~counter~0 0)} {5582#(<= ~counter~0 0)} #90#return; {5582#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:07,659 INFO L272 TraceCheckUtils]: 11: Hoare triple {5582#(<= ~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)); {5582#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:07,659 INFO L290 TraceCheckUtils]: 12: Hoare triple {5582#(<= ~counter~0 0)} ~cond := #in~cond; {5582#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:07,660 INFO L290 TraceCheckUtils]: 13: Hoare triple {5582#(<= ~counter~0 0)} assume !(0 == ~cond); {5582#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:07,660 INFO L290 TraceCheckUtils]: 14: Hoare triple {5582#(<= ~counter~0 0)} assume true; {5582#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:07,661 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5582#(<= ~counter~0 0)} {5582#(<= ~counter~0 0)} #92#return; {5582#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:07,661 INFO L290 TraceCheckUtils]: 16: Hoare triple {5582#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {5582#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:07,662 INFO L290 TraceCheckUtils]: 17: Hoare triple {5582#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5631#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:07,662 INFO L290 TraceCheckUtils]: 18: Hoare triple {5631#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {5631#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:07,663 INFO L272 TraceCheckUtils]: 19: Hoare triple {5631#(<= ~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)); {5631#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:07,663 INFO L290 TraceCheckUtils]: 20: Hoare triple {5631#(<= ~counter~0 1)} ~cond := #in~cond; {5631#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:07,663 INFO L290 TraceCheckUtils]: 21: Hoare triple {5631#(<= ~counter~0 1)} assume !(0 == ~cond); {5631#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:07,664 INFO L290 TraceCheckUtils]: 22: Hoare triple {5631#(<= ~counter~0 1)} assume true; {5631#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:07,664 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5631#(<= ~counter~0 1)} {5631#(<= ~counter~0 1)} #94#return; {5631#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:07,665 INFO L290 TraceCheckUtils]: 24: Hoare triple {5631#(<= ~counter~0 1)} assume !!(0 != ~r~0); {5631#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:07,665 INFO L290 TraceCheckUtils]: 25: Hoare triple {5631#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5656#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:07,665 INFO L290 TraceCheckUtils]: 26: Hoare triple {5656#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {5656#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:07,666 INFO L272 TraceCheckUtils]: 27: Hoare triple {5656#(<= ~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)); {5656#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:07,666 INFO L290 TraceCheckUtils]: 28: Hoare triple {5656#(<= ~counter~0 2)} ~cond := #in~cond; {5656#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:07,667 INFO L290 TraceCheckUtils]: 29: Hoare triple {5656#(<= ~counter~0 2)} assume !(0 == ~cond); {5656#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:07,667 INFO L290 TraceCheckUtils]: 30: Hoare triple {5656#(<= ~counter~0 2)} assume true; {5656#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:07,668 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5656#(<= ~counter~0 2)} {5656#(<= ~counter~0 2)} #96#return; {5656#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:07,668 INFO L290 TraceCheckUtils]: 32: Hoare triple {5656#(<= ~counter~0 2)} assume !(~r~0 > 0); {5656#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:07,668 INFO L290 TraceCheckUtils]: 33: Hoare triple {5656#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5681#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:07,669 INFO L290 TraceCheckUtils]: 34: Hoare triple {5681#(<= ~counter~0 3)} assume !!(#t~post8 < 5);havoc #t~post8; {5681#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:07,669 INFO L272 TraceCheckUtils]: 35: Hoare triple {5681#(<= ~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)); {5681#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:07,670 INFO L290 TraceCheckUtils]: 36: Hoare triple {5681#(<= ~counter~0 3)} ~cond := #in~cond; {5681#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:07,670 INFO L290 TraceCheckUtils]: 37: Hoare triple {5681#(<= ~counter~0 3)} assume !(0 == ~cond); {5681#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:07,670 INFO L290 TraceCheckUtils]: 38: Hoare triple {5681#(<= ~counter~0 3)} assume true; {5681#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:07,671 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5681#(<= ~counter~0 3)} {5681#(<= ~counter~0 3)} #98#return; {5681#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:07,671 INFO L290 TraceCheckUtils]: 40: Hoare triple {5681#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {5681#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:07,672 INFO L290 TraceCheckUtils]: 41: Hoare triple {5681#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5706#(<= ~counter~0 4)} is VALID [2022-04-15 09:00:07,672 INFO L290 TraceCheckUtils]: 42: Hoare triple {5706#(<= ~counter~0 4)} assume !!(#t~post8 < 5);havoc #t~post8; {5706#(<= ~counter~0 4)} is VALID [2022-04-15 09:00:07,673 INFO L272 TraceCheckUtils]: 43: Hoare triple {5706#(<= ~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)); {5706#(<= ~counter~0 4)} is VALID [2022-04-15 09:00:07,673 INFO L290 TraceCheckUtils]: 44: Hoare triple {5706#(<= ~counter~0 4)} ~cond := #in~cond; {5706#(<= ~counter~0 4)} is VALID [2022-04-15 09:00:07,674 INFO L290 TraceCheckUtils]: 45: Hoare triple {5706#(<= ~counter~0 4)} assume !(0 == ~cond); {5706#(<= ~counter~0 4)} is VALID [2022-04-15 09:00:07,674 INFO L290 TraceCheckUtils]: 46: Hoare triple {5706#(<= ~counter~0 4)} assume true; {5706#(<= ~counter~0 4)} is VALID [2022-04-15 09:00:07,675 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {5706#(<= ~counter~0 4)} {5706#(<= ~counter~0 4)} #98#return; {5706#(<= ~counter~0 4)} is VALID [2022-04-15 09:00:07,675 INFO L290 TraceCheckUtils]: 48: Hoare triple {5706#(<= ~counter~0 4)} assume !(~r~0 < 0); {5706#(<= ~counter~0 4)} is VALID [2022-04-15 09:00:07,675 INFO L290 TraceCheckUtils]: 49: Hoare triple {5706#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5731#(<= |main_#t~post6| 4)} is VALID [2022-04-15 09:00:07,676 INFO L290 TraceCheckUtils]: 50: Hoare triple {5731#(<= |main_#t~post6| 4)} assume !(#t~post6 < 5);havoc #t~post6; {5575#false} is VALID [2022-04-15 09:00:07,676 INFO L272 TraceCheckUtils]: 51: Hoare triple {5575#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)); {5575#false} is VALID [2022-04-15 09:00:07,676 INFO L290 TraceCheckUtils]: 52: Hoare triple {5575#false} ~cond := #in~cond; {5575#false} is VALID [2022-04-15 09:00:07,676 INFO L290 TraceCheckUtils]: 53: Hoare triple {5575#false} assume 0 == ~cond; {5575#false} is VALID [2022-04-15 09:00:07,676 INFO L290 TraceCheckUtils]: 54: Hoare triple {5575#false} assume !false; {5575#false} is VALID [2022-04-15 09:00:07,676 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:07,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:00:07,956 INFO L290 TraceCheckUtils]: 54: Hoare triple {5575#false} assume !false; {5575#false} is VALID [2022-04-15 09:00:07,956 INFO L290 TraceCheckUtils]: 53: Hoare triple {5575#false} assume 0 == ~cond; {5575#false} is VALID [2022-04-15 09:00:07,956 INFO L290 TraceCheckUtils]: 52: Hoare triple {5575#false} ~cond := #in~cond; {5575#false} is VALID [2022-04-15 09:00:07,956 INFO L272 TraceCheckUtils]: 51: Hoare triple {5575#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)); {5575#false} is VALID [2022-04-15 09:00:07,957 INFO L290 TraceCheckUtils]: 50: Hoare triple {5731#(<= |main_#t~post6| 4)} assume !(#t~post6 < 5);havoc #t~post6; {5575#false} is VALID [2022-04-15 09:00:07,957 INFO L290 TraceCheckUtils]: 49: Hoare triple {5706#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5731#(<= |main_#t~post6| 4)} is VALID [2022-04-15 09:00:07,958 INFO L290 TraceCheckUtils]: 48: Hoare triple {5706#(<= ~counter~0 4)} assume !(~r~0 < 0); {5706#(<= ~counter~0 4)} is VALID [2022-04-15 09:00:07,958 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {5574#true} {5706#(<= ~counter~0 4)} #98#return; {5706#(<= ~counter~0 4)} is VALID [2022-04-15 09:00:07,958 INFO L290 TraceCheckUtils]: 46: Hoare triple {5574#true} assume true; {5574#true} is VALID [2022-04-15 09:00:07,959 INFO L290 TraceCheckUtils]: 45: Hoare triple {5574#true} assume !(0 == ~cond); {5574#true} is VALID [2022-04-15 09:00:07,959 INFO L290 TraceCheckUtils]: 44: Hoare triple {5574#true} ~cond := #in~cond; {5574#true} is VALID [2022-04-15 09:00:07,959 INFO L272 TraceCheckUtils]: 43: Hoare triple {5706#(<= ~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)); {5574#true} is VALID [2022-04-15 09:00:07,959 INFO L290 TraceCheckUtils]: 42: Hoare triple {5706#(<= ~counter~0 4)} assume !!(#t~post8 < 5);havoc #t~post8; {5706#(<= ~counter~0 4)} is VALID [2022-04-15 09:00:07,960 INFO L290 TraceCheckUtils]: 41: Hoare triple {5681#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5706#(<= ~counter~0 4)} is VALID [2022-04-15 09:00:07,960 INFO L290 TraceCheckUtils]: 40: Hoare triple {5681#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {5681#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:07,961 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5574#true} {5681#(<= ~counter~0 3)} #98#return; {5681#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:07,961 INFO L290 TraceCheckUtils]: 38: Hoare triple {5574#true} assume true; {5574#true} is VALID [2022-04-15 09:00:07,961 INFO L290 TraceCheckUtils]: 37: Hoare triple {5574#true} assume !(0 == ~cond); {5574#true} is VALID [2022-04-15 09:00:07,961 INFO L290 TraceCheckUtils]: 36: Hoare triple {5574#true} ~cond := #in~cond; {5574#true} is VALID [2022-04-15 09:00:07,961 INFO L272 TraceCheckUtils]: 35: Hoare triple {5681#(<= ~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)); {5574#true} is VALID [2022-04-15 09:00:07,962 INFO L290 TraceCheckUtils]: 34: Hoare triple {5681#(<= ~counter~0 3)} assume !!(#t~post8 < 5);havoc #t~post8; {5681#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:07,962 INFO L290 TraceCheckUtils]: 33: Hoare triple {5656#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5681#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:07,963 INFO L290 TraceCheckUtils]: 32: Hoare triple {5656#(<= ~counter~0 2)} assume !(~r~0 > 0); {5656#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:07,963 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5574#true} {5656#(<= ~counter~0 2)} #96#return; {5656#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:07,963 INFO L290 TraceCheckUtils]: 30: Hoare triple {5574#true} assume true; {5574#true} is VALID [2022-04-15 09:00:07,963 INFO L290 TraceCheckUtils]: 29: Hoare triple {5574#true} assume !(0 == ~cond); {5574#true} is VALID [2022-04-15 09:00:07,964 INFO L290 TraceCheckUtils]: 28: Hoare triple {5574#true} ~cond := #in~cond; {5574#true} is VALID [2022-04-15 09:00:07,964 INFO L272 TraceCheckUtils]: 27: Hoare triple {5656#(<= ~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)); {5574#true} is VALID [2022-04-15 09:00:07,964 INFO L290 TraceCheckUtils]: 26: Hoare triple {5656#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {5656#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:07,965 INFO L290 TraceCheckUtils]: 25: Hoare triple {5631#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5656#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:07,965 INFO L290 TraceCheckUtils]: 24: Hoare triple {5631#(<= ~counter~0 1)} assume !!(0 != ~r~0); {5631#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:07,966 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5574#true} {5631#(<= ~counter~0 1)} #94#return; {5631#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:07,966 INFO L290 TraceCheckUtils]: 22: Hoare triple {5574#true} assume true; {5574#true} is VALID [2022-04-15 09:00:07,966 INFO L290 TraceCheckUtils]: 21: Hoare triple {5574#true} assume !(0 == ~cond); {5574#true} is VALID [2022-04-15 09:00:07,966 INFO L290 TraceCheckUtils]: 20: Hoare triple {5574#true} ~cond := #in~cond; {5574#true} is VALID [2022-04-15 09:00:07,966 INFO L272 TraceCheckUtils]: 19: Hoare triple {5631#(<= ~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)); {5574#true} is VALID [2022-04-15 09:00:07,966 INFO L290 TraceCheckUtils]: 18: Hoare triple {5631#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {5631#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:07,967 INFO L290 TraceCheckUtils]: 17: Hoare triple {5582#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5631#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:07,967 INFO L290 TraceCheckUtils]: 16: Hoare triple {5582#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {5582#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:07,968 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5574#true} {5582#(<= ~counter~0 0)} #92#return; {5582#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:07,968 INFO L290 TraceCheckUtils]: 14: Hoare triple {5574#true} assume true; {5574#true} is VALID [2022-04-15 09:00:07,968 INFO L290 TraceCheckUtils]: 13: Hoare triple {5574#true} assume !(0 == ~cond); {5574#true} is VALID [2022-04-15 09:00:07,968 INFO L290 TraceCheckUtils]: 12: Hoare triple {5574#true} ~cond := #in~cond; {5574#true} is VALID [2022-04-15 09:00:07,968 INFO L272 TraceCheckUtils]: 11: Hoare triple {5582#(<= ~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)); {5574#true} is VALID [2022-04-15 09:00:07,969 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5574#true} {5582#(<= ~counter~0 0)} #90#return; {5582#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:07,969 INFO L290 TraceCheckUtils]: 9: Hoare triple {5574#true} assume true; {5574#true} is VALID [2022-04-15 09:00:07,969 INFO L290 TraceCheckUtils]: 8: Hoare triple {5574#true} assume !(0 == ~cond); {5574#true} is VALID [2022-04-15 09:00:07,969 INFO L290 TraceCheckUtils]: 7: Hoare triple {5574#true} ~cond := #in~cond; {5574#true} is VALID [2022-04-15 09:00:07,969 INFO L272 TraceCheckUtils]: 6: Hoare triple {5582#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {5574#true} is VALID [2022-04-15 09:00:07,969 INFO L290 TraceCheckUtils]: 5: Hoare triple {5582#(<= ~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; {5582#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:07,970 INFO L272 TraceCheckUtils]: 4: Hoare triple {5582#(<= ~counter~0 0)} call #t~ret9 := main(); {5582#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:07,970 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5582#(<= ~counter~0 0)} {5574#true} #102#return; {5582#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:07,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {5582#(<= ~counter~0 0)} assume true; {5582#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:07,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {5574#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; {5582#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:07,971 INFO L272 TraceCheckUtils]: 0: Hoare triple {5574#true} call ULTIMATE.init(); {5574#true} is VALID [2022-04-15 09:00:07,972 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:07,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:00:07,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505864840] [2022-04-15 09:00:07,972 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:00:07,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432690065] [2022-04-15 09:00:07,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432690065] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:00:07,972 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:00:07,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-15 09:00:07,973 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:00:07,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [455042941] [2022-04-15 09:00:07,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [455042941] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:00:07,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:00:07,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 09:00:07,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021942430] [2022-04-15 09:00:07,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:00:07,973 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:07,974 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:00:07,974 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:08,019 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:08,019 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 09:00:08,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:00:08,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 09:00:08,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-15 09:00:08,020 INFO L87 Difference]: Start difference. First operand 82 states and 101 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 09:00:08,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:00:08,346 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2022-04-15 09:00:08,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 09:00:08,346 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:08,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:00:08,346 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:08,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-15 09:00:08,348 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:08,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-15 09:00:08,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 95 transitions. [2022-04-15 09:00:08,427 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:08,429 INFO L225 Difference]: With dead ends: 99 [2022-04-15 09:00:08,429 INFO L226 Difference]: Without dead ends: 94 [2022-04-15 09:00:08,429 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-04-15 09:00:08,429 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 33 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 09:00:08,430 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 146 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 09:00:08,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-15 09:00:08,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2022-04-15 09:00:08,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:00:08,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 09:00:08,509 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 09:00:08,510 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 09:00:08,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:00:08,512 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2022-04-15 09:00:08,512 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-15 09:00:08,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:00:08,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:00:08,512 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 94 states. [2022-04-15 09:00:08,513 INFO L87 Difference]: Start difference. First operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 94 states. [2022-04-15 09:00:08,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:00:08,515 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2022-04-15 09:00:08,515 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-15 09:00:08,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:00:08,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:00:08,515 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:00:08,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:00:08,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 09:00:08,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 112 transitions. [2022-04-15 09:00:08,519 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 112 transitions. Word has length 55 [2022-04-15 09:00:08,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:00:08,519 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 112 transitions. [2022-04-15 09:00:08,519 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:08,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 112 transitions. [2022-04-15 09:00:10,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 111 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 09:00:10,650 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 112 transitions. [2022-04-15 09:00:10,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-15 09:00:10,651 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:00:10,651 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:00:10,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-15 09:00:10,851 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:00:10,851 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:00:10,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:00:10,852 INFO L85 PathProgramCache]: Analyzing trace with hash -2095290798, now seen corresponding path program 3 times [2022-04-15 09:00:10,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:00:10,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1070358558] [2022-04-15 09:00:10,853 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:00:10,853 INFO L85 PathProgramCache]: Analyzing trace with hash -2095290798, now seen corresponding path program 4 times [2022-04-15 09:00:10,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:00:10,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493730121] [2022-04-15 09:00:10,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:00:10,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:00:10,863 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:00:10,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1651574589] [2022-04-15 09:00:10,864 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 09:00:10,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:00:10,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:00:10,865 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:00:10,891 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:00:10,956 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 09:00:10,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:00:10,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 09:00:10,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:00:10,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:00:11,244 INFO L272 TraceCheckUtils]: 0: Hoare triple {6481#true} call ULTIMATE.init(); {6481#true} is VALID [2022-04-15 09:00:11,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {6481#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; {6489#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:11,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {6489#(<= ~counter~0 0)} assume true; {6489#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:11,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6489#(<= ~counter~0 0)} {6481#true} #102#return; {6489#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:11,246 INFO L272 TraceCheckUtils]: 4: Hoare triple {6489#(<= ~counter~0 0)} call #t~ret9 := main(); {6489#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:11,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {6489#(<= ~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; {6489#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:11,246 INFO L272 TraceCheckUtils]: 6: Hoare triple {6489#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {6489#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:11,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {6489#(<= ~counter~0 0)} ~cond := #in~cond; {6489#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:11,247 INFO L290 TraceCheckUtils]: 8: Hoare triple {6489#(<= ~counter~0 0)} assume !(0 == ~cond); {6489#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:11,247 INFO L290 TraceCheckUtils]: 9: Hoare triple {6489#(<= ~counter~0 0)} assume true; {6489#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:11,248 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6489#(<= ~counter~0 0)} {6489#(<= ~counter~0 0)} #90#return; {6489#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:11,248 INFO L272 TraceCheckUtils]: 11: Hoare triple {6489#(<= ~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)); {6489#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:11,249 INFO L290 TraceCheckUtils]: 12: Hoare triple {6489#(<= ~counter~0 0)} ~cond := #in~cond; {6489#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:11,249 INFO L290 TraceCheckUtils]: 13: Hoare triple {6489#(<= ~counter~0 0)} assume !(0 == ~cond); {6489#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:11,249 INFO L290 TraceCheckUtils]: 14: Hoare triple {6489#(<= ~counter~0 0)} assume true; {6489#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:11,250 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6489#(<= ~counter~0 0)} {6489#(<= ~counter~0 0)} #92#return; {6489#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:11,250 INFO L290 TraceCheckUtils]: 16: Hoare triple {6489#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {6489#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:11,251 INFO L290 TraceCheckUtils]: 17: Hoare triple {6489#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6538#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:11,251 INFO L290 TraceCheckUtils]: 18: Hoare triple {6538#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {6538#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:11,252 INFO L272 TraceCheckUtils]: 19: Hoare triple {6538#(<= ~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)); {6538#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:11,252 INFO L290 TraceCheckUtils]: 20: Hoare triple {6538#(<= ~counter~0 1)} ~cond := #in~cond; {6538#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:11,252 INFO L290 TraceCheckUtils]: 21: Hoare triple {6538#(<= ~counter~0 1)} assume !(0 == ~cond); {6538#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:11,253 INFO L290 TraceCheckUtils]: 22: Hoare triple {6538#(<= ~counter~0 1)} assume true; {6538#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:11,253 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6538#(<= ~counter~0 1)} {6538#(<= ~counter~0 1)} #94#return; {6538#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:11,254 INFO L290 TraceCheckUtils]: 24: Hoare triple {6538#(<= ~counter~0 1)} assume !!(0 != ~r~0); {6538#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:11,254 INFO L290 TraceCheckUtils]: 25: Hoare triple {6538#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6563#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:11,254 INFO L290 TraceCheckUtils]: 26: Hoare triple {6563#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {6563#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:11,255 INFO L272 TraceCheckUtils]: 27: Hoare triple {6563#(<= ~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)); {6563#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:11,255 INFO L290 TraceCheckUtils]: 28: Hoare triple {6563#(<= ~counter~0 2)} ~cond := #in~cond; {6563#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:11,256 INFO L290 TraceCheckUtils]: 29: Hoare triple {6563#(<= ~counter~0 2)} assume !(0 == ~cond); {6563#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:11,256 INFO L290 TraceCheckUtils]: 30: Hoare triple {6563#(<= ~counter~0 2)} assume true; {6563#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:11,257 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6563#(<= ~counter~0 2)} {6563#(<= ~counter~0 2)} #96#return; {6563#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:11,257 INFO L290 TraceCheckUtils]: 32: Hoare triple {6563#(<= ~counter~0 2)} assume !(~r~0 > 0); {6563#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:11,257 INFO L290 TraceCheckUtils]: 33: Hoare triple {6563#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6588#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:11,258 INFO L290 TraceCheckUtils]: 34: Hoare triple {6588#(<= ~counter~0 3)} assume !!(#t~post8 < 5);havoc #t~post8; {6588#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:11,258 INFO L272 TraceCheckUtils]: 35: Hoare triple {6588#(<= ~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)); {6588#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:11,259 INFO L290 TraceCheckUtils]: 36: Hoare triple {6588#(<= ~counter~0 3)} ~cond := #in~cond; {6588#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:11,259 INFO L290 TraceCheckUtils]: 37: Hoare triple {6588#(<= ~counter~0 3)} assume !(0 == ~cond); {6588#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:11,259 INFO L290 TraceCheckUtils]: 38: Hoare triple {6588#(<= ~counter~0 3)} assume true; {6588#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:11,260 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6588#(<= ~counter~0 3)} {6588#(<= ~counter~0 3)} #98#return; {6588#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:11,260 INFO L290 TraceCheckUtils]: 40: Hoare triple {6588#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6588#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:11,261 INFO L290 TraceCheckUtils]: 41: Hoare triple {6588#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6613#(<= ~counter~0 4)} is VALID [2022-04-15 09:00:11,261 INFO L290 TraceCheckUtils]: 42: Hoare triple {6613#(<= ~counter~0 4)} assume !!(#t~post8 < 5);havoc #t~post8; {6613#(<= ~counter~0 4)} is VALID [2022-04-15 09:00:11,262 INFO L272 TraceCheckUtils]: 43: Hoare triple {6613#(<= ~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)); {6613#(<= ~counter~0 4)} is VALID [2022-04-15 09:00:11,262 INFO L290 TraceCheckUtils]: 44: Hoare triple {6613#(<= ~counter~0 4)} ~cond := #in~cond; {6613#(<= ~counter~0 4)} is VALID [2022-04-15 09:00:11,262 INFO L290 TraceCheckUtils]: 45: Hoare triple {6613#(<= ~counter~0 4)} assume !(0 == ~cond); {6613#(<= ~counter~0 4)} is VALID [2022-04-15 09:00:11,263 INFO L290 TraceCheckUtils]: 46: Hoare triple {6613#(<= ~counter~0 4)} assume true; {6613#(<= ~counter~0 4)} is VALID [2022-04-15 09:00:11,263 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6613#(<= ~counter~0 4)} {6613#(<= ~counter~0 4)} #98#return; {6613#(<= ~counter~0 4)} is VALID [2022-04-15 09:00:11,263 INFO L290 TraceCheckUtils]: 48: Hoare triple {6613#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6613#(<= ~counter~0 4)} is VALID [2022-04-15 09:00:11,264 INFO L290 TraceCheckUtils]: 49: Hoare triple {6613#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6638#(<= |main_#t~post8| 4)} is VALID [2022-04-15 09:00:11,264 INFO L290 TraceCheckUtils]: 50: Hoare triple {6638#(<= |main_#t~post8| 4)} assume !(#t~post8 < 5);havoc #t~post8; {6482#false} is VALID [2022-04-15 09:00:11,264 INFO L290 TraceCheckUtils]: 51: Hoare triple {6482#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6482#false} is VALID [2022-04-15 09:00:11,264 INFO L290 TraceCheckUtils]: 52: Hoare triple {6482#false} assume !(#t~post6 < 5);havoc #t~post6; {6482#false} is VALID [2022-04-15 09:00:11,265 INFO L272 TraceCheckUtils]: 53: Hoare triple {6482#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)); {6482#false} is VALID [2022-04-15 09:00:11,265 INFO L290 TraceCheckUtils]: 54: Hoare triple {6482#false} ~cond := #in~cond; {6482#false} is VALID [2022-04-15 09:00:11,265 INFO L290 TraceCheckUtils]: 55: Hoare triple {6482#false} assume 0 == ~cond; {6482#false} is VALID [2022-04-15 09:00:11,265 INFO L290 TraceCheckUtils]: 56: Hoare triple {6482#false} assume !false; {6482#false} is VALID [2022-04-15 09:00:11,265 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:00:11,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:00:11,530 INFO L290 TraceCheckUtils]: 56: Hoare triple {6482#false} assume !false; {6482#false} is VALID [2022-04-15 09:00:11,530 INFO L290 TraceCheckUtils]: 55: Hoare triple {6482#false} assume 0 == ~cond; {6482#false} is VALID [2022-04-15 09:00:11,530 INFO L290 TraceCheckUtils]: 54: Hoare triple {6482#false} ~cond := #in~cond; {6482#false} is VALID [2022-04-15 09:00:11,531 INFO L272 TraceCheckUtils]: 53: Hoare triple {6482#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)); {6482#false} is VALID [2022-04-15 09:00:11,531 INFO L290 TraceCheckUtils]: 52: Hoare triple {6482#false} assume !(#t~post6 < 5);havoc #t~post6; {6482#false} is VALID [2022-04-15 09:00:11,531 INFO L290 TraceCheckUtils]: 51: Hoare triple {6482#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6482#false} is VALID [2022-04-15 09:00:11,531 INFO L290 TraceCheckUtils]: 50: Hoare triple {6638#(<= |main_#t~post8| 4)} assume !(#t~post8 < 5);havoc #t~post8; {6482#false} is VALID [2022-04-15 09:00:11,532 INFO L290 TraceCheckUtils]: 49: Hoare triple {6613#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6638#(<= |main_#t~post8| 4)} is VALID [2022-04-15 09:00:11,532 INFO L290 TraceCheckUtils]: 48: Hoare triple {6613#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6613#(<= ~counter~0 4)} is VALID [2022-04-15 09:00:11,533 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6481#true} {6613#(<= ~counter~0 4)} #98#return; {6613#(<= ~counter~0 4)} is VALID [2022-04-15 09:00:11,533 INFO L290 TraceCheckUtils]: 46: Hoare triple {6481#true} assume true; {6481#true} is VALID [2022-04-15 09:00:11,533 INFO L290 TraceCheckUtils]: 45: Hoare triple {6481#true} assume !(0 == ~cond); {6481#true} is VALID [2022-04-15 09:00:11,533 INFO L290 TraceCheckUtils]: 44: Hoare triple {6481#true} ~cond := #in~cond; {6481#true} is VALID [2022-04-15 09:00:11,533 INFO L272 TraceCheckUtils]: 43: Hoare triple {6613#(<= ~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)); {6481#true} is VALID [2022-04-15 09:00:11,533 INFO L290 TraceCheckUtils]: 42: Hoare triple {6613#(<= ~counter~0 4)} assume !!(#t~post8 < 5);havoc #t~post8; {6613#(<= ~counter~0 4)} is VALID [2022-04-15 09:00:11,534 INFO L290 TraceCheckUtils]: 41: Hoare triple {6588#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6613#(<= ~counter~0 4)} is VALID [2022-04-15 09:00:11,534 INFO L290 TraceCheckUtils]: 40: Hoare triple {6588#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6588#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:11,535 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6481#true} {6588#(<= ~counter~0 3)} #98#return; {6588#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:11,535 INFO L290 TraceCheckUtils]: 38: Hoare triple {6481#true} assume true; {6481#true} is VALID [2022-04-15 09:00:11,535 INFO L290 TraceCheckUtils]: 37: Hoare triple {6481#true} assume !(0 == ~cond); {6481#true} is VALID [2022-04-15 09:00:11,535 INFO L290 TraceCheckUtils]: 36: Hoare triple {6481#true} ~cond := #in~cond; {6481#true} is VALID [2022-04-15 09:00:11,535 INFO L272 TraceCheckUtils]: 35: Hoare triple {6588#(<= ~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)); {6481#true} is VALID [2022-04-15 09:00:11,536 INFO L290 TraceCheckUtils]: 34: Hoare triple {6588#(<= ~counter~0 3)} assume !!(#t~post8 < 5);havoc #t~post8; {6588#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:11,536 INFO L290 TraceCheckUtils]: 33: Hoare triple {6563#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6588#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:11,536 INFO L290 TraceCheckUtils]: 32: Hoare triple {6563#(<= ~counter~0 2)} assume !(~r~0 > 0); {6563#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:11,537 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6481#true} {6563#(<= ~counter~0 2)} #96#return; {6563#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:11,537 INFO L290 TraceCheckUtils]: 30: Hoare triple {6481#true} assume true; {6481#true} is VALID [2022-04-15 09:00:11,537 INFO L290 TraceCheckUtils]: 29: Hoare triple {6481#true} assume !(0 == ~cond); {6481#true} is VALID [2022-04-15 09:00:11,538 INFO L290 TraceCheckUtils]: 28: Hoare triple {6481#true} ~cond := #in~cond; {6481#true} is VALID [2022-04-15 09:00:11,539 INFO L272 TraceCheckUtils]: 27: Hoare triple {6563#(<= ~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)); {6481#true} is VALID [2022-04-15 09:00:11,539 INFO L290 TraceCheckUtils]: 26: Hoare triple {6563#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {6563#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:11,540 INFO L290 TraceCheckUtils]: 25: Hoare triple {6538#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6563#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:11,544 INFO L290 TraceCheckUtils]: 24: Hoare triple {6538#(<= ~counter~0 1)} assume !!(0 != ~r~0); {6538#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:11,544 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6481#true} {6538#(<= ~counter~0 1)} #94#return; {6538#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:11,545 INFO L290 TraceCheckUtils]: 22: Hoare triple {6481#true} assume true; {6481#true} is VALID [2022-04-15 09:00:11,545 INFO L290 TraceCheckUtils]: 21: Hoare triple {6481#true} assume !(0 == ~cond); {6481#true} is VALID [2022-04-15 09:00:11,545 INFO L290 TraceCheckUtils]: 20: Hoare triple {6481#true} ~cond := #in~cond; {6481#true} is VALID [2022-04-15 09:00:11,545 INFO L272 TraceCheckUtils]: 19: Hoare triple {6538#(<= ~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)); {6481#true} is VALID [2022-04-15 09:00:11,545 INFO L290 TraceCheckUtils]: 18: Hoare triple {6538#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {6538#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:11,546 INFO L290 TraceCheckUtils]: 17: Hoare triple {6489#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6538#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:11,546 INFO L290 TraceCheckUtils]: 16: Hoare triple {6489#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {6489#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:11,547 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6481#true} {6489#(<= ~counter~0 0)} #92#return; {6489#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:11,547 INFO L290 TraceCheckUtils]: 14: Hoare triple {6481#true} assume true; {6481#true} is VALID [2022-04-15 09:00:11,547 INFO L290 TraceCheckUtils]: 13: Hoare triple {6481#true} assume !(0 == ~cond); {6481#true} is VALID [2022-04-15 09:00:11,547 INFO L290 TraceCheckUtils]: 12: Hoare triple {6481#true} ~cond := #in~cond; {6481#true} is VALID [2022-04-15 09:00:11,547 INFO L272 TraceCheckUtils]: 11: Hoare triple {6489#(<= ~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)); {6481#true} is VALID [2022-04-15 09:00:11,548 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6481#true} {6489#(<= ~counter~0 0)} #90#return; {6489#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:11,548 INFO L290 TraceCheckUtils]: 9: Hoare triple {6481#true} assume true; {6481#true} is VALID [2022-04-15 09:00:11,548 INFO L290 TraceCheckUtils]: 8: Hoare triple {6481#true} assume !(0 == ~cond); {6481#true} is VALID [2022-04-15 09:00:11,548 INFO L290 TraceCheckUtils]: 7: Hoare triple {6481#true} ~cond := #in~cond; {6481#true} is VALID [2022-04-15 09:00:11,548 INFO L272 TraceCheckUtils]: 6: Hoare triple {6489#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {6481#true} is VALID [2022-04-15 09:00:11,548 INFO L290 TraceCheckUtils]: 5: Hoare triple {6489#(<= ~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; {6489#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:11,549 INFO L272 TraceCheckUtils]: 4: Hoare triple {6489#(<= ~counter~0 0)} call #t~ret9 := main(); {6489#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:11,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6489#(<= ~counter~0 0)} {6481#true} #102#return; {6489#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:11,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {6489#(<= ~counter~0 0)} assume true; {6489#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:11,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {6481#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; {6489#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:11,550 INFO L272 TraceCheckUtils]: 0: Hoare triple {6481#true} call ULTIMATE.init(); {6481#true} is VALID [2022-04-15 09:00:11,550 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:00:11,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:00:11,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493730121] [2022-04-15 09:00:11,551 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:00:11,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651574589] [2022-04-15 09:00:11,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651574589] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:00:11,552 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:00:11,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-15 09:00:11,552 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:00:11,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1070358558] [2022-04-15 09:00:11,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1070358558] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:00:11,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:00:11,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 09:00:11,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11556691] [2022-04-15 09:00:11,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:00:11,554 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:00:11,555 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:00:11,555 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:00:11,597 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:00:11,597 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 09:00:11,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:00:11,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 09:00:11,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-15 09:00:11,599 INFO L87 Difference]: Start difference. First operand 91 states and 112 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 09:00:11,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:00:11,917 INFO L93 Difference]: Finished difference Result 132 states and 170 transitions. [2022-04-15 09:00:11,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 09:00:11,918 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:00:11,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:00:11,918 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:00:11,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-15 09:00:11,920 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:00:11,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-15 09:00:11,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 117 transitions. [2022-04-15 09:00:12,002 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:00:12,004 INFO L225 Difference]: With dead ends: 132 [2022-04-15 09:00:12,004 INFO L226 Difference]: Without dead ends: 95 [2022-04-15 09:00:12,005 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-15 09:00:12,005 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 31 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 09:00:12,005 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 150 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 09:00:12,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-15 09:00:12,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2022-04-15 09:00:12,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:00:12,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 09:00:12,097 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 09:00:12,097 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 09:00:12,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:00:12,099 INFO L93 Difference]: Finished difference Result 95 states and 117 transitions. [2022-04-15 09:00:12,099 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2022-04-15 09:00:12,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:00:12,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:00:12,100 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 95 states. [2022-04-15 09:00:12,100 INFO L87 Difference]: Start difference. First operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 95 states. [2022-04-15 09:00:12,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:00:12,102 INFO L93 Difference]: Finished difference Result 95 states and 117 transitions. [2022-04-15 09:00:12,102 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2022-04-15 09:00:12,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:00:12,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:00:12,103 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:00:12,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:00:12,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 09:00:12,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 116 transitions. [2022-04-15 09:00:12,106 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 116 transitions. Word has length 57 [2022-04-15 09:00:12,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:00:12,106 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 116 transitions. [2022-04-15 09:00:12,106 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:00:12,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 116 transitions. [2022-04-15 09:00:13,010 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:00:13,010 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-15 09:00:13,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 09:00:13,010 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:00:13,010 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:00:13,027 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:00:13,215 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:00:13,215 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:00:13,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:00:13,216 INFO L85 PathProgramCache]: Analyzing trace with hash -659642693, now seen corresponding path program 5 times [2022-04-15 09:00:13,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:00:13,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1610802104] [2022-04-15 09:00:13,216 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:00:13,216 INFO L85 PathProgramCache]: Analyzing trace with hash -659642693, now seen corresponding path program 6 times [2022-04-15 09:00:13,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:00:13,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076450032] [2022-04-15 09:00:13,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:00:13,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:00:13,240 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:00:13,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [341158887] [2022-04-15 09:00:13,240 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 09:00:13,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:00:13,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:00:13,241 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:00:13,277 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:00:13,355 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 09:00:13,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:00:13,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 09:00:13,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:00:13,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:00:13,674 INFO L272 TraceCheckUtils]: 0: Hoare triple {7476#true} call ULTIMATE.init(); {7476#true} is VALID [2022-04-15 09:00:13,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {7476#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; {7484#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:13,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {7484#(<= ~counter~0 0)} assume true; {7484#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:13,675 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7484#(<= ~counter~0 0)} {7476#true} #102#return; {7484#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:13,677 INFO L272 TraceCheckUtils]: 4: Hoare triple {7484#(<= ~counter~0 0)} call #t~ret9 := main(); {7484#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:13,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {7484#(<= ~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; {7484#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:13,679 INFO L272 TraceCheckUtils]: 6: Hoare triple {7484#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {7484#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:13,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {7484#(<= ~counter~0 0)} ~cond := #in~cond; {7484#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:13,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {7484#(<= ~counter~0 0)} assume !(0 == ~cond); {7484#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:13,680 INFO L290 TraceCheckUtils]: 9: Hoare triple {7484#(<= ~counter~0 0)} assume true; {7484#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:13,680 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7484#(<= ~counter~0 0)} {7484#(<= ~counter~0 0)} #90#return; {7484#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:13,680 INFO L272 TraceCheckUtils]: 11: Hoare triple {7484#(<= ~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)); {7484#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:13,681 INFO L290 TraceCheckUtils]: 12: Hoare triple {7484#(<= ~counter~0 0)} ~cond := #in~cond; {7484#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:13,681 INFO L290 TraceCheckUtils]: 13: Hoare triple {7484#(<= ~counter~0 0)} assume !(0 == ~cond); {7484#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:13,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {7484#(<= ~counter~0 0)} assume true; {7484#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:13,682 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7484#(<= ~counter~0 0)} {7484#(<= ~counter~0 0)} #92#return; {7484#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:13,682 INFO L290 TraceCheckUtils]: 16: Hoare triple {7484#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {7484#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:13,683 INFO L290 TraceCheckUtils]: 17: Hoare triple {7484#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7533#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:13,683 INFO L290 TraceCheckUtils]: 18: Hoare triple {7533#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {7533#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:13,683 INFO L272 TraceCheckUtils]: 19: Hoare triple {7533#(<= ~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)); {7533#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:13,684 INFO L290 TraceCheckUtils]: 20: Hoare triple {7533#(<= ~counter~0 1)} ~cond := #in~cond; {7533#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:13,684 INFO L290 TraceCheckUtils]: 21: Hoare triple {7533#(<= ~counter~0 1)} assume !(0 == ~cond); {7533#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:13,684 INFO L290 TraceCheckUtils]: 22: Hoare triple {7533#(<= ~counter~0 1)} assume true; {7533#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:13,685 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7533#(<= ~counter~0 1)} {7533#(<= ~counter~0 1)} #94#return; {7533#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:13,685 INFO L290 TraceCheckUtils]: 24: Hoare triple {7533#(<= ~counter~0 1)} assume !!(0 != ~r~0); {7533#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:13,686 INFO L290 TraceCheckUtils]: 25: Hoare triple {7533#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7558#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:13,686 INFO L290 TraceCheckUtils]: 26: Hoare triple {7558#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {7558#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:13,686 INFO L272 TraceCheckUtils]: 27: Hoare triple {7558#(<= ~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)); {7558#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:13,688 INFO L290 TraceCheckUtils]: 28: Hoare triple {7558#(<= ~counter~0 2)} ~cond := #in~cond; {7558#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:13,689 INFO L290 TraceCheckUtils]: 29: Hoare triple {7558#(<= ~counter~0 2)} assume !(0 == ~cond); {7558#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:13,689 INFO L290 TraceCheckUtils]: 30: Hoare triple {7558#(<= ~counter~0 2)} assume true; {7558#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:13,690 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7558#(<= ~counter~0 2)} {7558#(<= ~counter~0 2)} #96#return; {7558#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:13,691 INFO L290 TraceCheckUtils]: 32: Hoare triple {7558#(<= ~counter~0 2)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7558#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:13,692 INFO L290 TraceCheckUtils]: 33: Hoare triple {7558#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7583#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:13,692 INFO L290 TraceCheckUtils]: 34: Hoare triple {7583#(<= ~counter~0 3)} assume !!(#t~post7 < 5);havoc #t~post7; {7583#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:13,693 INFO L272 TraceCheckUtils]: 35: Hoare triple {7583#(<= ~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)); {7583#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:13,694 INFO L290 TraceCheckUtils]: 36: Hoare triple {7583#(<= ~counter~0 3)} ~cond := #in~cond; {7583#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:13,694 INFO L290 TraceCheckUtils]: 37: Hoare triple {7583#(<= ~counter~0 3)} assume !(0 == ~cond); {7583#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:13,694 INFO L290 TraceCheckUtils]: 38: Hoare triple {7583#(<= ~counter~0 3)} assume true; {7583#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:13,695 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7583#(<= ~counter~0 3)} {7583#(<= ~counter~0 3)} #96#return; {7583#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:13,696 INFO L290 TraceCheckUtils]: 40: Hoare triple {7583#(<= ~counter~0 3)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7583#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:13,696 INFO L290 TraceCheckUtils]: 41: Hoare triple {7583#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7608#(<= ~counter~0 4)} is VALID [2022-04-15 09:00:13,697 INFO L290 TraceCheckUtils]: 42: Hoare triple {7608#(<= ~counter~0 4)} assume !!(#t~post7 < 5);havoc #t~post7; {7608#(<= ~counter~0 4)} is VALID [2022-04-15 09:00:13,697 INFO L272 TraceCheckUtils]: 43: Hoare triple {7608#(<= ~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)); {7608#(<= ~counter~0 4)} is VALID [2022-04-15 09:00:13,698 INFO L290 TraceCheckUtils]: 44: Hoare triple {7608#(<= ~counter~0 4)} ~cond := #in~cond; {7608#(<= ~counter~0 4)} is VALID [2022-04-15 09:00:13,698 INFO L290 TraceCheckUtils]: 45: Hoare triple {7608#(<= ~counter~0 4)} assume !(0 == ~cond); {7608#(<= ~counter~0 4)} is VALID [2022-04-15 09:00:13,699 INFO L290 TraceCheckUtils]: 46: Hoare triple {7608#(<= ~counter~0 4)} assume true; {7608#(<= ~counter~0 4)} is VALID [2022-04-15 09:00:13,699 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7608#(<= ~counter~0 4)} {7608#(<= ~counter~0 4)} #96#return; {7608#(<= ~counter~0 4)} is VALID [2022-04-15 09:00:13,700 INFO L290 TraceCheckUtils]: 48: Hoare triple {7608#(<= ~counter~0 4)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7608#(<= ~counter~0 4)} is VALID [2022-04-15 09:00:13,700 INFO L290 TraceCheckUtils]: 49: Hoare triple {7608#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7633#(<= |main_#t~post7| 4)} is VALID [2022-04-15 09:00:13,701 INFO L290 TraceCheckUtils]: 50: Hoare triple {7633#(<= |main_#t~post7| 4)} assume !(#t~post7 < 5);havoc #t~post7; {7477#false} is VALID [2022-04-15 09:00:13,701 INFO L290 TraceCheckUtils]: 51: Hoare triple {7477#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7477#false} is VALID [2022-04-15 09:00:13,701 INFO L290 TraceCheckUtils]: 52: Hoare triple {7477#false} assume !(#t~post8 < 5);havoc #t~post8; {7477#false} is VALID [2022-04-15 09:00:13,701 INFO L290 TraceCheckUtils]: 53: Hoare triple {7477#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7477#false} is VALID [2022-04-15 09:00:13,701 INFO L290 TraceCheckUtils]: 54: Hoare triple {7477#false} assume !(#t~post6 < 5);havoc #t~post6; {7477#false} is VALID [2022-04-15 09:00:13,701 INFO L272 TraceCheckUtils]: 55: Hoare triple {7477#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)); {7477#false} is VALID [2022-04-15 09:00:13,701 INFO L290 TraceCheckUtils]: 56: Hoare triple {7477#false} ~cond := #in~cond; {7477#false} is VALID [2022-04-15 09:00:13,702 INFO L290 TraceCheckUtils]: 57: Hoare triple {7477#false} assume 0 == ~cond; {7477#false} is VALID [2022-04-15 09:00:13,702 INFO L290 TraceCheckUtils]: 58: Hoare triple {7477#false} assume !false; {7477#false} is VALID [2022-04-15 09:00:13,703 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:00:13,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:00:13,974 INFO L290 TraceCheckUtils]: 58: Hoare triple {7477#false} assume !false; {7477#false} is VALID [2022-04-15 09:00:13,974 INFO L290 TraceCheckUtils]: 57: Hoare triple {7477#false} assume 0 == ~cond; {7477#false} is VALID [2022-04-15 09:00:13,974 INFO L290 TraceCheckUtils]: 56: Hoare triple {7477#false} ~cond := #in~cond; {7477#false} is VALID [2022-04-15 09:00:13,974 INFO L272 TraceCheckUtils]: 55: Hoare triple {7477#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)); {7477#false} is VALID [2022-04-15 09:00:13,974 INFO L290 TraceCheckUtils]: 54: Hoare triple {7477#false} assume !(#t~post6 < 5);havoc #t~post6; {7477#false} is VALID [2022-04-15 09:00:13,974 INFO L290 TraceCheckUtils]: 53: Hoare triple {7477#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7477#false} is VALID [2022-04-15 09:00:13,974 INFO L290 TraceCheckUtils]: 52: Hoare triple {7477#false} assume !(#t~post8 < 5);havoc #t~post8; {7477#false} is VALID [2022-04-15 09:00:13,974 INFO L290 TraceCheckUtils]: 51: Hoare triple {7477#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7477#false} is VALID [2022-04-15 09:00:13,975 INFO L290 TraceCheckUtils]: 50: Hoare triple {7633#(<= |main_#t~post7| 4)} assume !(#t~post7 < 5);havoc #t~post7; {7477#false} is VALID [2022-04-15 09:00:13,975 INFO L290 TraceCheckUtils]: 49: Hoare triple {7608#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7633#(<= |main_#t~post7| 4)} is VALID [2022-04-15 09:00:13,975 INFO L290 TraceCheckUtils]: 48: Hoare triple {7608#(<= ~counter~0 4)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7608#(<= ~counter~0 4)} is VALID [2022-04-15 09:00:13,976 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7476#true} {7608#(<= ~counter~0 4)} #96#return; {7608#(<= ~counter~0 4)} is VALID [2022-04-15 09:00:13,976 INFO L290 TraceCheckUtils]: 46: Hoare triple {7476#true} assume true; {7476#true} is VALID [2022-04-15 09:00:13,976 INFO L290 TraceCheckUtils]: 45: Hoare triple {7476#true} assume !(0 == ~cond); {7476#true} is VALID [2022-04-15 09:00:13,976 INFO L290 TraceCheckUtils]: 44: Hoare triple {7476#true} ~cond := #in~cond; {7476#true} is VALID [2022-04-15 09:00:13,976 INFO L272 TraceCheckUtils]: 43: Hoare triple {7608#(<= ~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)); {7476#true} is VALID [2022-04-15 09:00:13,976 INFO L290 TraceCheckUtils]: 42: Hoare triple {7608#(<= ~counter~0 4)} assume !!(#t~post7 < 5);havoc #t~post7; {7608#(<= ~counter~0 4)} is VALID [2022-04-15 09:00:13,977 INFO L290 TraceCheckUtils]: 41: Hoare triple {7583#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7608#(<= ~counter~0 4)} is VALID [2022-04-15 09:00:13,977 INFO L290 TraceCheckUtils]: 40: Hoare triple {7583#(<= ~counter~0 3)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7583#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:13,978 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7476#true} {7583#(<= ~counter~0 3)} #96#return; {7583#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:13,978 INFO L290 TraceCheckUtils]: 38: Hoare triple {7476#true} assume true; {7476#true} is VALID [2022-04-15 09:00:13,978 INFO L290 TraceCheckUtils]: 37: Hoare triple {7476#true} assume !(0 == ~cond); {7476#true} is VALID [2022-04-15 09:00:13,978 INFO L290 TraceCheckUtils]: 36: Hoare triple {7476#true} ~cond := #in~cond; {7476#true} is VALID [2022-04-15 09:00:13,978 INFO L272 TraceCheckUtils]: 35: Hoare triple {7583#(<= ~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)); {7476#true} is VALID [2022-04-15 09:00:13,978 INFO L290 TraceCheckUtils]: 34: Hoare triple {7583#(<= ~counter~0 3)} assume !!(#t~post7 < 5);havoc #t~post7; {7583#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:13,979 INFO L290 TraceCheckUtils]: 33: Hoare triple {7558#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7583#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:13,979 INFO L290 TraceCheckUtils]: 32: Hoare triple {7558#(<= ~counter~0 2)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7558#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:13,980 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7476#true} {7558#(<= ~counter~0 2)} #96#return; {7558#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:13,980 INFO L290 TraceCheckUtils]: 30: Hoare triple {7476#true} assume true; {7476#true} is VALID [2022-04-15 09:00:13,980 INFO L290 TraceCheckUtils]: 29: Hoare triple {7476#true} assume !(0 == ~cond); {7476#true} is VALID [2022-04-15 09:00:13,980 INFO L290 TraceCheckUtils]: 28: Hoare triple {7476#true} ~cond := #in~cond; {7476#true} is VALID [2022-04-15 09:00:13,980 INFO L272 TraceCheckUtils]: 27: Hoare triple {7558#(<= ~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)); {7476#true} is VALID [2022-04-15 09:00:13,980 INFO L290 TraceCheckUtils]: 26: Hoare triple {7558#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {7558#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:13,981 INFO L290 TraceCheckUtils]: 25: Hoare triple {7533#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7558#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:13,981 INFO L290 TraceCheckUtils]: 24: Hoare triple {7533#(<= ~counter~0 1)} assume !!(0 != ~r~0); {7533#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:13,981 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7476#true} {7533#(<= ~counter~0 1)} #94#return; {7533#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:13,981 INFO L290 TraceCheckUtils]: 22: Hoare triple {7476#true} assume true; {7476#true} is VALID [2022-04-15 09:00:13,982 INFO L290 TraceCheckUtils]: 21: Hoare triple {7476#true} assume !(0 == ~cond); {7476#true} is VALID [2022-04-15 09:00:13,982 INFO L290 TraceCheckUtils]: 20: Hoare triple {7476#true} ~cond := #in~cond; {7476#true} is VALID [2022-04-15 09:00:13,982 INFO L272 TraceCheckUtils]: 19: Hoare triple {7533#(<= ~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)); {7476#true} is VALID [2022-04-15 09:00:13,982 INFO L290 TraceCheckUtils]: 18: Hoare triple {7533#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {7533#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:13,982 INFO L290 TraceCheckUtils]: 17: Hoare triple {7484#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7533#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:13,983 INFO L290 TraceCheckUtils]: 16: Hoare triple {7484#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {7484#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:13,983 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7476#true} {7484#(<= ~counter~0 0)} #92#return; {7484#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:13,983 INFO L290 TraceCheckUtils]: 14: Hoare triple {7476#true} assume true; {7476#true} is VALID [2022-04-15 09:00:13,983 INFO L290 TraceCheckUtils]: 13: Hoare triple {7476#true} assume !(0 == ~cond); {7476#true} is VALID [2022-04-15 09:00:13,983 INFO L290 TraceCheckUtils]: 12: Hoare triple {7476#true} ~cond := #in~cond; {7476#true} is VALID [2022-04-15 09:00:13,983 INFO L272 TraceCheckUtils]: 11: Hoare triple {7484#(<= ~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)); {7476#true} is VALID [2022-04-15 09:00:13,986 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7476#true} {7484#(<= ~counter~0 0)} #90#return; {7484#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:13,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {7476#true} assume true; {7476#true} is VALID [2022-04-15 09:00:13,986 INFO L290 TraceCheckUtils]: 8: Hoare triple {7476#true} assume !(0 == ~cond); {7476#true} is VALID [2022-04-15 09:00:13,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {7476#true} ~cond := #in~cond; {7476#true} is VALID [2022-04-15 09:00:13,986 INFO L272 TraceCheckUtils]: 6: Hoare triple {7484#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {7476#true} is VALID [2022-04-15 09:00:13,987 INFO L290 TraceCheckUtils]: 5: Hoare triple {7484#(<= ~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; {7484#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:13,987 INFO L272 TraceCheckUtils]: 4: Hoare triple {7484#(<= ~counter~0 0)} call #t~ret9 := main(); {7484#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:13,987 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7484#(<= ~counter~0 0)} {7476#true} #102#return; {7484#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:13,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {7484#(<= ~counter~0 0)} assume true; {7484#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:13,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {7476#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; {7484#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:13,988 INFO L272 TraceCheckUtils]: 0: Hoare triple {7476#true} call ULTIMATE.init(); {7476#true} is VALID [2022-04-15 09:00:13,988 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:00:13,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:00:13,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076450032] [2022-04-15 09:00:13,989 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:00:13,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341158887] [2022-04-15 09:00:13,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341158887] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:00:13,989 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:00:13,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-15 09:00:13,989 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:00:13,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1610802104] [2022-04-15 09:00:13,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1610802104] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:00:13,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:00:13,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 09:00:13,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231566261] [2022-04-15 09:00:13,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:00:13,990 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:00:13,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:00:13,990 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:00:14,036 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:00:14,036 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 09:00:14,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:00:14,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 09:00:14,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-15 09:00:14,037 INFO L87 Difference]: Start difference. First operand 94 states and 116 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 09:00:14,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:00:14,355 INFO L93 Difference]: Finished difference Result 133 states and 171 transitions. [2022-04-15 09:00:14,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 09:00:14,355 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:00:14,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:00:14,355 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:00:14,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2022-04-15 09:00:14,357 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:00:14,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2022-04-15 09:00:14,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 117 transitions. [2022-04-15 09:00:14,444 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:00:14,446 INFO L225 Difference]: With dead ends: 133 [2022-04-15 09:00:14,446 INFO L226 Difference]: Without dead ends: 96 [2022-04-15 09:00:14,446 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-04-15 09:00:14,446 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 26 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 09:00:14,447 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 163 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 09:00:14,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-15 09:00:14,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-04-15 09:00:14,529 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:00:14,530 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 09:00:14,530 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 09:00:14,530 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 09:00:14,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:00:14,532 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2022-04-15 09:00:14,532 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-15 09:00:14,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:00:14,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:00:14,533 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 96 states. [2022-04-15 09:00:14,534 INFO L87 Difference]: Start difference. First operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 96 states. [2022-04-15 09:00:14,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:00:14,536 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2022-04-15 09:00:14,536 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-15 09:00:14,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:00:14,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:00:14,537 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:00:14,537 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:00:14,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 09:00:14,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 118 transitions. [2022-04-15 09:00:14,539 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 118 transitions. Word has length 59 [2022-04-15 09:00:14,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:00:14,539 INFO L478 AbstractCegarLoop]: Abstraction has 96 states and 118 transitions. [2022-04-15 09:00:14,539 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:00:14,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 118 transitions. [2022-04-15 09:00:16,205 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:00:16,205 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-15 09:00:16,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-15 09:00:16,206 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:00:16,206 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:00:16,214 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:00:16,411 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:00:16,411 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:00:16,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:00:16,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1402694082, now seen corresponding path program 3 times [2022-04-15 09:00:16,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:00:16,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1616722464] [2022-04-15 09:00:16,412 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:00:16,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1402694082, now seen corresponding path program 4 times [2022-04-15 09:00:16,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:00:16,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578244733] [2022-04-15 09:00:16,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:00:16,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:00:16,428 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:00:16,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [818921966] [2022-04-15 09:00:16,429 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 09:00:16,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:00:16,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:00:16,430 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:00:16,432 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:00:16,497 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 09:00:16,497 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-15 09:00:16,498 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 09:00:16,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 09:00:16,539 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 09:00:16,539 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-15 09:00:16,539 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-15 09:00:16,541 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 09:00:16,579 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:00:16,765 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:00:16,769 INFO L719 BasicCegarLoop]: Path program histogram: [6, 4, 4, 2, 2, 2, 2, 2, 2, 2] [2022-04-15 09:00:16,771 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 09:00:16,787 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 09:00:16,787 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-15 09:00:16,787 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 09:00:16,787 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 09:00:16,787 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-15 09:00:16,787 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-15 09:00:16,787 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-15 09:00:16,787 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 09:00:16,787 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 09:00:16,787 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 09:00:16,787 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 09:00:16,787 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-15 09:00:16,787 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-15 09:00:16,787 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-15 09:00:16,787 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-15 09:00:16,788 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-15 09:00:16,788 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-15 09:00:16,788 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 09:00:16,788 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 09:00:16,788 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-15 09:00:16,788 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-15 09:00:16,788 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-15 09:00:16,788 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-15 09:00:16,788 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-15 09:00:16,788 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-15 09:00:16,788 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 09:00:16,788 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 09:00:16,788 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-15 09:00:16,788 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 09:00:16,788 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 09:00:16,788 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 09:00:16,788 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 09:00:16,788 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2022-04-15 09:00:16,788 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2022-04-15 09:00:16,788 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-15 09:00:16,789 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-15 09:00:16,789 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2022-04-15 09:00:16,789 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2022-04-15 09:00:16,789 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-15 09:00:16,789 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-15 09:00:16,789 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2022-04-15 09:00:16,789 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-15 09:00:16,789 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-15 09:00:16,789 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-15 09:00:16,789 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-15 09:00:16,789 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2022-04-15 09:00:16,789 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2022-04-15 09:00:16,789 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2022-04-15 09:00:16,789 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2022-04-15 09:00:16,789 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 09:00:16,789 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-15 09:00:16,789 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-15 09:00:16,789 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-04-15 09:00:16,789 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-04-15 09:00:16,789 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-15 09:00:16,790 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-15 09:00:16,790 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 09:00:16,790 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-15 09:00:16,790 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-15 09:00:16,790 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-15 09:00:16,790 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-15 09:00:16,790 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 09:00:16,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 09:00:16 BoogieIcfgContainer [2022-04-15 09:00:16,791 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 09:00:16,792 INFO L158 Benchmark]: Toolchain (without parser) took 73258.39ms. Allocated memory is still 177.2MB. Free memory was 127.5MB in the beginning and 79.7MB in the end (delta: 47.9MB). Peak memory consumption was 48.8MB. Max. memory is 8.0GB. [2022-04-15 09:00:16,792 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 177.2MB. Free memory is still 144.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 09:00:16,792 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.33ms. Allocated memory is still 177.2MB. Free memory was 127.2MB in the beginning and 155.0MB in the end (delta: -27.8MB). Peak memory consumption was 13.5MB. Max. memory is 8.0GB. [2022-04-15 09:00:16,793 INFO L158 Benchmark]: Boogie Preprocessor took 24.27ms. Allocated memory is still 177.2MB. Free memory was 155.0MB in the beginning and 153.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 09:00:16,793 INFO L158 Benchmark]: RCFGBuilder took 271.46ms. Allocated memory is still 177.2MB. Free memory was 153.4MB in the beginning and 141.2MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 09:00:16,795 INFO L158 Benchmark]: TraceAbstraction took 72746.46ms. Allocated memory is still 177.2MB. Free memory was 140.8MB in the beginning and 79.7MB in the end (delta: 61.1MB). Peak memory consumption was 61.5MB. Max. memory is 8.0GB. [2022-04-15 09:00:16,796 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 177.2MB. Free memory is still 144.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 210.33ms. Allocated memory is still 177.2MB. Free memory was 127.2MB in the beginning and 155.0MB in the end (delta: -27.8MB). Peak memory consumption was 13.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.27ms. Allocated memory is still 177.2MB. Free memory was 155.0MB in the beginning and 153.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 271.46ms. Allocated memory is still 177.2MB. Free memory was 153.4MB in the beginning and 141.2MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 72746.46ms. Allocated memory is still 177.2MB. Free memory was 140.8MB in the beginning and 79.7MB in the end (delta: 61.1MB). Peak memory consumption was 61.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; [L21] int A, R; [L22] long long u, v, r; [L23] A = __VERIFIER_nondet_int() [L24] R = __VERIFIER_nondet_int() [L25] CALL assume_abort_if_not((((long long) R - 1) * ((long long) R - 1)) < A) [L9] COND FALSE !(!cond) [L25] RET assume_abort_if_not((((long long) R - 1) * ((long long) R - 1)) < A) [L27] CALL assume_abort_if_not(A % 2 == 1) [L9] COND FALSE !(!cond) [L27] RET assume_abort_if_not(A % 2 == 1) [L29] u = ((long long) 2 * R) + 1 [L30] v = 1 [L31] r = ((long long) R * R) - A [L34] EXPR counter++ [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L12] COND FALSE !(!(cond)) [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L36] COND FALSE !(!(r != 0)) [L39] EXPR counter++ [L39] COND TRUE counter++<5 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L12] COND FALSE !(!(cond)) [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L41] COND TRUE !(r > 0) [L47] EXPR counter++ [L47] COND TRUE counter++<5 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L12] COND FALSE !(!(cond)) [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L49] COND FALSE !(!(r < 0)) [L51] r = r + u [L52] u = u + 2 [L47] EXPR counter++ [L47] COND TRUE counter++<5 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L12] COND FALSE !(!(cond)) [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L49] COND FALSE !(!(r < 0)) [L51] r = r + u [L52] u = u + 2 [L47] EXPR counter++ [L47] COND TRUE counter++<5 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L12] COND FALSE !(!(cond)) [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L49] COND TRUE !(r < 0) [L34] EXPR counter++ [L34] COND FALSE !(counter++<5) [L56] CALL __VERIFIER_assert(((long long) 4*A) == u*u - v*v - 2*u + 2*v) [L12] COND TRUE !(cond) [L14] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 72.7s, OverallIterations: 14, TraceHistogramMax: 6, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 28.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 247 SdHoareTripleChecker+Valid, 9.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 238 mSDsluCounter, 1598 SdHoareTripleChecker+Invalid, 9.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1071 mSDsCounter, 162 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 443 IncrementalHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 162 mSolverCounterUnsat, 527 mSDtfsCounter, 443 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 919 GetRequests, 833 SyntacticMatches, 8 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=13, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 13 MinimizatonAttempts, 33 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-15 09:00:16,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...