/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-fb4f59a-m [2022-04-28 05:57:40,268 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 05:57:40,270 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 05:57:40,313 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 05:57:40,313 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 05:57:40,314 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 05:57:40,315 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 05:57:40,317 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 05:57:40,318 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 05:57:40,319 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 05:57:40,321 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 05:57:40,322 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 05:57:40,322 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 05:57:40,323 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 05:57:40,324 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 05:57:40,325 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 05:57:40,325 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 05:57:40,326 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 05:57:40,327 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 05:57:40,329 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 05:57:40,330 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 05:57:40,334 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 05:57:40,337 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 05:57:40,339 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 05:57:40,342 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 05:57:40,345 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 05:57:40,346 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 05:57:40,346 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 05:57:40,346 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 05:57:40,347 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 05:57:40,347 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 05:57:40,348 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 05:57:40,348 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 05:57:40,349 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 05:57:40,349 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 05:57:40,350 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 05:57:40,350 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 05:57:40,351 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 05:57:40,351 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 05:57:40,351 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 05:57:40,352 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 05:57:40,360 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 05:57:40,361 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 05:57:40,371 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 05:57:40,372 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 05:57:40,373 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 05:57:40,373 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 05:57:40,373 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 05:57:40,373 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 05:57:40,373 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 05:57:40,373 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 05:57:40,373 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 05:57:40,374 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 05:57:40,374 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 05:57:40,374 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 05:57:40,375 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 05:57:40,375 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 05:57:40,375 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 05:57:40,375 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 05:57:40,375 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 05:57:40,375 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 05:57:40,375 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 05:57:40,376 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 05:57:40,376 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 05:57:40,376 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 05:57:40,376 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 05:57:40,376 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 05:57:40,376 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 05:57:40,376 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-28 05:57:40,617 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 05:57:40,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 05:57:40,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 05:57:40,641 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 05:57:40,642 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 05:57:40,643 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-28 05:57:40,698 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/781b77ce3/60129b34fc4d47429ca98ec040724789/FLAG46ba7e31f [2022-04-28 05:57:41,115 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 05:57:41,116 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound5.c [2022-04-28 05:57:41,123 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/781b77ce3/60129b34fc4d47429ca98ec040724789/FLAG46ba7e31f [2022-04-28 05:57:41,506 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/781b77ce3/60129b34fc4d47429ca98ec040724789 [2022-04-28 05:57:41,508 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 05:57:41,509 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 05:57:41,511 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 05:57:41,511 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 05:57:41,513 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 05:57:41,514 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 05:57:41" (1/1) ... [2022-04-28 05:57:41,515 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@203a05c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:57:41, skipping insertion in model container [2022-04-28 05:57:41,515 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 05:57:41" (1/1) ... [2022-04-28 05:57:41,521 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 05:57:41,532 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 05:57:41,653 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-28 05:57:41,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 05:57:41,679 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 05:57:41,696 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-28 05:57:41,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 05:57:41,723 INFO L208 MainTranslator]: Completed translation [2022-04-28 05:57:41,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:57:41 WrapperNode [2022-04-28 05:57:41,724 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 05:57:41,725 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 05:57:41,725 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 05:57:41,725 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 05:57:41,732 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:57:41" (1/1) ... [2022-04-28 05:57:41,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:57:41" (1/1) ... [2022-04-28 05:57:41,737 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:57:41" (1/1) ... [2022-04-28 05:57:41,737 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:57:41" (1/1) ... [2022-04-28 05:57:41,743 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:57:41" (1/1) ... [2022-04-28 05:57:41,747 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:57:41" (1/1) ... [2022-04-28 05:57:41,748 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:57:41" (1/1) ... [2022-04-28 05:57:41,750 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 05:57:41,751 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 05:57:41,751 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 05:57:41,751 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 05:57:41,756 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:57:41" (1/1) ... [2022-04-28 05:57:41,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 05:57:41,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:57:41,784 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-28 05:57:41,798 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-28 05:57:41,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 05:57:41,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 05:57:41,822 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 05:57:41,822 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 05:57:41,822 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 05:57:41,822 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 05:57:41,822 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 05:57:41,822 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 05:57:41,822 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 05:57:41,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 05:57:41,823 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 05:57:41,823 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 05:57:41,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 05:57:41,824 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 05:57:41,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 05:57:41,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 05:57:41,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 05:57:41,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 05:57:41,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 05:57:41,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 05:57:41,876 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 05:57:41,878 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 05:57:42,055 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 05:57:42,060 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 05:57:42,061 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-28 05:57:42,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 05:57:42 BoogieIcfgContainer [2022-04-28 05:57:42,062 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 05:57:42,063 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 05:57:42,063 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 05:57:42,066 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 05:57:42,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 05:57:41" (1/3) ... [2022-04-28 05:57:42,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb6624c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 05:57:42, skipping insertion in model container [2022-04-28 05:57:42,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:57:41" (2/3) ... [2022-04-28 05:57:42,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb6624c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 05:57:42, skipping insertion in model container [2022-04-28 05:57:42,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 05:57:42" (3/3) ... [2022-04-28 05:57:42,070 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound5.c [2022-04-28 05:57:42,081 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 05:57:42,081 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 05:57:42,115 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 05:57:42,120 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@458a97e1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6ab4c241 [2022-04-28 05:57:42,120 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 05:57:42,127 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-28 05:57:42,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 05:57:42,133 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:57:42,133 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:57:42,134 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:57:42,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:57:42,138 INFO L85 PathProgramCache]: Analyzing trace with hash 928708300, now seen corresponding path program 1 times [2022-04-28 05:57:42,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:42,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [212321257] [2022-04-28 05:57:42,157 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:57:42,157 INFO L85 PathProgramCache]: Analyzing trace with hash 928708300, now seen corresponding path program 2 times [2022-04-28 05:57:42,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:57:42,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709811627] [2022-04-28 05:57:42,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:57:42,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:57:42,285 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:57:42,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [104693959] [2022-04-28 05:57:42,286 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:57:42,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:42,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:57:42,295 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-28 05:57:42,341 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-28 05:57:42,382 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 05:57:42,383 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:57:42,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-28 05:57:42,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:57:42,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:57:42,503 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {40#true} is VALID [2022-04-28 05:57:42,504 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-28 05:57:42,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-28 05:57:42,504 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #102#return; {40#true} is VALID [2022-04-28 05:57:42,504 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret9 := main(); {40#true} is VALID [2022-04-28 05:57:42,505 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-28 05:57:42,505 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-28 05:57:42,506 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-28 05:57:42,506 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {40#true} is VALID [2022-04-28 05:57:42,506 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-28 05:57:42,506 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40#true} {40#true} #90#return; {40#true} is VALID [2022-04-28 05:57:42,507 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-28 05:57:42,507 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-28 05:57:42,508 INFO L290 TraceCheckUtils]: 13: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-28 05:57:42,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-28 05:57:42,508 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {41#false} {40#true} #92#return; {41#false} is VALID [2022-04-28 05:57:42,508 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-28 05:57:42,509 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-28 05:57:42,509 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-28 05:57:42,511 INFO L290 TraceCheckUtils]: 19: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-28 05:57:42,511 INFO L290 TraceCheckUtils]: 20: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-28 05:57:42,512 INFO L290 TraceCheckUtils]: 21: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-28 05:57:42,512 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-28 05:57:42,513 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:57:42,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:57:42,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709811627] [2022-04-28 05:57:42,513 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:57:42,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104693959] [2022-04-28 05:57:42,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104693959] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:57:42,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:57:42,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-28 05:57:42,518 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:57:42,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [212321257] [2022-04-28 05:57:42,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [212321257] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:57:42,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:57:42,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-28 05:57:42,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292318318] [2022-04-28 05:57:42,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:57:42,526 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-28 05:57:42,527 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:57:42,530 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-28 05:57:42,558 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-28 05:57:42,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-28 05:57:42,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:42,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-28 05:57:42,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-28 05:57:42,592 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-28 05:57:42,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:42,693 INFO L93 Difference]: Finished difference Result 67 states and 100 transitions. [2022-04-28 05:57:42,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-28 05:57:42,694 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-28 05:57:42,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:57:42,695 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-28 05:57:42,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-28 05:57:42,713 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-28 05:57:42,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-28 05:57:42,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 100 transitions. [2022-04-28 05:57:42,815 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-28 05:57:42,822 INFO L225 Difference]: With dead ends: 67 [2022-04-28 05:57:42,822 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 05:57:42,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-28 05:57:42,827 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:57:42,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:57:42,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 05:57:42,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-28 05:57:42,852 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:57:42,853 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-28 05:57:42,853 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-28 05:57:42,854 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-28 05:57:42,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:42,858 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-28 05:57:42,858 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-28 05:57:42,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:42,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:42,859 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-28 05:57:42,860 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-28 05:57:42,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:42,863 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-28 05:57:42,863 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-28 05:57:42,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:42,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:42,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:57:42,865 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:57:42,865 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-28 05:57:42,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-28 05:57:42,868 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 22 [2022-04-28 05:57:42,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:57:42,869 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-28 05:57:42,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 05:57:42,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 41 transitions. [2022-04-28 05:57:42,905 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-28 05:57:42,905 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-28 05:57:42,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 05:57:42,906 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:57:42,906 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:57:42,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 05:57:43,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-28 05:57:43,128 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:57:43,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:57:43,129 INFO L85 PathProgramCache]: Analyzing trace with hash -155606603, now seen corresponding path program 1 times [2022-04-28 05:57:43,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:43,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1490093726] [2022-04-28 05:57:43,130 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:57:43,130 INFO L85 PathProgramCache]: Analyzing trace with hash -155606603, now seen corresponding path program 2 times [2022-04-28 05:57:43,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:57:43,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045030149] [2022-04-28 05:57:43,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:57:43,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:57:43,161 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:57:43,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [395723196] [2022-04-28 05:57:43,162 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:57:43,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:43,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:57:43,164 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-28 05:57:43,181 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-28 05:57:43,220 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 05:57:43,221 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:57:43,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 05:57:43,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:57:43,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:57:43,435 INFO L272 TraceCheckUtils]: 0: Hoare triple {369#true} call ULTIMATE.init(); {369#true} is VALID [2022-04-28 05:57:43,436 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-28 05:57:43,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:43,437 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {377#(<= ~counter~0 0)} {369#true} #102#return; {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:43,438 INFO L272 TraceCheckUtils]: 4: Hoare triple {377#(<= ~counter~0 0)} call #t~ret9 := main(); {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:43,438 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-28 05:57:43,451 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-28 05:57:43,452 INFO L290 TraceCheckUtils]: 7: Hoare triple {377#(<= ~counter~0 0)} ~cond := #in~cond; {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:43,453 INFO L290 TraceCheckUtils]: 8: Hoare triple {377#(<= ~counter~0 0)} assume !(0 == ~cond); {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:43,453 INFO L290 TraceCheckUtils]: 9: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:43,454 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {377#(<= ~counter~0 0)} {377#(<= ~counter~0 0)} #90#return; {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:43,455 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-28 05:57:43,455 INFO L290 TraceCheckUtils]: 12: Hoare triple {377#(<= ~counter~0 0)} ~cond := #in~cond; {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:43,456 INFO L290 TraceCheckUtils]: 13: Hoare triple {377#(<= ~counter~0 0)} assume !(0 == ~cond); {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:43,456 INFO L290 TraceCheckUtils]: 14: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:43,457 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {377#(<= ~counter~0 0)} {377#(<= ~counter~0 0)} #92#return; {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:43,457 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-28 05:57:43,458 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-28 05:57:43,459 INFO L290 TraceCheckUtils]: 18: Hoare triple {426#(<= |main_#t~post6| 0)} assume !(#t~post6 < 5);havoc #t~post6; {370#false} is VALID [2022-04-28 05:57:43,459 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-28 05:57:43,459 INFO L290 TraceCheckUtils]: 20: Hoare triple {370#false} ~cond := #in~cond; {370#false} is VALID [2022-04-28 05:57:43,459 INFO L290 TraceCheckUtils]: 21: Hoare triple {370#false} assume 0 == ~cond; {370#false} is VALID [2022-04-28 05:57:43,459 INFO L290 TraceCheckUtils]: 22: Hoare triple {370#false} assume !false; {370#false} is VALID [2022-04-28 05:57:43,460 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-28 05:57:43,460 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:57:43,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:57:43,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045030149] [2022-04-28 05:57:43,460 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:57:43,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395723196] [2022-04-28 05:57:43,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395723196] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:57:43,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:57:43,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 05:57:43,461 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:57:43,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1490093726] [2022-04-28 05:57:43,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1490093726] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:57:43,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:57:43,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 05:57:43,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129414681] [2022-04-28 05:57:43,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:57:43,463 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-28 05:57:43,463 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:57:43,463 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-28 05:57:43,494 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-28 05:57:43,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 05:57:43,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:43,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 05:57:43,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 05:57:43,496 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-28 05:57:43,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:43,593 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-28 05:57:43,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 05:57:43,593 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-28 05:57:43,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:57:43,594 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-28 05:57:43,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-28 05:57:43,601 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-28 05:57:43,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-28 05:57:43,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2022-04-28 05:57:43,648 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-28 05:57:43,650 INFO L225 Difference]: With dead ends: 41 [2022-04-28 05:57:43,650 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 05:57:43,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 05:57:43,652 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:57:43,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:57:43,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 05:57:43,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-28 05:57:43,666 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:57:43,667 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-28 05:57:43,667 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-28 05:57:43,668 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-28 05:57:43,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:43,670 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-28 05:57:43,670 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-28 05:57:43,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:43,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:43,671 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-28 05:57:43,672 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-28 05:57:43,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:43,674 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-28 05:57:43,674 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-28 05:57:43,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:43,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:43,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:57:43,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:57:43,676 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-28 05:57:43,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-04-28 05:57:43,677 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 23 [2022-04-28 05:57:43,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:57:43,678 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-04-28 05:57:43,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:57:43,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 43 transitions. [2022-04-28 05:57:43,723 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-28 05:57:43,723 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-28 05:57:43,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 05:57:43,725 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:57:43,725 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:57:43,748 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-28 05:57:43,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-28 05:57:43,948 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:57:43,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:57:43,948 INFO L85 PathProgramCache]: Analyzing trace with hash -153938307, now seen corresponding path program 1 times [2022-04-28 05:57:43,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:43,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1773930688] [2022-04-28 05:57:43,949 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:57:43,949 INFO L85 PathProgramCache]: Analyzing trace with hash -153938307, now seen corresponding path program 2 times [2022-04-28 05:57:43,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:57:43,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663094365] [2022-04-28 05:57:43,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:57:43,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:57:43,964 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:57:43,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1633877612] [2022-04-28 05:57:43,964 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:57:43,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:43,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:57:43,966 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-28 05:57:43,969 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-28 05:57:44,022 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 05:57:44,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:57:44,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 05:57:44,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:57:44,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:57:47,513 INFO L272 TraceCheckUtils]: 0: Hoare triple {659#true} call ULTIMATE.init(); {659#true} is VALID [2022-04-28 05:57:47,514 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-28 05:57:47,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-28 05:57:47,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {659#true} {659#true} #102#return; {659#true} is VALID [2022-04-28 05:57:47,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {659#true} call #t~ret9 := main(); {659#true} is VALID [2022-04-28 05:57:47,515 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-28 05:57:47,515 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-28 05:57:47,515 INFO L290 TraceCheckUtils]: 7: Hoare triple {659#true} ~cond := #in~cond; {659#true} is VALID [2022-04-28 05:57:47,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {659#true} assume !(0 == ~cond); {659#true} is VALID [2022-04-28 05:57:47,515 INFO L290 TraceCheckUtils]: 9: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-28 05:57:47,516 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {659#true} {659#true} #90#return; {659#true} is VALID [2022-04-28 05:57:47,516 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-28 05:57:47,516 INFO L290 TraceCheckUtils]: 12: Hoare triple {659#true} ~cond := #in~cond; {659#true} is VALID [2022-04-28 05:57:47,516 INFO L290 TraceCheckUtils]: 13: Hoare triple {659#true} assume !(0 == ~cond); {659#true} is VALID [2022-04-28 05:57:47,516 INFO L290 TraceCheckUtils]: 14: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-28 05:57:47,517 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {659#true} {659#true} #92#return; {659#true} is VALID [2022-04-28 05:57:49,518 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-28 05:57:49,519 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-28 05:57:49,520 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-28 05:57:51,523 WARN 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 UNKNOWN [2022-04-28 05:57:51,524 INFO L290 TraceCheckUtils]: 20: Hoare triple {722#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {726#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:57:51,525 INFO L290 TraceCheckUtils]: 21: Hoare triple {726#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {660#false} is VALID [2022-04-28 05:57:51,525 INFO L290 TraceCheckUtils]: 22: Hoare triple {660#false} assume !false; {660#false} is VALID [2022-04-28 05:57:51,525 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-28 05:57:51,525 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:57:51,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:57:51,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663094365] [2022-04-28 05:57:51,526 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:57:51,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633877612] [2022-04-28 05:57:51,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633877612] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:57:51,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:57:51,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:57:51,527 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:57:51,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1773930688] [2022-04-28 05:57:51,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1773930688] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:57:51,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:57:51,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:57:51,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034777760] [2022-04-28 05:57:51,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:57:51,528 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-28 05:57:51,528 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:57:51,529 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-28 05:57:53,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 19 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:53,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 05:57:53,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:53,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 05:57:53,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 05:57:53,772 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-28 05:57:55,074 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 05:57:58,849 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-28 05:58:01,897 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-28 05:58:05,020 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 05:58:10,981 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 05:58:11,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:11,100 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-28 05:58:11,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 05:58:11,100 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-28 05:58:11,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:58:11,101 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-28 05:58:11,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-28 05:58:11,103 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-28 05:58:11,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-28 05:58:11,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 68 transitions. [2022-04-28 05:58:17,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 66 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:17,165 INFO L225 Difference]: With dead ends: 53 [2022-04-28 05:58:17,166 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 05:58:17,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 05:58:17,167 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 16 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-28 05:58:17,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 116 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 1 Unknown, 0 Unchecked, 9.5s Time] [2022-04-28 05:58:17,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 05:58:17,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-28 05:58:17,190 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:58:17,191 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-28 05:58:17,191 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-28 05:58:17,192 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-28 05:58:17,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:17,195 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-28 05:58:17,195 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-28 05:58:17,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:17,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:17,196 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-28 05:58:17,197 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-28 05:58:17,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:17,200 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-28 05:58:17,200 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-28 05:58:17,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:17,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:17,201 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:58:17,201 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:58:17,201 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-28 05:58:17,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2022-04-28 05:58:17,204 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 67 transitions. Word has length 23 [2022-04-28 05:58:17,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:58:17,204 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-04-28 05:58:17,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 05:58:17,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 67 transitions. [2022-04-28 05:58:22,724 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-28 05:58:22,724 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2022-04-28 05:58:22,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 05:58:22,725 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:58:22,725 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:58:22,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 05:58:22,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:22,926 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:58:22,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:58:22,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1676885497, now seen corresponding path program 1 times [2022-04-28 05:58:22,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:22,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1123425336] [2022-04-28 05:58:22,927 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:58:22,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1676885497, now seen corresponding path program 2 times [2022-04-28 05:58:22,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:58:22,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896133417] [2022-04-28 05:58:22,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:58:22,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:58:22,951 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:58:22,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1668971787] [2022-04-28 05:58:22,951 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:58:22,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:22,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:58:22,959 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-28 05:58:22,961 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-28 05:58:23,011 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:58:23,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:58:23,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 05:58:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:58:23,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:58:23,262 INFO L272 TraceCheckUtils]: 0: Hoare triple {1042#true} call ULTIMATE.init(); {1042#true} is VALID [2022-04-28 05:58:23,262 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-28 05:58:23,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-28 05:58:23,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1042#true} {1042#true} #102#return; {1042#true} is VALID [2022-04-28 05:58:23,263 INFO L272 TraceCheckUtils]: 4: Hoare triple {1042#true} call #t~ret9 := main(); {1042#true} is VALID [2022-04-28 05:58:23,263 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-28 05:58:23,263 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-28 05:58:23,263 INFO L290 TraceCheckUtils]: 7: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-28 05:58:23,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-28 05:58:23,264 INFO L290 TraceCheckUtils]: 9: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-28 05:58:23,264 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1042#true} {1042#true} #90#return; {1042#true} is VALID [2022-04-28 05:58:23,264 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-28 05:58:23,264 INFO L290 TraceCheckUtils]: 12: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-28 05:58:23,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-28 05:58:23,265 INFO L290 TraceCheckUtils]: 14: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-28 05:58:23,265 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1042#true} {1042#true} #92#return; {1042#true} is VALID [2022-04-28 05:58:23,265 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-28 05:58:23,265 INFO L290 TraceCheckUtils]: 17: Hoare triple {1042#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1042#true} is VALID [2022-04-28 05:58:23,265 INFO L290 TraceCheckUtils]: 18: Hoare triple {1042#true} assume !!(#t~post6 < 5);havoc #t~post6; {1042#true} is VALID [2022-04-28 05:58:23,265 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-28 05:58:23,266 INFO L290 TraceCheckUtils]: 20: Hoare triple {1042#true} ~cond := #in~cond; {1107#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:58:23,267 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-28 05:58:23,267 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-28 05:58:23,268 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-28 05:58:23,269 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-28 05:58:23,270 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-28 05:58:23,270 INFO L290 TraceCheckUtils]: 26: Hoare triple {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1130#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:58:23,271 INFO L290 TraceCheckUtils]: 27: Hoare triple {1130#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1043#false} is VALID [2022-04-28 05:58:23,271 INFO L290 TraceCheckUtils]: 28: Hoare triple {1043#false} assume !false; {1043#false} is VALID [2022-04-28 05:58:23,271 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-28 05:58:23,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:58:23,703 INFO L290 TraceCheckUtils]: 28: Hoare triple {1043#false} assume !false; {1043#false} is VALID [2022-04-28 05:58:23,704 INFO L290 TraceCheckUtils]: 27: Hoare triple {1130#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1043#false} is VALID [2022-04-28 05:58:23,704 INFO L290 TraceCheckUtils]: 26: Hoare triple {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1130#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:58:23,705 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-28 05:58:23,706 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-28 05:58:23,707 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-28 05:58:23,707 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-28 05:58:23,708 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-28 05:58:23,708 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-28 05:58:23,709 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-28 05:58:23,709 INFO L290 TraceCheckUtils]: 18: Hoare triple {1042#true} assume !!(#t~post6 < 5);havoc #t~post6; {1042#true} is VALID [2022-04-28 05:58:23,709 INFO L290 TraceCheckUtils]: 17: Hoare triple {1042#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1042#true} is VALID [2022-04-28 05:58:23,709 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-28 05:58:23,709 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1042#true} {1042#true} #92#return; {1042#true} is VALID [2022-04-28 05:58:23,710 INFO L290 TraceCheckUtils]: 14: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-28 05:58:23,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-28 05:58:23,710 INFO L290 TraceCheckUtils]: 12: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-28 05:58:23,710 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-28 05:58:23,710 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1042#true} {1042#true} #90#return; {1042#true} is VALID [2022-04-28 05:58:23,710 INFO L290 TraceCheckUtils]: 9: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-28 05:58:23,711 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-28 05:58:23,711 INFO L290 TraceCheckUtils]: 7: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-28 05:58:23,711 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-28 05:58:23,711 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-28 05:58:23,711 INFO L272 TraceCheckUtils]: 4: Hoare triple {1042#true} call #t~ret9 := main(); {1042#true} is VALID [2022-04-28 05:58:23,711 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1042#true} {1042#true} #102#return; {1042#true} is VALID [2022-04-28 05:58:23,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-28 05:58:23,712 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-28 05:58:23,712 INFO L272 TraceCheckUtils]: 0: Hoare triple {1042#true} call ULTIMATE.init(); {1042#true} is VALID [2022-04-28 05:58:23,712 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-28 05:58:23,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:58:23,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896133417] [2022-04-28 05:58:23,713 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:58:23,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668971787] [2022-04-28 05:58:23,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668971787] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:58:23,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:58:23,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-28 05:58:23,713 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:58:23,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1123425336] [2022-04-28 05:58:23,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1123425336] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:58:23,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:58:23,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 05:58:23,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125057569] [2022-04-28 05:58:23,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:58:23,715 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-28 05:58:23,715 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:58:23,715 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-28 05:58:23,735 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-28 05:58:23,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 05:58:23,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:23,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 05:58:23,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 05:58:23,736 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-28 05:58:24,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:24,166 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2022-04-28 05:58:24,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 05:58:24,166 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-28 05:58:24,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:58:24,167 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-28 05:58:24,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-28 05:58:24,169 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-28 05:58:24,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-28 05:58:24,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-28 05:58:24,219 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-28 05:58:24,221 INFO L225 Difference]: With dead ends: 57 [2022-04-28 05:58:24,222 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 05:58:24,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-28 05:58:24,223 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 25 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-28 05:58:24,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 135 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 05:58:24,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 05:58:24,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 36. [2022-04-28 05:58:24,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:58:24,256 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-28 05:58:24,256 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-28 05:58:24,256 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-28 05:58:24,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:24,262 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-28 05:58:24,263 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-28 05:58:24,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:24,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:24,267 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-28 05:58:24,269 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-28 05:58:24,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:24,274 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-28 05:58:24,274 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-28 05:58:24,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:24,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:24,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:58:24,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:58:24,275 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-28 05:58:24,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-04-28 05:58:24,277 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 29 [2022-04-28 05:58:24,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:58:24,277 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-04-28 05:58:24,278 INFO L496 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-28 05:58:24,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 43 transitions. [2022-04-28 05:58:26,338 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 42 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:26,339 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-28 05:58:26,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 05:58:26,339 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:58:26,339 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:58:26,363 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-28 05:58:26,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:26,540 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:58:26,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:58:26,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1154059858, now seen corresponding path program 1 times [2022-04-28 05:58:26,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:26,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [105903883] [2022-04-28 05:58:26,541 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:58:26,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1154059858, now seen corresponding path program 2 times [2022-04-28 05:58:26,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:58:26,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275612356] [2022-04-28 05:58:26,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:58:26,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:58:26,554 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:58:26,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [465228490] [2022-04-28 05:58:26,555 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:58:26,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:26,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:58:26,556 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-28 05:58:26,564 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-28 05:58:26,744 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:58:26,744 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:58:26,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 05:58:26,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:58:26,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:58:26,975 INFO L272 TraceCheckUtils]: 0: Hoare triple {1521#true} call ULTIMATE.init(); {1521#true} is VALID [2022-04-28 05:58:26,976 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-28 05:58:26,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {1529#(<= ~counter~0 0)} assume true; {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:26,977 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1529#(<= ~counter~0 0)} {1521#true} #102#return; {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:26,978 INFO L272 TraceCheckUtils]: 4: Hoare triple {1529#(<= ~counter~0 0)} call #t~ret9 := main(); {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:26,978 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-28 05:58:26,979 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-28 05:58:26,980 INFO L290 TraceCheckUtils]: 7: Hoare triple {1529#(<= ~counter~0 0)} ~cond := #in~cond; {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:26,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {1529#(<= ~counter~0 0)} assume !(0 == ~cond); {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:26,980 INFO L290 TraceCheckUtils]: 9: Hoare triple {1529#(<= ~counter~0 0)} assume true; {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:26,981 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1529#(<= ~counter~0 0)} {1529#(<= ~counter~0 0)} #90#return; {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:26,982 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-28 05:58:26,982 INFO L290 TraceCheckUtils]: 12: Hoare triple {1529#(<= ~counter~0 0)} ~cond := #in~cond; {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:26,983 INFO L290 TraceCheckUtils]: 13: Hoare triple {1529#(<= ~counter~0 0)} assume !(0 == ~cond); {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:26,983 INFO L290 TraceCheckUtils]: 14: Hoare triple {1529#(<= ~counter~0 0)} assume true; {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:26,984 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1529#(<= ~counter~0 0)} {1529#(<= ~counter~0 0)} #92#return; {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:26,984 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-28 05:58:26,985 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-28 05:58:26,986 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-28 05:58:26,986 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-28 05:58:26,987 INFO L290 TraceCheckUtils]: 20: Hoare triple {1578#(<= ~counter~0 1)} ~cond := #in~cond; {1578#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:26,987 INFO L290 TraceCheckUtils]: 21: Hoare triple {1578#(<= ~counter~0 1)} assume !(0 == ~cond); {1578#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:26,988 INFO L290 TraceCheckUtils]: 22: Hoare triple {1578#(<= ~counter~0 1)} assume true; {1578#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:26,989 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1578#(<= ~counter~0 1)} {1578#(<= ~counter~0 1)} #94#return; {1578#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:26,989 INFO L290 TraceCheckUtils]: 24: Hoare triple {1578#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1578#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:26,990 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-28 05:58:26,990 INFO L290 TraceCheckUtils]: 26: Hoare triple {1603#(<= |main_#t~post7| 1)} assume !(#t~post7 < 5);havoc #t~post7; {1522#false} is VALID [2022-04-28 05:58:26,990 INFO L290 TraceCheckUtils]: 27: Hoare triple {1522#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {1522#false} is VALID [2022-04-28 05:58:26,991 INFO L290 TraceCheckUtils]: 28: Hoare triple {1522#false} assume !(#t~post8 < 5);havoc #t~post8; {1522#false} is VALID [2022-04-28 05:58:26,991 INFO L290 TraceCheckUtils]: 29: Hoare triple {1522#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1522#false} is VALID [2022-04-28 05:58:26,991 INFO L290 TraceCheckUtils]: 30: Hoare triple {1522#false} assume !(#t~post6 < 5);havoc #t~post6; {1522#false} is VALID [2022-04-28 05:58:26,991 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-28 05:58:26,991 INFO L290 TraceCheckUtils]: 32: Hoare triple {1522#false} ~cond := #in~cond; {1522#false} is VALID [2022-04-28 05:58:26,991 INFO L290 TraceCheckUtils]: 33: Hoare triple {1522#false} assume 0 == ~cond; {1522#false} is VALID [2022-04-28 05:58:26,991 INFO L290 TraceCheckUtils]: 34: Hoare triple {1522#false} assume !false; {1522#false} is VALID [2022-04-28 05:58:26,992 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-28 05:58:26,992 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:58:26,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:58:26,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275612356] [2022-04-28 05:58:26,992 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:58:26,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465228490] [2022-04-28 05:58:26,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465228490] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:58:26,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:58:26,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:58:26,993 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:58:26,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [105903883] [2022-04-28 05:58:26,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [105903883] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:58:26,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:58:26,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:58:26,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800447756] [2022-04-28 05:58:26,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:58:26,994 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-28 05:58:26,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:58:26,994 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-28 05:58:27,025 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-28 05:58:27,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 05:58:27,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:27,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 05:58:27,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 05:58:27,026 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-28 05:58:27,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:27,166 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2022-04-28 05:58:27,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 05:58:27,167 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-28 05:58:27,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:58:27,167 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-28 05:58:27,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-28 05:58:27,169 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-28 05:58:27,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-28 05:58:27,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 77 transitions. [2022-04-28 05:58:27,235 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-28 05:58:27,237 INFO L225 Difference]: With dead ends: 65 [2022-04-28 05:58:27,237 INFO L226 Difference]: Without dead ends: 44 [2022-04-28 05:58:27,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 05:58:27,238 INFO L413 NwaCegarLoop]: 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-28 05:58:27,238 INFO L414 NwaCegarLoop]: 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-28 05:58:27,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-28 05:58:27,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-28 05:58:27,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:58:27,270 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-28 05:58:27,270 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-28 05:58:27,270 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-28 05:58:27,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:27,272 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-28 05:58:27,272 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-28 05:58:27,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:27,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:27,273 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-28 05:58:27,273 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-28 05:58:27,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:27,275 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-28 05:58:27,275 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-28 05:58:27,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:27,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:27,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:58:27,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:58:27,276 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-28 05:58:27,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-04-28 05:58:27,278 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 35 [2022-04-28 05:58:27,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:58:27,278 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-04-28 05:58:27,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 05:58:27,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 51 transitions. [2022-04-28 05:58:27,556 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-28 05:58:27,556 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-28 05:58:27,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 05:58:27,557 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:58:27,557 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:58:27,564 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-28 05:58:27,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:27,758 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:58:27,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:58:27,759 INFO L85 PathProgramCache]: Analyzing trace with hash -174895632, now seen corresponding path program 1 times [2022-04-28 05:58:27,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:27,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [60337466] [2022-04-28 05:58:27,759 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:58:27,759 INFO L85 PathProgramCache]: Analyzing trace with hash -174895632, now seen corresponding path program 2 times [2022-04-28 05:58:27,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:58:27,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983563802] [2022-04-28 05:58:27,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:58:27,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:58:27,773 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:58:27,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1388226840] [2022-04-28 05:58:27,774 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:58:27,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:27,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:58:27,778 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-28 05:58:27,779 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-28 05:58:27,820 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:58:27,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:58:27,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 05:58:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:58:27,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:58:28,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {1936#true} call ULTIMATE.init(); {1936#true} is VALID [2022-04-28 05:58:28,043 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-28 05:58:28,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {1944#(<= ~counter~0 0)} assume true; {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:28,044 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1944#(<= ~counter~0 0)} {1936#true} #102#return; {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:28,045 INFO L272 TraceCheckUtils]: 4: Hoare triple {1944#(<= ~counter~0 0)} call #t~ret9 := main(); {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:28,045 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-28 05:58:28,046 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-28 05:58:28,046 INFO L290 TraceCheckUtils]: 7: Hoare triple {1944#(<= ~counter~0 0)} ~cond := #in~cond; {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:28,047 INFO L290 TraceCheckUtils]: 8: Hoare triple {1944#(<= ~counter~0 0)} assume !(0 == ~cond); {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:28,047 INFO L290 TraceCheckUtils]: 9: Hoare triple {1944#(<= ~counter~0 0)} assume true; {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:28,055 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1944#(<= ~counter~0 0)} {1944#(<= ~counter~0 0)} #90#return; {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:28,056 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-28 05:58:28,057 INFO L290 TraceCheckUtils]: 12: Hoare triple {1944#(<= ~counter~0 0)} ~cond := #in~cond; {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:28,057 INFO L290 TraceCheckUtils]: 13: Hoare triple {1944#(<= ~counter~0 0)} assume !(0 == ~cond); {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:28,057 INFO L290 TraceCheckUtils]: 14: Hoare triple {1944#(<= ~counter~0 0)} assume true; {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:28,058 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1944#(<= ~counter~0 0)} {1944#(<= ~counter~0 0)} #92#return; {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:28,058 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-28 05:58:28,059 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-28 05:58:28,060 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-28 05:58:28,060 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-28 05:58:28,061 INFO L290 TraceCheckUtils]: 20: Hoare triple {1993#(<= ~counter~0 1)} ~cond := #in~cond; {1993#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:28,061 INFO L290 TraceCheckUtils]: 21: Hoare triple {1993#(<= ~counter~0 1)} assume !(0 == ~cond); {1993#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:28,062 INFO L290 TraceCheckUtils]: 22: Hoare triple {1993#(<= ~counter~0 1)} assume true; {1993#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:28,062 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1993#(<= ~counter~0 1)} {1993#(<= ~counter~0 1)} #94#return; {1993#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:28,063 INFO L290 TraceCheckUtils]: 24: Hoare triple {1993#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1993#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:28,063 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-28 05:58:28,064 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-28 05:58:28,065 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-28 05:58:28,065 INFO L290 TraceCheckUtils]: 28: Hoare triple {2018#(<= ~counter~0 2)} ~cond := #in~cond; {2018#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:28,065 INFO L290 TraceCheckUtils]: 29: Hoare triple {2018#(<= ~counter~0 2)} assume !(0 == ~cond); {2018#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:28,066 INFO L290 TraceCheckUtils]: 30: Hoare triple {2018#(<= ~counter~0 2)} assume true; {2018#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:28,067 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2018#(<= ~counter~0 2)} {2018#(<= ~counter~0 2)} #96#return; {2018#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:28,067 INFO L290 TraceCheckUtils]: 32: Hoare triple {2018#(<= ~counter~0 2)} assume !(~r~0 > 0); {2018#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:28,067 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-28 05:58:28,068 INFO L290 TraceCheckUtils]: 34: Hoare triple {2043#(<= |main_#t~post8| 2)} assume !(#t~post8 < 5);havoc #t~post8; {1937#false} is VALID [2022-04-28 05:58:28,068 INFO L290 TraceCheckUtils]: 35: Hoare triple {1937#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1937#false} is VALID [2022-04-28 05:58:28,068 INFO L290 TraceCheckUtils]: 36: Hoare triple {1937#false} assume !(#t~post6 < 5);havoc #t~post6; {1937#false} is VALID [2022-04-28 05:58:28,068 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-28 05:58:28,069 INFO L290 TraceCheckUtils]: 38: Hoare triple {1937#false} ~cond := #in~cond; {1937#false} is VALID [2022-04-28 05:58:28,069 INFO L290 TraceCheckUtils]: 39: Hoare triple {1937#false} assume 0 == ~cond; {1937#false} is VALID [2022-04-28 05:58:28,069 INFO L290 TraceCheckUtils]: 40: Hoare triple {1937#false} assume !false; {1937#false} is VALID [2022-04-28 05:58:28,069 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-28 05:58:28,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:58:28,318 INFO L290 TraceCheckUtils]: 40: Hoare triple {1937#false} assume !false; {1937#false} is VALID [2022-04-28 05:58:28,319 INFO L290 TraceCheckUtils]: 39: Hoare triple {1937#false} assume 0 == ~cond; {1937#false} is VALID [2022-04-28 05:58:28,319 INFO L290 TraceCheckUtils]: 38: Hoare triple {1937#false} ~cond := #in~cond; {1937#false} is VALID [2022-04-28 05:58:28,319 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-28 05:58:28,319 INFO L290 TraceCheckUtils]: 36: Hoare triple {1937#false} assume !(#t~post6 < 5);havoc #t~post6; {1937#false} is VALID [2022-04-28 05:58:28,319 INFO L290 TraceCheckUtils]: 35: Hoare triple {1937#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1937#false} is VALID [2022-04-28 05:58:28,321 INFO L290 TraceCheckUtils]: 34: Hoare triple {2083#(< |main_#t~post8| 5)} assume !(#t~post8 < 5);havoc #t~post8; {1937#false} is VALID [2022-04-28 05:58:28,321 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-28 05:58:28,322 INFO L290 TraceCheckUtils]: 32: Hoare triple {2087#(< ~counter~0 5)} assume !(~r~0 > 0); {2087#(< ~counter~0 5)} is VALID [2022-04-28 05:58:28,322 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1936#true} {2087#(< ~counter~0 5)} #96#return; {2087#(< ~counter~0 5)} is VALID [2022-04-28 05:58:28,322 INFO L290 TraceCheckUtils]: 30: Hoare triple {1936#true} assume true; {1936#true} is VALID [2022-04-28 05:58:28,323 INFO L290 TraceCheckUtils]: 29: Hoare triple {1936#true} assume !(0 == ~cond); {1936#true} is VALID [2022-04-28 05:58:28,323 INFO L290 TraceCheckUtils]: 28: Hoare triple {1936#true} ~cond := #in~cond; {1936#true} is VALID [2022-04-28 05:58:28,323 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-28 05:58:28,323 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-28 05:58:28,324 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-28 05:58:28,324 INFO L290 TraceCheckUtils]: 24: Hoare triple {2112#(< ~counter~0 4)} assume !!(0 != ~r~0); {2112#(< ~counter~0 4)} is VALID [2022-04-28 05:58:28,325 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1936#true} {2112#(< ~counter~0 4)} #94#return; {2112#(< ~counter~0 4)} is VALID [2022-04-28 05:58:28,325 INFO L290 TraceCheckUtils]: 22: Hoare triple {1936#true} assume true; {1936#true} is VALID [2022-04-28 05:58:28,325 INFO L290 TraceCheckUtils]: 21: Hoare triple {1936#true} assume !(0 == ~cond); {1936#true} is VALID [2022-04-28 05:58:28,325 INFO L290 TraceCheckUtils]: 20: Hoare triple {1936#true} ~cond := #in~cond; {1936#true} is VALID [2022-04-28 05:58:28,325 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-28 05:58:28,325 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-28 05:58:28,326 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-28 05:58:28,326 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-28 05:58:28,327 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1936#true} {2018#(<= ~counter~0 2)} #92#return; {2018#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:28,327 INFO L290 TraceCheckUtils]: 14: Hoare triple {1936#true} assume true; {1936#true} is VALID [2022-04-28 05:58:28,327 INFO L290 TraceCheckUtils]: 13: Hoare triple {1936#true} assume !(0 == ~cond); {1936#true} is VALID [2022-04-28 05:58:28,327 INFO L290 TraceCheckUtils]: 12: Hoare triple {1936#true} ~cond := #in~cond; {1936#true} is VALID [2022-04-28 05:58:28,327 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-28 05:58:28,327 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1936#true} {2018#(<= ~counter~0 2)} #90#return; {2018#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:28,328 INFO L290 TraceCheckUtils]: 9: Hoare triple {1936#true} assume true; {1936#true} is VALID [2022-04-28 05:58:28,328 INFO L290 TraceCheckUtils]: 8: Hoare triple {1936#true} assume !(0 == ~cond); {1936#true} is VALID [2022-04-28 05:58:28,328 INFO L290 TraceCheckUtils]: 7: Hoare triple {1936#true} ~cond := #in~cond; {1936#true} is VALID [2022-04-28 05:58:28,328 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-28 05:58:28,328 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-28 05:58:28,329 INFO L272 TraceCheckUtils]: 4: Hoare triple {2018#(<= ~counter~0 2)} call #t~ret9 := main(); {2018#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:28,329 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2018#(<= ~counter~0 2)} {1936#true} #102#return; {2018#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:28,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {2018#(<= ~counter~0 2)} assume true; {2018#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:28,330 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-28 05:58:28,331 INFO L272 TraceCheckUtils]: 0: Hoare triple {1936#true} call ULTIMATE.init(); {1936#true} is VALID [2022-04-28 05:58:28,331 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-28 05:58:28,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:58:28,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983563802] [2022-04-28 05:58:28,331 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:58:28,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388226840] [2022-04-28 05:58:28,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388226840] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 05:58:28,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 05:58:28,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2022-04-28 05:58:28,332 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:58:28,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [60337466] [2022-04-28 05:58:28,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [60337466] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:58:28,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:58:28,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 05:58:28,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126926579] [2022-04-28 05:58:28,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:58:28,333 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-28 05:58:28,333 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:58:28,334 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-28 05:58:28,368 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-28 05:58:28,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 05:58:28,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:28,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 05:58:28,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-28 05:58:28,369 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-28 05:58:28,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:28,571 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2022-04-28 05:58:28,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 05:58:28,571 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-28 05:58:28,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:58:28,571 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-28 05:58:28,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-28 05:58:28,573 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-28 05:58:28,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-28 05:58:28,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 87 transitions. [2022-04-28 05:58:28,668 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-28 05:58:28,669 INFO L225 Difference]: With dead ends: 74 [2022-04-28 05:58:28,669 INFO L226 Difference]: Without dead ends: 53 [2022-04-28 05:58:28,669 INFO L412 NwaCegarLoop]: 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-28 05:58:28,670 INFO L413 NwaCegarLoop]: 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-28 05:58:28,670 INFO L414 NwaCegarLoop]: 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-28 05:58:28,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-28 05:58:28,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-04-28 05:58:28,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:58:28,725 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-28 05:58:28,725 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-28 05:58:28,726 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-28 05:58:28,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:28,727 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-28 05:58:28,727 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-28 05:58:28,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:28,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:28,728 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-28 05:58:28,728 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-28 05:58:28,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:28,730 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-28 05:58:28,730 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-28 05:58:28,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:28,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:28,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:58:28,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:58:28,731 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-28 05:58:28,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2022-04-28 05:58:28,732 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 41 [2022-04-28 05:58:28,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:58:28,733 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2022-04-28 05:58:28,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 05:58:28,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 60 transitions. [2022-04-28 05:58:29,279 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-28 05:58:29,279 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2022-04-28 05:58:29,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 05:58:29,279 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:58:29,280 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:58:29,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-28 05:58:29,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:29,491 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:58:29,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:58:29,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1292932747, now seen corresponding path program 1 times [2022-04-28 05:58:29,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:29,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [718462118] [2022-04-28 05:58:29,492 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:58:29,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1292932747, now seen corresponding path program 2 times [2022-04-28 05:58:29,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:58:29,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264202335] [2022-04-28 05:58:29,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:58:29,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:58:29,509 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:58:29,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [456238184] [2022-04-28 05:58:29,509 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:58:29,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:29,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:58:29,510 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-28 05:58:29,522 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-28 05:58:29,562 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:58:29,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:58:29,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 05:58:29,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:58:29,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:58:29,801 INFO L272 TraceCheckUtils]: 0: Hoare triple {2548#true} call ULTIMATE.init(); {2548#true} is VALID [2022-04-28 05:58:29,802 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-28 05:58:29,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {2556#(<= ~counter~0 0)} assume true; {2556#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:29,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2556#(<= ~counter~0 0)} {2548#true} #102#return; {2556#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:29,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {2556#(<= ~counter~0 0)} call #t~ret9 := main(); {2556#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:29,806 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-28 05:58:29,808 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-28 05:58:29,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {2556#(<= ~counter~0 0)} ~cond := #in~cond; {2556#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:29,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {2556#(<= ~counter~0 0)} assume !(0 == ~cond); {2556#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:29,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {2556#(<= ~counter~0 0)} assume true; {2556#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:29,810 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2556#(<= ~counter~0 0)} {2556#(<= ~counter~0 0)} #90#return; {2556#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:29,815 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-28 05:58:29,815 INFO L290 TraceCheckUtils]: 12: Hoare triple {2556#(<= ~counter~0 0)} ~cond := #in~cond; {2556#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:29,815 INFO L290 TraceCheckUtils]: 13: Hoare triple {2556#(<= ~counter~0 0)} assume !(0 == ~cond); {2556#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:29,816 INFO L290 TraceCheckUtils]: 14: Hoare triple {2556#(<= ~counter~0 0)} assume true; {2556#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:29,816 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2556#(<= ~counter~0 0)} {2556#(<= ~counter~0 0)} #92#return; {2556#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:29,817 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-28 05:58:29,817 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-28 05:58:29,818 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-28 05:58:29,818 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-28 05:58:29,819 INFO L290 TraceCheckUtils]: 20: Hoare triple {2605#(<= ~counter~0 1)} ~cond := #in~cond; {2605#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:29,819 INFO L290 TraceCheckUtils]: 21: Hoare triple {2605#(<= ~counter~0 1)} assume !(0 == ~cond); {2605#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:29,820 INFO L290 TraceCheckUtils]: 22: Hoare triple {2605#(<= ~counter~0 1)} assume true; {2605#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:29,820 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2605#(<= ~counter~0 1)} {2605#(<= ~counter~0 1)} #94#return; {2605#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:29,821 INFO L290 TraceCheckUtils]: 24: Hoare triple {2605#(<= ~counter~0 1)} assume !!(0 != ~r~0); {2605#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:29,821 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-28 05:58:29,822 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-28 05:58:29,822 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-28 05:58:29,823 INFO L290 TraceCheckUtils]: 28: Hoare triple {2630#(<= ~counter~0 2)} ~cond := #in~cond; {2630#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:29,823 INFO L290 TraceCheckUtils]: 29: Hoare triple {2630#(<= ~counter~0 2)} assume !(0 == ~cond); {2630#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:29,823 INFO L290 TraceCheckUtils]: 30: Hoare triple {2630#(<= ~counter~0 2)} assume true; {2630#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:29,824 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2630#(<= ~counter~0 2)} {2630#(<= ~counter~0 2)} #96#return; {2630#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:29,824 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-28 05:58:29,825 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-28 05:58:29,825 INFO L290 TraceCheckUtils]: 34: Hoare triple {2655#(<= |main_#t~post7| 2)} assume !(#t~post7 < 5);havoc #t~post7; {2549#false} is VALID [2022-04-28 05:58:29,825 INFO L290 TraceCheckUtils]: 35: Hoare triple {2549#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2549#false} is VALID [2022-04-28 05:58:29,826 INFO L290 TraceCheckUtils]: 36: Hoare triple {2549#false} assume !(#t~post8 < 5);havoc #t~post8; {2549#false} is VALID [2022-04-28 05:58:29,826 INFO L290 TraceCheckUtils]: 37: Hoare triple {2549#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2549#false} is VALID [2022-04-28 05:58:29,826 INFO L290 TraceCheckUtils]: 38: Hoare triple {2549#false} assume !(#t~post6 < 5);havoc #t~post6; {2549#false} is VALID [2022-04-28 05:58:29,826 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-28 05:58:29,826 INFO L290 TraceCheckUtils]: 40: Hoare triple {2549#false} ~cond := #in~cond; {2549#false} is VALID [2022-04-28 05:58:29,826 INFO L290 TraceCheckUtils]: 41: Hoare triple {2549#false} assume 0 == ~cond; {2549#false} is VALID [2022-04-28 05:58:29,826 INFO L290 TraceCheckUtils]: 42: Hoare triple {2549#false} assume !false; {2549#false} is VALID [2022-04-28 05:58:29,827 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-28 05:58:29,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:58:30,065 INFO L290 TraceCheckUtils]: 42: Hoare triple {2549#false} assume !false; {2549#false} is VALID [2022-04-28 05:58:30,066 INFO L290 TraceCheckUtils]: 41: Hoare triple {2549#false} assume 0 == ~cond; {2549#false} is VALID [2022-04-28 05:58:30,066 INFO L290 TraceCheckUtils]: 40: Hoare triple {2549#false} ~cond := #in~cond; {2549#false} is VALID [2022-04-28 05:58:30,066 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-28 05:58:30,066 INFO L290 TraceCheckUtils]: 38: Hoare triple {2549#false} assume !(#t~post6 < 5);havoc #t~post6; {2549#false} is VALID [2022-04-28 05:58:30,066 INFO L290 TraceCheckUtils]: 37: Hoare triple {2549#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2549#false} is VALID [2022-04-28 05:58:30,066 INFO L290 TraceCheckUtils]: 36: Hoare triple {2549#false} assume !(#t~post8 < 5);havoc #t~post8; {2549#false} is VALID [2022-04-28 05:58:30,066 INFO L290 TraceCheckUtils]: 35: Hoare triple {2549#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2549#false} is VALID [2022-04-28 05:58:30,066 INFO L290 TraceCheckUtils]: 34: Hoare triple {2707#(< |main_#t~post7| 5)} assume !(#t~post7 < 5);havoc #t~post7; {2549#false} is VALID [2022-04-28 05:58:30,067 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-28 05:58:30,067 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-28 05:58:30,068 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2548#true} {2711#(< ~counter~0 5)} #96#return; {2711#(< ~counter~0 5)} is VALID [2022-04-28 05:58:30,068 INFO L290 TraceCheckUtils]: 30: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-28 05:58:30,068 INFO L290 TraceCheckUtils]: 29: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-28 05:58:30,068 INFO L290 TraceCheckUtils]: 28: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-28 05:58:30,068 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-28 05:58:30,069 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-28 05:58:30,070 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-28 05:58:30,070 INFO L290 TraceCheckUtils]: 24: Hoare triple {2736#(< ~counter~0 4)} assume !!(0 != ~r~0); {2736#(< ~counter~0 4)} is VALID [2022-04-28 05:58:30,071 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2548#true} {2736#(< ~counter~0 4)} #94#return; {2736#(< ~counter~0 4)} is VALID [2022-04-28 05:58:30,071 INFO L290 TraceCheckUtils]: 22: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-28 05:58:30,071 INFO L290 TraceCheckUtils]: 21: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-28 05:58:30,071 INFO L290 TraceCheckUtils]: 20: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-28 05:58:30,071 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-28 05:58:30,071 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-28 05:58:30,072 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-28 05:58:30,072 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-28 05:58:30,073 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2548#true} {2630#(<= ~counter~0 2)} #92#return; {2630#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:30,073 INFO L290 TraceCheckUtils]: 14: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-28 05:58:30,073 INFO L290 TraceCheckUtils]: 13: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-28 05:58:30,073 INFO L290 TraceCheckUtils]: 12: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-28 05:58:30,073 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-28 05:58:30,073 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2548#true} {2630#(<= ~counter~0 2)} #90#return; {2630#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:30,074 INFO L290 TraceCheckUtils]: 9: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-28 05:58:30,074 INFO L290 TraceCheckUtils]: 8: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-28 05:58:30,074 INFO L290 TraceCheckUtils]: 7: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-28 05:58:30,074 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-28 05:58:30,074 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-28 05:58:30,074 INFO L272 TraceCheckUtils]: 4: Hoare triple {2630#(<= ~counter~0 2)} call #t~ret9 := main(); {2630#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:30,075 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2630#(<= ~counter~0 2)} {2548#true} #102#return; {2630#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:30,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {2630#(<= ~counter~0 2)} assume true; {2630#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:30,076 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-28 05:58:30,076 INFO L272 TraceCheckUtils]: 0: Hoare triple {2548#true} call ULTIMATE.init(); {2548#true} is VALID [2022-04-28 05:58:30,076 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-28 05:58:30,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:58:30,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264202335] [2022-04-28 05:58:30,076 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:58:30,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456238184] [2022-04-28 05:58:30,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456238184] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:58:30,076 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:58:30,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-28 05:58:30,077 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:58:30,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [718462118] [2022-04-28 05:58:30,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [718462118] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:58:30,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:58:30,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 05:58:30,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758341206] [2022-04-28 05:58:30,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:58:30,078 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-28 05:58:30,078 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:58:30,078 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-28 05:58:30,105 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-28 05:58:30,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 05:58:30,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:30,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 05:58:30,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-28 05:58:30,106 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-28 05:58:30,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:30,298 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2022-04-28 05:58:30,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 05:58:30,299 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-28 05:58:30,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:58:30,299 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-28 05:58:30,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-04-28 05:58:30,301 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-28 05:58:30,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-04-28 05:58:30,302 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 87 transitions. [2022-04-28 05:58:30,370 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-28 05:58:30,371 INFO L225 Difference]: With dead ends: 75 [2022-04-28 05:58:30,371 INFO L226 Difference]: Without dead ends: 54 [2022-04-28 05:58:30,371 INFO L412 NwaCegarLoop]: 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-28 05:58:30,372 INFO L413 NwaCegarLoop]: 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-28 05:58:30,372 INFO L414 NwaCegarLoop]: 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-28 05:58:30,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-28 05:58:30,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-28 05:58:30,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:58:30,437 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-28 05:58:30,438 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-28 05:58:30,439 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-28 05:58:30,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:30,441 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-28 05:58:30,441 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-04-28 05:58:30,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:30,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:30,441 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-28 05:58:30,442 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-28 05:58:30,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:30,444 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-28 05:58:30,444 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-04-28 05:58:30,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:30,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:30,444 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:58:30,445 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:58:30,445 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-28 05:58:30,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2022-04-28 05:58:30,446 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 43 [2022-04-28 05:58:30,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:58:30,447 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2022-04-28 05:58:30,447 INFO L496 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-28 05:58:30,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 62 transitions. [2022-04-28 05:58:30,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:30,870 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-04-28 05:58:30,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 05:58:30,870 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:58:30,870 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:58:30,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 05:58:31,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:31,076 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:58:31,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:58:31,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1407897436, now seen corresponding path program 1 times [2022-04-28 05:58:31,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:31,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1570755302] [2022-04-28 05:58:31,076 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:58:31,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1407897436, now seen corresponding path program 2 times [2022-04-28 05:58:31,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:58:31,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192139184] [2022-04-28 05:58:31,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:58:31,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:58:31,089 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:58:31,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1385710851] [2022-04-28 05:58:31,099 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:58:31,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:31,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:58:31,101 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-28 05:58:31,113 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-28 05:58:31,165 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:58:31,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:58:31,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-28 05:58:31,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:58:31,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:58:31,353 INFO L272 TraceCheckUtils]: 0: Hoare triple {3182#true} call ULTIMATE.init(); {3182#true} is VALID [2022-04-28 05:58:31,353 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-28 05:58:31,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {3182#true} assume true; {3182#true} is VALID [2022-04-28 05:58:31,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3182#true} {3182#true} #102#return; {3182#true} is VALID [2022-04-28 05:58:31,353 INFO L272 TraceCheckUtils]: 4: Hoare triple {3182#true} call #t~ret9 := main(); {3182#true} is VALID [2022-04-28 05:58:31,353 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-28 05:58:31,354 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-28 05:58:31,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {3182#true} ~cond := #in~cond; {3182#true} is VALID [2022-04-28 05:58:31,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {3182#true} assume !(0 == ~cond); {3182#true} is VALID [2022-04-28 05:58:31,354 INFO L290 TraceCheckUtils]: 9: Hoare triple {3182#true} assume true; {3182#true} is VALID [2022-04-28 05:58:31,354 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3182#true} {3182#true} #90#return; {3182#true} is VALID [2022-04-28 05:58:31,354 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-28 05:58:31,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {3182#true} ~cond := #in~cond; {3182#true} is VALID [2022-04-28 05:58:31,354 INFO L290 TraceCheckUtils]: 13: Hoare triple {3182#true} assume !(0 == ~cond); {3182#true} is VALID [2022-04-28 05:58:31,354 INFO L290 TraceCheckUtils]: 14: Hoare triple {3182#true} assume true; {3182#true} is VALID [2022-04-28 05:58:31,355 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3182#true} {3182#true} #92#return; {3182#true} is VALID [2022-04-28 05:58:31,355 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-28 05:58:31,355 INFO L290 TraceCheckUtils]: 17: Hoare triple {3182#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3182#true} is VALID [2022-04-28 05:58:31,355 INFO L290 TraceCheckUtils]: 18: Hoare triple {3182#true} assume !!(#t~post6 < 5);havoc #t~post6; {3182#true} is VALID [2022-04-28 05:58:31,355 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-28 05:58:31,355 INFO L290 TraceCheckUtils]: 20: Hoare triple {3182#true} ~cond := #in~cond; {3182#true} is VALID [2022-04-28 05:58:31,355 INFO L290 TraceCheckUtils]: 21: Hoare triple {3182#true} assume !(0 == ~cond); {3182#true} is VALID [2022-04-28 05:58:31,355 INFO L290 TraceCheckUtils]: 22: Hoare triple {3182#true} assume true; {3182#true} is VALID [2022-04-28 05:58:31,356 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3182#true} {3182#true} #94#return; {3182#true} is VALID [2022-04-28 05:58:31,363 INFO L290 TraceCheckUtils]: 24: Hoare triple {3182#true} assume !!(0 != ~r~0); {3259#(not (= main_~r~0 0))} is VALID [2022-04-28 05:58:31,363 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-28 05:58:31,364 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-28 05:58:31,364 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-28 05:58:31,364 INFO L290 TraceCheckUtils]: 28: Hoare triple {3182#true} ~cond := #in~cond; {3182#true} is VALID [2022-04-28 05:58:31,364 INFO L290 TraceCheckUtils]: 29: Hoare triple {3182#true} assume !(0 == ~cond); {3182#true} is VALID [2022-04-28 05:58:31,364 INFO L290 TraceCheckUtils]: 30: Hoare triple {3182#true} assume true; {3182#true} is VALID [2022-04-28 05:58:31,365 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-28 05:58:31,365 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-28 05:58:31,366 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-28 05:58:31,366 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-28 05:58:31,367 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-28 05:58:31,367 INFO L290 TraceCheckUtils]: 36: Hoare triple {3182#true} ~cond := #in~cond; {3182#true} is VALID [2022-04-28 05:58:31,367 INFO L290 TraceCheckUtils]: 37: Hoare triple {3182#true} assume !(0 == ~cond); {3182#true} is VALID [2022-04-28 05:58:31,367 INFO L290 TraceCheckUtils]: 38: Hoare triple {3182#true} assume true; {3182#true} is VALID [2022-04-28 05:58:31,368 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-28 05:58:31,368 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-28 05:58:31,368 INFO L290 TraceCheckUtils]: 41: Hoare triple {3183#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3183#false} is VALID [2022-04-28 05:58:31,368 INFO L290 TraceCheckUtils]: 42: Hoare triple {3183#false} assume !(#t~post6 < 5);havoc #t~post6; {3183#false} is VALID [2022-04-28 05:58:31,369 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-28 05:58:31,369 INFO L290 TraceCheckUtils]: 44: Hoare triple {3183#false} ~cond := #in~cond; {3183#false} is VALID [2022-04-28 05:58:31,369 INFO L290 TraceCheckUtils]: 45: Hoare triple {3183#false} assume 0 == ~cond; {3183#false} is VALID [2022-04-28 05:58:31,369 INFO L290 TraceCheckUtils]: 46: Hoare triple {3183#false} assume !false; {3183#false} is VALID [2022-04-28 05:58:31,369 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-28 05:58:31,369 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:58:31,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:58:31,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192139184] [2022-04-28 05:58:31,370 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:58:31,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385710851] [2022-04-28 05:58:31,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385710851] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:58:31,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:58:31,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 05:58:31,370 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:58:31,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1570755302] [2022-04-28 05:58:31,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1570755302] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:58:31,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:58:31,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 05:58:31,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306210703] [2022-04-28 05:58:31,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:58:31,371 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-28 05:58:31,371 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:58:31,371 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-28 05:58:31,399 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-28 05:58:31,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 05:58:31,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:31,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 05:58:31,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-28 05:58:31,400 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-28 05:58:31,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:31,621 INFO L93 Difference]: Finished difference Result 101 states and 131 transitions. [2022-04-28 05:58:31,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 05:58:31,621 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-28 05:58:31,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:58:31,621 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-28 05:58:31,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-28 05:58:31,623 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-28 05:58:31,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-28 05:58:31,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 108 transitions. [2022-04-28 05:58:31,713 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-28 05:58:31,715 INFO L225 Difference]: With dead ends: 101 [2022-04-28 05:58:31,715 INFO L226 Difference]: Without dead ends: 80 [2022-04-28 05:58:31,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-28 05:58:31,716 INFO L413 NwaCegarLoop]: 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-28 05:58:31,716 INFO L414 NwaCegarLoop]: 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-28 05:58:31,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-28 05:58:31,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2022-04-28 05:58:31,785 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:58:31,786 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-28 05:58:31,786 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-28 05:58:31,786 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-28 05:58:31,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:31,789 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2022-04-28 05:58:31,789 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2022-04-28 05:58:31,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:31,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:31,790 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-28 05:58:31,790 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-28 05:58:31,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:31,793 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2022-04-28 05:58:31,793 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2022-04-28 05:58:31,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:31,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:31,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:58:31,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:58:31,794 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-28 05:58:31,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 87 transitions. [2022-04-28 05:58:31,796 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 87 transitions. Word has length 47 [2022-04-28 05:58:31,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:58:31,797 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 87 transitions. [2022-04-28 05:58:31,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 05:58:31,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 87 transitions. [2022-04-28 05:58:33,226 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-28 05:58:33,226 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2022-04-28 05:58:33,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 05:58:33,227 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:58:33,227 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:58:33,250 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-28 05:58:33,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-04-28 05:58:33,427 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:58:33,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:58:33,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1915058849, now seen corresponding path program 1 times [2022-04-28 05:58:33,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:33,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1282313264] [2022-04-28 05:58:33,428 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:58:33,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1915058849, now seen corresponding path program 2 times [2022-04-28 05:58:33,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:58:33,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815926510] [2022-04-28 05:58:33,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:58:33,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:58:33,444 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:58:33,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1070922275] [2022-04-28 05:58:33,444 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:58:33,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:33,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:58:33,447 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-28 05:58:33,468 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-28 05:58:33,493 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:58:33,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:58:33,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 05:58:33,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:58:33,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:58:33,776 INFO L272 TraceCheckUtils]: 0: Hoare triple {3828#true} call ULTIMATE.init(); {3828#true} is VALID [2022-04-28 05:58:33,782 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-28 05:58:33,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {3836#(<= ~counter~0 0)} assume true; {3836#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:33,783 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3836#(<= ~counter~0 0)} {3828#true} #102#return; {3836#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:33,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {3836#(<= ~counter~0 0)} call #t~ret9 := main(); {3836#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:33,784 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-28 05:58:33,784 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-28 05:58:33,785 INFO L290 TraceCheckUtils]: 7: Hoare triple {3836#(<= ~counter~0 0)} ~cond := #in~cond; {3836#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:33,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {3836#(<= ~counter~0 0)} assume !(0 == ~cond); {3836#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:33,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {3836#(<= ~counter~0 0)} assume true; {3836#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:33,786 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3836#(<= ~counter~0 0)} {3836#(<= ~counter~0 0)} #90#return; {3836#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:33,786 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-28 05:58:33,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {3836#(<= ~counter~0 0)} ~cond := #in~cond; {3836#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:33,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {3836#(<= ~counter~0 0)} assume !(0 == ~cond); {3836#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:33,787 INFO L290 TraceCheckUtils]: 14: Hoare triple {3836#(<= ~counter~0 0)} assume true; {3836#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:33,788 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3836#(<= ~counter~0 0)} {3836#(<= ~counter~0 0)} #92#return; {3836#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:33,788 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-28 05:58:33,788 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-28 05:58:33,789 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-28 05:58:33,789 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-28 05:58:33,790 INFO L290 TraceCheckUtils]: 20: Hoare triple {3885#(<= ~counter~0 1)} ~cond := #in~cond; {3885#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:33,790 INFO L290 TraceCheckUtils]: 21: Hoare triple {3885#(<= ~counter~0 1)} assume !(0 == ~cond); {3885#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:33,790 INFO L290 TraceCheckUtils]: 22: Hoare triple {3885#(<= ~counter~0 1)} assume true; {3885#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:33,791 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3885#(<= ~counter~0 1)} {3885#(<= ~counter~0 1)} #94#return; {3885#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:33,791 INFO L290 TraceCheckUtils]: 24: Hoare triple {3885#(<= ~counter~0 1)} assume !!(0 != ~r~0); {3885#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:33,791 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-28 05:58:33,792 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-28 05:58:33,792 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-28 05:58:33,793 INFO L290 TraceCheckUtils]: 28: Hoare triple {3910#(<= ~counter~0 2)} ~cond := #in~cond; {3910#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:33,793 INFO L290 TraceCheckUtils]: 29: Hoare triple {3910#(<= ~counter~0 2)} assume !(0 == ~cond); {3910#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:33,793 INFO L290 TraceCheckUtils]: 30: Hoare triple {3910#(<= ~counter~0 2)} assume true; {3910#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:33,794 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3910#(<= ~counter~0 2)} {3910#(<= ~counter~0 2)} #96#return; {3910#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:33,794 INFO L290 TraceCheckUtils]: 32: Hoare triple {3910#(<= ~counter~0 2)} assume !(~r~0 > 0); {3910#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:33,795 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-28 05:58:33,807 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-28 05:58:33,809 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-28 05:58:33,809 INFO L290 TraceCheckUtils]: 36: Hoare triple {3935#(<= ~counter~0 3)} ~cond := #in~cond; {3935#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:33,809 INFO L290 TraceCheckUtils]: 37: Hoare triple {3935#(<= ~counter~0 3)} assume !(0 == ~cond); {3935#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:33,810 INFO L290 TraceCheckUtils]: 38: Hoare triple {3935#(<= ~counter~0 3)} assume true; {3935#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:33,810 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3935#(<= ~counter~0 3)} {3935#(<= ~counter~0 3)} #98#return; {3935#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:33,811 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-28 05:58:33,811 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-28 05:58:33,811 INFO L290 TraceCheckUtils]: 42: Hoare triple {3960#(<= |main_#t~post8| 3)} assume !(#t~post8 < 5);havoc #t~post8; {3829#false} is VALID [2022-04-28 05:58:33,812 INFO L290 TraceCheckUtils]: 43: Hoare triple {3829#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3829#false} is VALID [2022-04-28 05:58:33,812 INFO L290 TraceCheckUtils]: 44: Hoare triple {3829#false} assume !(#t~post6 < 5);havoc #t~post6; {3829#false} is VALID [2022-04-28 05:58:33,812 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-28 05:58:33,812 INFO L290 TraceCheckUtils]: 46: Hoare triple {3829#false} ~cond := #in~cond; {3829#false} is VALID [2022-04-28 05:58:33,812 INFO L290 TraceCheckUtils]: 47: Hoare triple {3829#false} assume 0 == ~cond; {3829#false} is VALID [2022-04-28 05:58:33,812 INFO L290 TraceCheckUtils]: 48: Hoare triple {3829#false} assume !false; {3829#false} is VALID [2022-04-28 05:58:33,812 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-28 05:58:33,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:58:34,070 INFO L290 TraceCheckUtils]: 48: Hoare triple {3829#false} assume !false; {3829#false} is VALID [2022-04-28 05:58:34,071 INFO L290 TraceCheckUtils]: 47: Hoare triple {3829#false} assume 0 == ~cond; {3829#false} is VALID [2022-04-28 05:58:34,071 INFO L290 TraceCheckUtils]: 46: Hoare triple {3829#false} ~cond := #in~cond; {3829#false} is VALID [2022-04-28 05:58:34,071 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-28 05:58:34,071 INFO L290 TraceCheckUtils]: 44: Hoare triple {3829#false} assume !(#t~post6 < 5);havoc #t~post6; {3829#false} is VALID [2022-04-28 05:58:34,072 INFO L290 TraceCheckUtils]: 43: Hoare triple {3829#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3829#false} is VALID [2022-04-28 05:58:34,072 INFO L290 TraceCheckUtils]: 42: Hoare triple {4000#(< |main_#t~post8| 5)} assume !(#t~post8 < 5);havoc #t~post8; {3829#false} is VALID [2022-04-28 05:58:34,073 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-28 05:58:34,073 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-28 05:58:34,074 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3828#true} {4004#(< ~counter~0 5)} #98#return; {4004#(< ~counter~0 5)} is VALID [2022-04-28 05:58:34,074 INFO L290 TraceCheckUtils]: 38: Hoare triple {3828#true} assume true; {3828#true} is VALID [2022-04-28 05:58:34,074 INFO L290 TraceCheckUtils]: 37: Hoare triple {3828#true} assume !(0 == ~cond); {3828#true} is VALID [2022-04-28 05:58:34,074 INFO L290 TraceCheckUtils]: 36: Hoare triple {3828#true} ~cond := #in~cond; {3828#true} is VALID [2022-04-28 05:58:34,074 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-28 05:58:34,074 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-28 05:58:34,075 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-28 05:58:34,075 INFO L290 TraceCheckUtils]: 32: Hoare triple {3935#(<= ~counter~0 3)} assume !(~r~0 > 0); {3935#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:34,076 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3828#true} {3935#(<= ~counter~0 3)} #96#return; {3935#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:34,076 INFO L290 TraceCheckUtils]: 30: Hoare triple {3828#true} assume true; {3828#true} is VALID [2022-04-28 05:58:34,076 INFO L290 TraceCheckUtils]: 29: Hoare triple {3828#true} assume !(0 == ~cond); {3828#true} is VALID [2022-04-28 05:58:34,077 INFO L290 TraceCheckUtils]: 28: Hoare triple {3828#true} ~cond := #in~cond; {3828#true} is VALID [2022-04-28 05:58:34,077 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-28 05:58:34,077 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-28 05:58:34,078 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-28 05:58:34,078 INFO L290 TraceCheckUtils]: 24: Hoare triple {3910#(<= ~counter~0 2)} assume !!(0 != ~r~0); {3910#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:34,079 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3828#true} {3910#(<= ~counter~0 2)} #94#return; {3910#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:34,079 INFO L290 TraceCheckUtils]: 22: Hoare triple {3828#true} assume true; {3828#true} is VALID [2022-04-28 05:58:34,079 INFO L290 TraceCheckUtils]: 21: Hoare triple {3828#true} assume !(0 == ~cond); {3828#true} is VALID [2022-04-28 05:58:34,079 INFO L290 TraceCheckUtils]: 20: Hoare triple {3828#true} ~cond := #in~cond; {3828#true} is VALID [2022-04-28 05:58:34,079 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-28 05:58:34,079 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-28 05:58:34,080 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-28 05:58:34,080 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-28 05:58:34,081 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3828#true} {3885#(<= ~counter~0 1)} #92#return; {3885#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:34,081 INFO L290 TraceCheckUtils]: 14: Hoare triple {3828#true} assume true; {3828#true} is VALID [2022-04-28 05:58:34,081 INFO L290 TraceCheckUtils]: 13: Hoare triple {3828#true} assume !(0 == ~cond); {3828#true} is VALID [2022-04-28 05:58:34,081 INFO L290 TraceCheckUtils]: 12: Hoare triple {3828#true} ~cond := #in~cond; {3828#true} is VALID [2022-04-28 05:58:34,081 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-28 05:58:34,082 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3828#true} {3885#(<= ~counter~0 1)} #90#return; {3885#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:34,082 INFO L290 TraceCheckUtils]: 9: Hoare triple {3828#true} assume true; {3828#true} is VALID [2022-04-28 05:58:34,082 INFO L290 TraceCheckUtils]: 8: Hoare triple {3828#true} assume !(0 == ~cond); {3828#true} is VALID [2022-04-28 05:58:34,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {3828#true} ~cond := #in~cond; {3828#true} is VALID [2022-04-28 05:58:34,082 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-28 05:58:34,083 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-28 05:58:34,083 INFO L272 TraceCheckUtils]: 4: Hoare triple {3885#(<= ~counter~0 1)} call #t~ret9 := main(); {3885#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:34,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3885#(<= ~counter~0 1)} {3828#true} #102#return; {3885#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:34,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {3885#(<= ~counter~0 1)} assume true; {3885#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:34,084 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-28 05:58:34,084 INFO L272 TraceCheckUtils]: 0: Hoare triple {3828#true} call ULTIMATE.init(); {3828#true} is VALID [2022-04-28 05:58:34,085 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-28 05:58:34,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:58:34,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815926510] [2022-04-28 05:58:34,085 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:58:34,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070922275] [2022-04-28 05:58:34,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070922275] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:58:34,085 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:58:34,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-28 05:58:34,088 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:58:34,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1282313264] [2022-04-28 05:58:34,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1282313264] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:58:34,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:58:34,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 05:58:34,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115555654] [2022-04-28 05:58:34,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:58:34,092 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-28 05:58:34,092 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:58:34,092 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-28 05:58:34,132 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-28 05:58:34,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 05:58:34,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:34,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 05:58:34,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-28 05:58:34,134 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-28 05:58:34,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:34,413 INFO L93 Difference]: Finished difference Result 118 states and 153 transitions. [2022-04-28 05:58:34,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 05:58:34,414 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-28 05:58:34,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:58:34,414 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-28 05:58:34,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-28 05:58:34,416 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-28 05:58:34,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-28 05:58:34,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 101 transitions. [2022-04-28 05:58:34,498 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-28 05:58:34,501 INFO L225 Difference]: With dead ends: 118 [2022-04-28 05:58:34,501 INFO L226 Difference]: Without dead ends: 81 [2022-04-28 05:58:34,504 INFO L412 NwaCegarLoop]: 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-28 05:58:34,506 INFO L413 NwaCegarLoop]: 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-28 05:58:34,506 INFO L414 NwaCegarLoop]: 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-28 05:58:34,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-28 05:58:34,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2022-04-28 05:58:34,585 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:58:34,585 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-28 05:58:34,586 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-28 05:58:34,586 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-28 05:58:34,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:34,594 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-28 05:58:34,594 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-28 05:58:34,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:34,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:34,594 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-28 05:58:34,599 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-28 05:58:34,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:34,603 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-28 05:58:34,603 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-28 05:58:34,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:34,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:34,604 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:58:34,604 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:58:34,604 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-28 05:58:34,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 99 transitions. [2022-04-28 05:58:34,607 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 99 transitions. Word has length 49 [2022-04-28 05:58:34,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:58:34,607 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 99 transitions. [2022-04-28 05:58:34,607 INFO L496 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-28 05:58:34,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 99 transitions. [2022-04-28 05:58:36,746 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 98 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:36,746 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2022-04-28 05:58:36,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 05:58:36,746 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:58:36,746 INFO L195 NwaCegarLoop]: 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-28 05:58:36,762 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-28 05:58:36,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:36,951 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:58:36,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:58:36,952 INFO L85 PathProgramCache]: Analyzing trace with hash -60460648, now seen corresponding path program 3 times [2022-04-28 05:58:36,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:36,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1556672698] [2022-04-28 05:58:36,952 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:58:36,952 INFO L85 PathProgramCache]: Analyzing trace with hash -60460648, now seen corresponding path program 4 times [2022-04-28 05:58:36,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:58:36,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917714730] [2022-04-28 05:58:36,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:58:36,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:58:36,964 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:58:36,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [37293562] [2022-04-28 05:58:36,965 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:58:36,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:36,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:58:36,966 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-28 05:58:36,987 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-28 05:58:37,058 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:58:37,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:58:37,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 05:58:37,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:58:37,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:58:37,358 INFO L272 TraceCheckUtils]: 0: Hoare triple {4690#true} call ULTIMATE.init(); {4690#true} is VALID [2022-04-28 05:58:37,359 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-28 05:58:37,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {4698#(<= ~counter~0 0)} assume true; {4698#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:37,360 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4698#(<= ~counter~0 0)} {4690#true} #102#return; {4698#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:37,360 INFO L272 TraceCheckUtils]: 4: Hoare triple {4698#(<= ~counter~0 0)} call #t~ret9 := main(); {4698#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:37,361 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-28 05:58:37,361 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-28 05:58:37,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {4698#(<= ~counter~0 0)} ~cond := #in~cond; {4698#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:37,362 INFO L290 TraceCheckUtils]: 8: Hoare triple {4698#(<= ~counter~0 0)} assume !(0 == ~cond); {4698#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:37,362 INFO L290 TraceCheckUtils]: 9: Hoare triple {4698#(<= ~counter~0 0)} assume true; {4698#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:37,363 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4698#(<= ~counter~0 0)} {4698#(<= ~counter~0 0)} #90#return; {4698#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:37,363 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-28 05:58:37,363 INFO L290 TraceCheckUtils]: 12: Hoare triple {4698#(<= ~counter~0 0)} ~cond := #in~cond; {4698#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:37,364 INFO L290 TraceCheckUtils]: 13: Hoare triple {4698#(<= ~counter~0 0)} assume !(0 == ~cond); {4698#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:37,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {4698#(<= ~counter~0 0)} assume true; {4698#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:37,364 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4698#(<= ~counter~0 0)} {4698#(<= ~counter~0 0)} #92#return; {4698#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:37,365 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-28 05:58:37,365 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-28 05:58:37,366 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-28 05:58:37,366 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-28 05:58:37,367 INFO L290 TraceCheckUtils]: 20: Hoare triple {4747#(<= ~counter~0 1)} ~cond := #in~cond; {4747#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:37,367 INFO L290 TraceCheckUtils]: 21: Hoare triple {4747#(<= ~counter~0 1)} assume !(0 == ~cond); {4747#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:37,367 INFO L290 TraceCheckUtils]: 22: Hoare triple {4747#(<= ~counter~0 1)} assume true; {4747#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:37,368 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4747#(<= ~counter~0 1)} {4747#(<= ~counter~0 1)} #94#return; {4747#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:37,368 INFO L290 TraceCheckUtils]: 24: Hoare triple {4747#(<= ~counter~0 1)} assume !!(0 != ~r~0); {4747#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:37,369 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-28 05:58:37,369 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-28 05:58:37,369 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-28 05:58:37,370 INFO L290 TraceCheckUtils]: 28: Hoare triple {4772#(<= ~counter~0 2)} ~cond := #in~cond; {4772#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:37,370 INFO L290 TraceCheckUtils]: 29: Hoare triple {4772#(<= ~counter~0 2)} assume !(0 == ~cond); {4772#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:37,370 INFO L290 TraceCheckUtils]: 30: Hoare triple {4772#(<= ~counter~0 2)} assume true; {4772#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:37,371 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4772#(<= ~counter~0 2)} {4772#(<= ~counter~0 2)} #96#return; {4772#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:37,371 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-28 05:58:37,372 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-28 05:58:37,372 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-28 05:58:37,373 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-28 05:58:37,373 INFO L290 TraceCheckUtils]: 36: Hoare triple {4797#(<= ~counter~0 3)} ~cond := #in~cond; {4797#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:37,373 INFO L290 TraceCheckUtils]: 37: Hoare triple {4797#(<= ~counter~0 3)} assume !(0 == ~cond); {4797#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:37,374 INFO L290 TraceCheckUtils]: 38: Hoare triple {4797#(<= ~counter~0 3)} assume true; {4797#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:37,374 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4797#(<= ~counter~0 3)} {4797#(<= ~counter~0 3)} #96#return; {4797#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:37,374 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-28 05:58:37,375 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-28 05:58:37,375 INFO L290 TraceCheckUtils]: 42: Hoare triple {4822#(<= |main_#t~post7| 3)} assume !(#t~post7 < 5);havoc #t~post7; {4691#false} is VALID [2022-04-28 05:58:37,375 INFO L290 TraceCheckUtils]: 43: Hoare triple {4691#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4691#false} is VALID [2022-04-28 05:58:37,375 INFO L290 TraceCheckUtils]: 44: Hoare triple {4691#false} assume !(#t~post8 < 5);havoc #t~post8; {4691#false} is VALID [2022-04-28 05:58:37,376 INFO L290 TraceCheckUtils]: 45: Hoare triple {4691#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4691#false} is VALID [2022-04-28 05:58:37,376 INFO L290 TraceCheckUtils]: 46: Hoare triple {4691#false} assume !(#t~post6 < 5);havoc #t~post6; {4691#false} is VALID [2022-04-28 05:58:37,376 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-28 05:58:37,376 INFO L290 TraceCheckUtils]: 48: Hoare triple {4691#false} ~cond := #in~cond; {4691#false} is VALID [2022-04-28 05:58:37,376 INFO L290 TraceCheckUtils]: 49: Hoare triple {4691#false} assume 0 == ~cond; {4691#false} is VALID [2022-04-28 05:58:37,376 INFO L290 TraceCheckUtils]: 50: Hoare triple {4691#false} assume !false; {4691#false} is VALID [2022-04-28 05:58:37,376 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-28 05:58:37,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:58:37,613 INFO L290 TraceCheckUtils]: 50: Hoare triple {4691#false} assume !false; {4691#false} is VALID [2022-04-28 05:58:37,613 INFO L290 TraceCheckUtils]: 49: Hoare triple {4691#false} assume 0 == ~cond; {4691#false} is VALID [2022-04-28 05:58:37,613 INFO L290 TraceCheckUtils]: 48: Hoare triple {4691#false} ~cond := #in~cond; {4691#false} is VALID [2022-04-28 05:58:37,613 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-28 05:58:37,613 INFO L290 TraceCheckUtils]: 46: Hoare triple {4691#false} assume !(#t~post6 < 5);havoc #t~post6; {4691#false} is VALID [2022-04-28 05:58:37,613 INFO L290 TraceCheckUtils]: 45: Hoare triple {4691#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4691#false} is VALID [2022-04-28 05:58:37,613 INFO L290 TraceCheckUtils]: 44: Hoare triple {4691#false} assume !(#t~post8 < 5);havoc #t~post8; {4691#false} is VALID [2022-04-28 05:58:37,613 INFO L290 TraceCheckUtils]: 43: Hoare triple {4691#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4691#false} is VALID [2022-04-28 05:58:37,614 INFO L290 TraceCheckUtils]: 42: Hoare triple {4874#(< |main_#t~post7| 5)} assume !(#t~post7 < 5);havoc #t~post7; {4691#false} is VALID [2022-04-28 05:58:37,614 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-28 05:58:37,614 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-28 05:58:37,615 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4690#true} {4878#(< ~counter~0 5)} #96#return; {4878#(< ~counter~0 5)} is VALID [2022-04-28 05:58:37,615 INFO L290 TraceCheckUtils]: 38: Hoare triple {4690#true} assume true; {4690#true} is VALID [2022-04-28 05:58:37,615 INFO L290 TraceCheckUtils]: 37: Hoare triple {4690#true} assume !(0 == ~cond); {4690#true} is VALID [2022-04-28 05:58:37,615 INFO L290 TraceCheckUtils]: 36: Hoare triple {4690#true} ~cond := #in~cond; {4690#true} is VALID [2022-04-28 05:58:37,615 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-28 05:58:37,619 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-28 05:58:37,620 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-28 05:58:37,620 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-28 05:58:37,621 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4690#true} {4797#(<= ~counter~0 3)} #96#return; {4797#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:37,621 INFO L290 TraceCheckUtils]: 30: Hoare triple {4690#true} assume true; {4690#true} is VALID [2022-04-28 05:58:37,621 INFO L290 TraceCheckUtils]: 29: Hoare triple {4690#true} assume !(0 == ~cond); {4690#true} is VALID [2022-04-28 05:58:37,621 INFO L290 TraceCheckUtils]: 28: Hoare triple {4690#true} ~cond := #in~cond; {4690#true} is VALID [2022-04-28 05:58:37,621 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-28 05:58:37,622 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-28 05:58:37,622 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-28 05:58:37,622 INFO L290 TraceCheckUtils]: 24: Hoare triple {4772#(<= ~counter~0 2)} assume !!(0 != ~r~0); {4772#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:37,623 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4690#true} {4772#(<= ~counter~0 2)} #94#return; {4772#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:37,623 INFO L290 TraceCheckUtils]: 22: Hoare triple {4690#true} assume true; {4690#true} is VALID [2022-04-28 05:58:37,623 INFO L290 TraceCheckUtils]: 21: Hoare triple {4690#true} assume !(0 == ~cond); {4690#true} is VALID [2022-04-28 05:58:37,623 INFO L290 TraceCheckUtils]: 20: Hoare triple {4690#true} ~cond := #in~cond; {4690#true} is VALID [2022-04-28 05:58:37,623 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-28 05:58:37,624 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-28 05:58:37,624 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-28 05:58:37,624 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-28 05:58:37,625 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4690#true} {4747#(<= ~counter~0 1)} #92#return; {4747#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:37,625 INFO L290 TraceCheckUtils]: 14: Hoare triple {4690#true} assume true; {4690#true} is VALID [2022-04-28 05:58:37,625 INFO L290 TraceCheckUtils]: 13: Hoare triple {4690#true} assume !(0 == ~cond); {4690#true} is VALID [2022-04-28 05:58:37,625 INFO L290 TraceCheckUtils]: 12: Hoare triple {4690#true} ~cond := #in~cond; {4690#true} is VALID [2022-04-28 05:58:37,625 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-28 05:58:37,636 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4690#true} {4747#(<= ~counter~0 1)} #90#return; {4747#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:37,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {4690#true} assume true; {4690#true} is VALID [2022-04-28 05:58:37,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {4690#true} assume !(0 == ~cond); {4690#true} is VALID [2022-04-28 05:58:37,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {4690#true} ~cond := #in~cond; {4690#true} is VALID [2022-04-28 05:58:37,636 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-28 05:58:37,637 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-28 05:58:37,637 INFO L272 TraceCheckUtils]: 4: Hoare triple {4747#(<= ~counter~0 1)} call #t~ret9 := main(); {4747#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:37,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4747#(<= ~counter~0 1)} {4690#true} #102#return; {4747#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:37,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {4747#(<= ~counter~0 1)} assume true; {4747#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:37,639 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-28 05:58:37,639 INFO L272 TraceCheckUtils]: 0: Hoare triple {4690#true} call ULTIMATE.init(); {4690#true} is VALID [2022-04-28 05:58:37,639 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-28 05:58:37,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:58:37,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917714730] [2022-04-28 05:58:37,640 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:58:37,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37293562] [2022-04-28 05:58:37,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37293562] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:58:37,640 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:58:37,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-28 05:58:37,640 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:58:37,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1556672698] [2022-04-28 05:58:37,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1556672698] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:58:37,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:58:37,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 05:58:37,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735390767] [2022-04-28 05:58:37,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:58:37,641 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-28 05:58:37,641 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:58:37,642 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-28 05:58:37,680 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-28 05:58:37,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 05:58:37,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:37,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 05:58:37,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-28 05:58:37,681 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-28 05:58:37,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:37,935 INFO L93 Difference]: Finished difference Result 119 states and 154 transitions. [2022-04-28 05:58:37,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 05:58:37,936 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-28 05:58:37,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:58:37,936 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-28 05:58:37,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2022-04-28 05:58:37,938 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-28 05:58:37,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2022-04-28 05:58:37,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 101 transitions. [2022-04-28 05:58:38,019 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-28 05:58:38,021 INFO L225 Difference]: With dead ends: 119 [2022-04-28 05:58:38,021 INFO L226 Difference]: Without dead ends: 82 [2022-04-28 05:58:38,021 INFO L412 NwaCegarLoop]: 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-28 05:58:38,022 INFO L413 NwaCegarLoop]: 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-28 05:58:38,022 INFO L414 NwaCegarLoop]: 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-28 05:58:38,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-28 05:58:38,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-04-28 05:58:38,097 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:58:38,098 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-28 05:58:38,098 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-28 05:58:38,098 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-28 05:58:38,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:38,100 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2022-04-28 05:58:38,101 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-28 05:58:38,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:38,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:38,101 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-28 05:58:38,101 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-28 05:58:38,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:38,104 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2022-04-28 05:58:38,104 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-28 05:58:38,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:38,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:38,104 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:58:38,104 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:58:38,104 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-28 05:58:38,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2022-04-28 05:58:38,106 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 51 [2022-04-28 05:58:38,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:58:38,107 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2022-04-28 05:58:38,107 INFO L496 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-28 05:58:38,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 101 transitions. [2022-04-28 05:58:40,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 100 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:40,241 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-28 05:58:40,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-28 05:58:40,242 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:58:40,242 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:58:40,246 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-28 05:58:40,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 05:58:40,443 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:58:40,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:58:40,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1067781299, now seen corresponding path program 1 times [2022-04-28 05:58:40,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:40,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [888752661] [2022-04-28 05:58:40,443 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:58:40,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1067781299, now seen corresponding path program 2 times [2022-04-28 05:58:40,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:58:40,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436850794] [2022-04-28 05:58:40,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:58:40,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:58:40,456 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:58:40,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1854250706] [2022-04-28 05:58:40,456 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:58:40,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:40,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:58:40,458 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-28 05:58:40,463 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-28 05:58:40,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:58:40,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:58:40,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 05:58:40,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:58:40,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:58:40,813 INFO L272 TraceCheckUtils]: 0: Hoare triple {5574#true} call ULTIMATE.init(); {5574#true} is VALID [2022-04-28 05:58:40,814 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-28 05:58:40,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {5582#(<= ~counter~0 0)} assume true; {5582#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:40,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5582#(<= ~counter~0 0)} {5574#true} #102#return; {5582#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:40,815 INFO L272 TraceCheckUtils]: 4: Hoare triple {5582#(<= ~counter~0 0)} call #t~ret9 := main(); {5582#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:40,815 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-28 05:58:40,816 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-28 05:58:40,816 INFO L290 TraceCheckUtils]: 7: Hoare triple {5582#(<= ~counter~0 0)} ~cond := #in~cond; {5582#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:40,816 INFO L290 TraceCheckUtils]: 8: Hoare triple {5582#(<= ~counter~0 0)} assume !(0 == ~cond); {5582#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:40,816 INFO L290 TraceCheckUtils]: 9: Hoare triple {5582#(<= ~counter~0 0)} assume true; {5582#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:40,817 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5582#(<= ~counter~0 0)} {5582#(<= ~counter~0 0)} #90#return; {5582#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:40,817 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-28 05:58:40,818 INFO L290 TraceCheckUtils]: 12: Hoare triple {5582#(<= ~counter~0 0)} ~cond := #in~cond; {5582#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:40,818 INFO L290 TraceCheckUtils]: 13: Hoare triple {5582#(<= ~counter~0 0)} assume !(0 == ~cond); {5582#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:40,819 INFO L290 TraceCheckUtils]: 14: Hoare triple {5582#(<= ~counter~0 0)} assume true; {5582#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:40,819 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5582#(<= ~counter~0 0)} {5582#(<= ~counter~0 0)} #92#return; {5582#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:40,820 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-28 05:58:40,820 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-28 05:58:40,820 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-28 05:58:40,821 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-28 05:58:40,821 INFO L290 TraceCheckUtils]: 20: Hoare triple {5631#(<= ~counter~0 1)} ~cond := #in~cond; {5631#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:40,821 INFO L290 TraceCheckUtils]: 21: Hoare triple {5631#(<= ~counter~0 1)} assume !(0 == ~cond); {5631#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:40,822 INFO L290 TraceCheckUtils]: 22: Hoare triple {5631#(<= ~counter~0 1)} assume true; {5631#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:40,822 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5631#(<= ~counter~0 1)} {5631#(<= ~counter~0 1)} #94#return; {5631#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:40,823 INFO L290 TraceCheckUtils]: 24: Hoare triple {5631#(<= ~counter~0 1)} assume !!(0 != ~r~0); {5631#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:40,823 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-28 05:58:40,823 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-28 05:58:40,824 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-28 05:58:40,824 INFO L290 TraceCheckUtils]: 28: Hoare triple {5656#(<= ~counter~0 2)} ~cond := #in~cond; {5656#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:40,824 INFO L290 TraceCheckUtils]: 29: Hoare triple {5656#(<= ~counter~0 2)} assume !(0 == ~cond); {5656#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:40,825 INFO L290 TraceCheckUtils]: 30: Hoare triple {5656#(<= ~counter~0 2)} assume true; {5656#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:40,825 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5656#(<= ~counter~0 2)} {5656#(<= ~counter~0 2)} #96#return; {5656#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:40,826 INFO L290 TraceCheckUtils]: 32: Hoare triple {5656#(<= ~counter~0 2)} assume !(~r~0 > 0); {5656#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:40,826 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-28 05:58:40,826 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-28 05:58:40,827 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-28 05:58:40,827 INFO L290 TraceCheckUtils]: 36: Hoare triple {5681#(<= ~counter~0 3)} ~cond := #in~cond; {5681#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:40,827 INFO L290 TraceCheckUtils]: 37: Hoare triple {5681#(<= ~counter~0 3)} assume !(0 == ~cond); {5681#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:40,828 INFO L290 TraceCheckUtils]: 38: Hoare triple {5681#(<= ~counter~0 3)} assume true; {5681#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:40,828 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5681#(<= ~counter~0 3)} {5681#(<= ~counter~0 3)} #98#return; {5681#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:40,828 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-28 05:58:40,829 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-28 05:58:40,829 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-28 05:58:40,830 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-28 05:58:40,830 INFO L290 TraceCheckUtils]: 44: Hoare triple {5706#(<= ~counter~0 4)} ~cond := #in~cond; {5706#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:40,830 INFO L290 TraceCheckUtils]: 45: Hoare triple {5706#(<= ~counter~0 4)} assume !(0 == ~cond); {5706#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:40,831 INFO L290 TraceCheckUtils]: 46: Hoare triple {5706#(<= ~counter~0 4)} assume true; {5706#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:40,831 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {5706#(<= ~counter~0 4)} {5706#(<= ~counter~0 4)} #98#return; {5706#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:40,831 INFO L290 TraceCheckUtils]: 48: Hoare triple {5706#(<= ~counter~0 4)} assume !(~r~0 < 0); {5706#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:40,832 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-28 05:58:40,832 INFO L290 TraceCheckUtils]: 50: Hoare triple {5731#(<= |main_#t~post6| 4)} assume !(#t~post6 < 5);havoc #t~post6; {5575#false} is VALID [2022-04-28 05:58:40,832 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-28 05:58:40,832 INFO L290 TraceCheckUtils]: 52: Hoare triple {5575#false} ~cond := #in~cond; {5575#false} is VALID [2022-04-28 05:58:40,832 INFO L290 TraceCheckUtils]: 53: Hoare triple {5575#false} assume 0 == ~cond; {5575#false} is VALID [2022-04-28 05:58:40,832 INFO L290 TraceCheckUtils]: 54: Hoare triple {5575#false} assume !false; {5575#false} is VALID [2022-04-28 05:58:40,833 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-28 05:58:40,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:58:41,115 INFO L290 TraceCheckUtils]: 54: Hoare triple {5575#false} assume !false; {5575#false} is VALID [2022-04-28 05:58:41,115 INFO L290 TraceCheckUtils]: 53: Hoare triple {5575#false} assume 0 == ~cond; {5575#false} is VALID [2022-04-28 05:58:41,115 INFO L290 TraceCheckUtils]: 52: Hoare triple {5575#false} ~cond := #in~cond; {5575#false} is VALID [2022-04-28 05:58:41,115 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-28 05:58:41,115 INFO L290 TraceCheckUtils]: 50: Hoare triple {5731#(<= |main_#t~post6| 4)} assume !(#t~post6 < 5);havoc #t~post6; {5575#false} is VALID [2022-04-28 05:58:41,116 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-28 05:58:41,116 INFO L290 TraceCheckUtils]: 48: Hoare triple {5706#(<= ~counter~0 4)} assume !(~r~0 < 0); {5706#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:41,117 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {5574#true} {5706#(<= ~counter~0 4)} #98#return; {5706#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:41,117 INFO L290 TraceCheckUtils]: 46: Hoare triple {5574#true} assume true; {5574#true} is VALID [2022-04-28 05:58:41,117 INFO L290 TraceCheckUtils]: 45: Hoare triple {5574#true} assume !(0 == ~cond); {5574#true} is VALID [2022-04-28 05:58:41,117 INFO L290 TraceCheckUtils]: 44: Hoare triple {5574#true} ~cond := #in~cond; {5574#true} is VALID [2022-04-28 05:58:41,117 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-28 05:58:41,117 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-28 05:58:41,118 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-28 05:58:41,118 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-28 05:58:41,119 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5574#true} {5681#(<= ~counter~0 3)} #98#return; {5681#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:41,119 INFO L290 TraceCheckUtils]: 38: Hoare triple {5574#true} assume true; {5574#true} is VALID [2022-04-28 05:58:41,119 INFO L290 TraceCheckUtils]: 37: Hoare triple {5574#true} assume !(0 == ~cond); {5574#true} is VALID [2022-04-28 05:58:41,119 INFO L290 TraceCheckUtils]: 36: Hoare triple {5574#true} ~cond := #in~cond; {5574#true} is VALID [2022-04-28 05:58:41,119 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-28 05:58:41,119 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-28 05:58:41,120 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-28 05:58:41,120 INFO L290 TraceCheckUtils]: 32: Hoare triple {5656#(<= ~counter~0 2)} assume !(~r~0 > 0); {5656#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:41,120 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5574#true} {5656#(<= ~counter~0 2)} #96#return; {5656#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:41,120 INFO L290 TraceCheckUtils]: 30: Hoare triple {5574#true} assume true; {5574#true} is VALID [2022-04-28 05:58:41,121 INFO L290 TraceCheckUtils]: 29: Hoare triple {5574#true} assume !(0 == ~cond); {5574#true} is VALID [2022-04-28 05:58:41,121 INFO L290 TraceCheckUtils]: 28: Hoare triple {5574#true} ~cond := #in~cond; {5574#true} is VALID [2022-04-28 05:58:41,121 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-28 05:58:41,121 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-28 05:58:41,121 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-28 05:58:41,122 INFO L290 TraceCheckUtils]: 24: Hoare triple {5631#(<= ~counter~0 1)} assume !!(0 != ~r~0); {5631#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:41,122 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5574#true} {5631#(<= ~counter~0 1)} #94#return; {5631#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:41,122 INFO L290 TraceCheckUtils]: 22: Hoare triple {5574#true} assume true; {5574#true} is VALID [2022-04-28 05:58:41,122 INFO L290 TraceCheckUtils]: 21: Hoare triple {5574#true} assume !(0 == ~cond); {5574#true} is VALID [2022-04-28 05:58:41,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {5574#true} ~cond := #in~cond; {5574#true} is VALID [2022-04-28 05:58:41,123 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-28 05:58:41,123 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-28 05:58:41,123 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-28 05:58:41,124 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-28 05:58:41,124 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5574#true} {5582#(<= ~counter~0 0)} #92#return; {5582#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:41,124 INFO L290 TraceCheckUtils]: 14: Hoare triple {5574#true} assume true; {5574#true} is VALID [2022-04-28 05:58:41,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {5574#true} assume !(0 == ~cond); {5574#true} is VALID [2022-04-28 05:58:41,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {5574#true} ~cond := #in~cond; {5574#true} is VALID [2022-04-28 05:58:41,124 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-28 05:58:41,139 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5574#true} {5582#(<= ~counter~0 0)} #90#return; {5582#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:41,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {5574#true} assume true; {5574#true} is VALID [2022-04-28 05:58:41,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {5574#true} assume !(0 == ~cond); {5574#true} is VALID [2022-04-28 05:58:41,140 INFO L290 TraceCheckUtils]: 7: Hoare triple {5574#true} ~cond := #in~cond; {5574#true} is VALID [2022-04-28 05:58:41,140 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-28 05:58:41,140 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-28 05:58:41,141 INFO L272 TraceCheckUtils]: 4: Hoare triple {5582#(<= ~counter~0 0)} call #t~ret9 := main(); {5582#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:41,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5582#(<= ~counter~0 0)} {5574#true} #102#return; {5582#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:41,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {5582#(<= ~counter~0 0)} assume true; {5582#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:41,142 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-28 05:58:41,142 INFO L272 TraceCheckUtils]: 0: Hoare triple {5574#true} call ULTIMATE.init(); {5574#true} is VALID [2022-04-28 05:58:41,142 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-28 05:58:41,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:58:41,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436850794] [2022-04-28 05:58:41,143 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:58:41,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854250706] [2022-04-28 05:58:41,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854250706] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:58:41,143 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:58:41,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-28 05:58:41,143 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:58:41,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [888752661] [2022-04-28 05:58:41,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [888752661] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:58:41,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:58:41,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 05:58:41,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049062040] [2022-04-28 05:58:41,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:58:41,144 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-28 05:58:41,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:58:41,145 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-28 05:58:41,181 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-28 05:58:41,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 05:58:41,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:41,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 05:58:41,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-28 05:58:41,182 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-28 05:58:41,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:41,495 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2022-04-28 05:58:41,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 05:58:41,496 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-28 05:58:41,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:58:41,497 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-28 05:58:41,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-28 05:58:41,499 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-28 05:58:41,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-28 05:58:41,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 95 transitions. [2022-04-28 05:58:41,576 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-28 05:58:41,578 INFO L225 Difference]: With dead ends: 99 [2022-04-28 05:58:41,578 INFO L226 Difference]: Without dead ends: 94 [2022-04-28 05:58:41,578 INFO L412 NwaCegarLoop]: 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-28 05:58:41,578 INFO L413 NwaCegarLoop]: 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-28 05:58:41,579 INFO L414 NwaCegarLoop]: 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-28 05:58:41,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-28 05:58:41,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2022-04-28 05:58:41,665 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:58:41,666 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-28 05:58:41,666 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-28 05:58:41,666 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-28 05:58:41,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:41,668 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2022-04-28 05:58:41,668 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-28 05:58:41,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:41,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:41,669 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-28 05:58:41,669 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-28 05:58:41,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:41,672 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2022-04-28 05:58:41,672 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-28 05:58:41,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:41,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:41,672 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:58:41,672 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:58:41,673 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-28 05:58:41,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 112 transitions. [2022-04-28 05:58:41,675 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 112 transitions. Word has length 55 [2022-04-28 05:58:41,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:58:41,676 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 112 transitions. [2022-04-28 05:58:41,676 INFO L496 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-28 05:58:41,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 112 transitions. [2022-04-28 05:58:42,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:42,279 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 112 transitions. [2022-04-28 05:58:42,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-28 05:58:42,279 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:58:42,279 INFO L195 NwaCegarLoop]: 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-28 05:58:42,297 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-28 05:58:42,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-28 05:58:42,487 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:58:42,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:58:42,488 INFO L85 PathProgramCache]: Analyzing trace with hash -2095290798, now seen corresponding path program 3 times [2022-04-28 05:58:42,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:42,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1319468690] [2022-04-28 05:58:42,488 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:58:42,488 INFO L85 PathProgramCache]: Analyzing trace with hash -2095290798, now seen corresponding path program 4 times [2022-04-28 05:58:42,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:58:42,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685940354] [2022-04-28 05:58:42,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:58:42,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:58:42,500 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:58:42,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1945354358] [2022-04-28 05:58:42,500 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:58:42,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:42,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:58:42,501 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-28 05:58:42,527 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-28 05:58:42,587 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:58:42,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:58:42,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 05:58:42,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:58:42,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:58:42,885 INFO L272 TraceCheckUtils]: 0: Hoare triple {6481#true} call ULTIMATE.init(); {6481#true} is VALID [2022-04-28 05:58:42,886 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-28 05:58:42,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {6489#(<= ~counter~0 0)} assume true; {6489#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:42,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6489#(<= ~counter~0 0)} {6481#true} #102#return; {6489#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:42,886 INFO L272 TraceCheckUtils]: 4: Hoare triple {6489#(<= ~counter~0 0)} call #t~ret9 := main(); {6489#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:42,887 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-28 05:58:42,887 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-28 05:58:42,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {6489#(<= ~counter~0 0)} ~cond := #in~cond; {6489#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:42,888 INFO L290 TraceCheckUtils]: 8: Hoare triple {6489#(<= ~counter~0 0)} assume !(0 == ~cond); {6489#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:42,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {6489#(<= ~counter~0 0)} assume true; {6489#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:42,890 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6489#(<= ~counter~0 0)} {6489#(<= ~counter~0 0)} #90#return; {6489#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:42,890 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-28 05:58:42,891 INFO L290 TraceCheckUtils]: 12: Hoare triple {6489#(<= ~counter~0 0)} ~cond := #in~cond; {6489#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:42,891 INFO L290 TraceCheckUtils]: 13: Hoare triple {6489#(<= ~counter~0 0)} assume !(0 == ~cond); {6489#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:42,891 INFO L290 TraceCheckUtils]: 14: Hoare triple {6489#(<= ~counter~0 0)} assume true; {6489#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:42,892 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6489#(<= ~counter~0 0)} {6489#(<= ~counter~0 0)} #92#return; {6489#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:42,892 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-28 05:58:42,893 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-28 05:58:42,893 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-28 05:58:42,893 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-28 05:58:42,894 INFO L290 TraceCheckUtils]: 20: Hoare triple {6538#(<= ~counter~0 1)} ~cond := #in~cond; {6538#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:42,894 INFO L290 TraceCheckUtils]: 21: Hoare triple {6538#(<= ~counter~0 1)} assume !(0 == ~cond); {6538#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:42,894 INFO L290 TraceCheckUtils]: 22: Hoare triple {6538#(<= ~counter~0 1)} assume true; {6538#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:42,895 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6538#(<= ~counter~0 1)} {6538#(<= ~counter~0 1)} #94#return; {6538#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:42,895 INFO L290 TraceCheckUtils]: 24: Hoare triple {6538#(<= ~counter~0 1)} assume !!(0 != ~r~0); {6538#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:42,897 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-28 05:58:42,897 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-28 05:58:42,898 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-28 05:58:42,898 INFO L290 TraceCheckUtils]: 28: Hoare triple {6563#(<= ~counter~0 2)} ~cond := #in~cond; {6563#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:42,899 INFO L290 TraceCheckUtils]: 29: Hoare triple {6563#(<= ~counter~0 2)} assume !(0 == ~cond); {6563#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:42,899 INFO L290 TraceCheckUtils]: 30: Hoare triple {6563#(<= ~counter~0 2)} assume true; {6563#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:42,899 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6563#(<= ~counter~0 2)} {6563#(<= ~counter~0 2)} #96#return; {6563#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:42,900 INFO L290 TraceCheckUtils]: 32: Hoare triple {6563#(<= ~counter~0 2)} assume !(~r~0 > 0); {6563#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:42,900 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-28 05:58:42,900 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-28 05:58:42,901 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-28 05:58:42,901 INFO L290 TraceCheckUtils]: 36: Hoare triple {6588#(<= ~counter~0 3)} ~cond := #in~cond; {6588#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:42,902 INFO L290 TraceCheckUtils]: 37: Hoare triple {6588#(<= ~counter~0 3)} assume !(0 == ~cond); {6588#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:42,902 INFO L290 TraceCheckUtils]: 38: Hoare triple {6588#(<= ~counter~0 3)} assume true; {6588#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:42,902 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6588#(<= ~counter~0 3)} {6588#(<= ~counter~0 3)} #98#return; {6588#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:42,903 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-28 05:58:42,903 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-28 05:58:42,903 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-28 05:58:42,904 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-28 05:58:42,904 INFO L290 TraceCheckUtils]: 44: Hoare triple {6613#(<= ~counter~0 4)} ~cond := #in~cond; {6613#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:42,904 INFO L290 TraceCheckUtils]: 45: Hoare triple {6613#(<= ~counter~0 4)} assume !(0 == ~cond); {6613#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:42,905 INFO L290 TraceCheckUtils]: 46: Hoare triple {6613#(<= ~counter~0 4)} assume true; {6613#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:42,905 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6613#(<= ~counter~0 4)} {6613#(<= ~counter~0 4)} #98#return; {6613#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:42,906 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-28 05:58:42,906 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-28 05:58:42,906 INFO L290 TraceCheckUtils]: 50: Hoare triple {6638#(<= |main_#t~post8| 4)} assume !(#t~post8 < 5);havoc #t~post8; {6482#false} is VALID [2022-04-28 05:58:42,906 INFO L290 TraceCheckUtils]: 51: Hoare triple {6482#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6482#false} is VALID [2022-04-28 05:58:42,906 INFO L290 TraceCheckUtils]: 52: Hoare triple {6482#false} assume !(#t~post6 < 5);havoc #t~post6; {6482#false} is VALID [2022-04-28 05:58:42,906 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-28 05:58:42,907 INFO L290 TraceCheckUtils]: 54: Hoare triple {6482#false} ~cond := #in~cond; {6482#false} is VALID [2022-04-28 05:58:42,907 INFO L290 TraceCheckUtils]: 55: Hoare triple {6482#false} assume 0 == ~cond; {6482#false} is VALID [2022-04-28 05:58:42,907 INFO L290 TraceCheckUtils]: 56: Hoare triple {6482#false} assume !false; {6482#false} is VALID [2022-04-28 05:58:42,907 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-28 05:58:42,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:58:43,177 INFO L290 TraceCheckUtils]: 56: Hoare triple {6482#false} assume !false; {6482#false} is VALID [2022-04-28 05:58:43,177 INFO L290 TraceCheckUtils]: 55: Hoare triple {6482#false} assume 0 == ~cond; {6482#false} is VALID [2022-04-28 05:58:43,177 INFO L290 TraceCheckUtils]: 54: Hoare triple {6482#false} ~cond := #in~cond; {6482#false} is VALID [2022-04-28 05:58:43,177 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-28 05:58:43,178 INFO L290 TraceCheckUtils]: 52: Hoare triple {6482#false} assume !(#t~post6 < 5);havoc #t~post6; {6482#false} is VALID [2022-04-28 05:58:43,178 INFO L290 TraceCheckUtils]: 51: Hoare triple {6482#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6482#false} is VALID [2022-04-28 05:58:43,178 INFO L290 TraceCheckUtils]: 50: Hoare triple {6638#(<= |main_#t~post8| 4)} assume !(#t~post8 < 5);havoc #t~post8; {6482#false} is VALID [2022-04-28 05:58:43,179 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-28 05:58:43,179 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-28 05:58:43,180 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6481#true} {6613#(<= ~counter~0 4)} #98#return; {6613#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:43,180 INFO L290 TraceCheckUtils]: 46: Hoare triple {6481#true} assume true; {6481#true} is VALID [2022-04-28 05:58:43,180 INFO L290 TraceCheckUtils]: 45: Hoare triple {6481#true} assume !(0 == ~cond); {6481#true} is VALID [2022-04-28 05:58:43,180 INFO L290 TraceCheckUtils]: 44: Hoare triple {6481#true} ~cond := #in~cond; {6481#true} is VALID [2022-04-28 05:58:43,180 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-28 05:58:43,180 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-28 05:58:43,181 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-28 05:58:43,182 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-28 05:58:43,182 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6481#true} {6588#(<= ~counter~0 3)} #98#return; {6588#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:43,182 INFO L290 TraceCheckUtils]: 38: Hoare triple {6481#true} assume true; {6481#true} is VALID [2022-04-28 05:58:43,183 INFO L290 TraceCheckUtils]: 37: Hoare triple {6481#true} assume !(0 == ~cond); {6481#true} is VALID [2022-04-28 05:58:43,183 INFO L290 TraceCheckUtils]: 36: Hoare triple {6481#true} ~cond := #in~cond; {6481#true} is VALID [2022-04-28 05:58:43,183 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-28 05:58:43,183 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-28 05:58:43,184 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-28 05:58:43,184 INFO L290 TraceCheckUtils]: 32: Hoare triple {6563#(<= ~counter~0 2)} assume !(~r~0 > 0); {6563#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:43,185 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6481#true} {6563#(<= ~counter~0 2)} #96#return; {6563#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:43,185 INFO L290 TraceCheckUtils]: 30: Hoare triple {6481#true} assume true; {6481#true} is VALID [2022-04-28 05:58:43,185 INFO L290 TraceCheckUtils]: 29: Hoare triple {6481#true} assume !(0 == ~cond); {6481#true} is VALID [2022-04-28 05:58:43,185 INFO L290 TraceCheckUtils]: 28: Hoare triple {6481#true} ~cond := #in~cond; {6481#true} is VALID [2022-04-28 05:58:43,185 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-28 05:58:43,186 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-28 05:58:43,186 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-28 05:58:43,187 INFO L290 TraceCheckUtils]: 24: Hoare triple {6538#(<= ~counter~0 1)} assume !!(0 != ~r~0); {6538#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:43,188 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6481#true} {6538#(<= ~counter~0 1)} #94#return; {6538#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:43,188 INFO L290 TraceCheckUtils]: 22: Hoare triple {6481#true} assume true; {6481#true} is VALID [2022-04-28 05:58:43,188 INFO L290 TraceCheckUtils]: 21: Hoare triple {6481#true} assume !(0 == ~cond); {6481#true} is VALID [2022-04-28 05:58:43,188 INFO L290 TraceCheckUtils]: 20: Hoare triple {6481#true} ~cond := #in~cond; {6481#true} is VALID [2022-04-28 05:58:43,188 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-28 05:58:43,188 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-28 05:58:43,189 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-28 05:58:43,190 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-28 05:58:43,190 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6481#true} {6489#(<= ~counter~0 0)} #92#return; {6489#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:43,190 INFO L290 TraceCheckUtils]: 14: Hoare triple {6481#true} assume true; {6481#true} is VALID [2022-04-28 05:58:43,190 INFO L290 TraceCheckUtils]: 13: Hoare triple {6481#true} assume !(0 == ~cond); {6481#true} is VALID [2022-04-28 05:58:43,190 INFO L290 TraceCheckUtils]: 12: Hoare triple {6481#true} ~cond := #in~cond; {6481#true} is VALID [2022-04-28 05:58:43,191 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-28 05:58:43,191 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6481#true} {6489#(<= ~counter~0 0)} #90#return; {6489#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:43,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {6481#true} assume true; {6481#true} is VALID [2022-04-28 05:58:43,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {6481#true} assume !(0 == ~cond); {6481#true} is VALID [2022-04-28 05:58:43,192 INFO L290 TraceCheckUtils]: 7: Hoare triple {6481#true} ~cond := #in~cond; {6481#true} is VALID [2022-04-28 05:58:43,192 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-28 05:58:43,192 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-28 05:58:43,192 INFO L272 TraceCheckUtils]: 4: Hoare triple {6489#(<= ~counter~0 0)} call #t~ret9 := main(); {6489#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:43,193 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6489#(<= ~counter~0 0)} {6481#true} #102#return; {6489#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:43,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {6489#(<= ~counter~0 0)} assume true; {6489#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:43,194 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-28 05:58:43,194 INFO L272 TraceCheckUtils]: 0: Hoare triple {6481#true} call ULTIMATE.init(); {6481#true} is VALID [2022-04-28 05:58:43,194 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-28 05:58:43,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:58:43,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685940354] [2022-04-28 05:58:43,195 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:58:43,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945354358] [2022-04-28 05:58:43,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945354358] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:58:43,195 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:58:43,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-28 05:58:43,196 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:58:43,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1319468690] [2022-04-28 05:58:43,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1319468690] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:58:43,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:58:43,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 05:58:43,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164997392] [2022-04-28 05:58:43,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:58:43,197 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-28 05:58:43,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:58:43,197 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-28 05:58:43,247 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-28 05:58:43,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 05:58:43,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:43,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 05:58:43,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-28 05:58:43,248 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-28 05:58:43,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:43,560 INFO L93 Difference]: Finished difference Result 132 states and 170 transitions. [2022-04-28 05:58:43,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 05:58:43,560 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-28 05:58:43,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:58:43,561 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-28 05:58:43,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-28 05:58:43,563 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-28 05:58:43,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-28 05:58:43,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 117 transitions. [2022-04-28 05:58:43,656 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-28 05:58:43,658 INFO L225 Difference]: With dead ends: 132 [2022-04-28 05:58:43,658 INFO L226 Difference]: Without dead ends: 95 [2022-04-28 05:58:43,658 INFO L412 NwaCegarLoop]: 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-28 05:58:43,659 INFO L413 NwaCegarLoop]: 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-28 05:58:43,659 INFO L414 NwaCegarLoop]: 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-28 05:58:43,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-28 05:58:43,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2022-04-28 05:58:43,752 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:58:43,752 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-28 05:58:43,752 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-28 05:58:43,752 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-28 05:58:43,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:43,754 INFO L93 Difference]: Finished difference Result 95 states and 117 transitions. [2022-04-28 05:58:43,754 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2022-04-28 05:58:43,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:43,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:43,755 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-28 05:58:43,756 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-28 05:58:43,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:43,758 INFO L93 Difference]: Finished difference Result 95 states and 117 transitions. [2022-04-28 05:58:43,758 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2022-04-28 05:58:43,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:43,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:43,759 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:58:43,759 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:58:43,759 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-28 05:58:43,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 116 transitions. [2022-04-28 05:58:43,761 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 116 transitions. Word has length 57 [2022-04-28 05:58:43,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:58:43,761 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 116 transitions. [2022-04-28 05:58:43,762 INFO L496 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-28 05:58:43,762 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 116 transitions. [2022-04-28 05:58:44,712 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-28 05:58:44,712 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-28 05:58:44,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 05:58:44,713 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:58:44,713 INFO L195 NwaCegarLoop]: 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-28 05:58:44,729 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-28 05:58:44,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 05:58:44,915 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:58:44,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:58:44,916 INFO L85 PathProgramCache]: Analyzing trace with hash -659642693, now seen corresponding path program 5 times [2022-04-28 05:58:44,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:44,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1463388799] [2022-04-28 05:58:44,916 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:58:44,916 INFO L85 PathProgramCache]: Analyzing trace with hash -659642693, now seen corresponding path program 6 times [2022-04-28 05:58:44,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:58:44,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098986106] [2022-04-28 05:58:44,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:58:44,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:58:44,928 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:58:44,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1781330255] [2022-04-28 05:58:44,929 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 05:58:44,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:44,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:58:44,930 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-28 05:58:44,933 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-28 05:58:45,010 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 05:58:45,010 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:58:45,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 05:58:45,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:58:45,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:58:45,305 INFO L272 TraceCheckUtils]: 0: Hoare triple {7476#true} call ULTIMATE.init(); {7476#true} is VALID [2022-04-28 05:58:45,306 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-28 05:58:45,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {7484#(<= ~counter~0 0)} assume true; {7484#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:45,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7484#(<= ~counter~0 0)} {7476#true} #102#return; {7484#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:45,307 INFO L272 TraceCheckUtils]: 4: Hoare triple {7484#(<= ~counter~0 0)} call #t~ret9 := main(); {7484#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:45,307 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-28 05:58:45,308 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-28 05:58:45,308 INFO L290 TraceCheckUtils]: 7: Hoare triple {7484#(<= ~counter~0 0)} ~cond := #in~cond; {7484#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:45,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {7484#(<= ~counter~0 0)} assume !(0 == ~cond); {7484#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:45,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {7484#(<= ~counter~0 0)} assume true; {7484#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:45,309 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7484#(<= ~counter~0 0)} {7484#(<= ~counter~0 0)} #90#return; {7484#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:45,310 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-28 05:58:45,310 INFO L290 TraceCheckUtils]: 12: Hoare triple {7484#(<= ~counter~0 0)} ~cond := #in~cond; {7484#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:45,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {7484#(<= ~counter~0 0)} assume !(0 == ~cond); {7484#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:45,310 INFO L290 TraceCheckUtils]: 14: Hoare triple {7484#(<= ~counter~0 0)} assume true; {7484#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:45,311 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7484#(<= ~counter~0 0)} {7484#(<= ~counter~0 0)} #92#return; {7484#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:45,311 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-28 05:58:45,312 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-28 05:58:45,312 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-28 05:58:45,312 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-28 05:58:45,313 INFO L290 TraceCheckUtils]: 20: Hoare triple {7533#(<= ~counter~0 1)} ~cond := #in~cond; {7533#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:45,313 INFO L290 TraceCheckUtils]: 21: Hoare triple {7533#(<= ~counter~0 1)} assume !(0 == ~cond); {7533#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:45,313 INFO L290 TraceCheckUtils]: 22: Hoare triple {7533#(<= ~counter~0 1)} assume true; {7533#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:45,314 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7533#(<= ~counter~0 1)} {7533#(<= ~counter~0 1)} #94#return; {7533#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:45,314 INFO L290 TraceCheckUtils]: 24: Hoare triple {7533#(<= ~counter~0 1)} assume !!(0 != ~r~0); {7533#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:45,315 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-28 05:58:45,315 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-28 05:58:45,315 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-28 05:58:45,316 INFO L290 TraceCheckUtils]: 28: Hoare triple {7558#(<= ~counter~0 2)} ~cond := #in~cond; {7558#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:45,316 INFO L290 TraceCheckUtils]: 29: Hoare triple {7558#(<= ~counter~0 2)} assume !(0 == ~cond); {7558#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:45,316 INFO L290 TraceCheckUtils]: 30: Hoare triple {7558#(<= ~counter~0 2)} assume true; {7558#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:45,317 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7558#(<= ~counter~0 2)} {7558#(<= ~counter~0 2)} #96#return; {7558#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:45,317 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-28 05:58:45,317 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-28 05:58:45,318 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-28 05:58:45,318 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-28 05:58:45,318 INFO L290 TraceCheckUtils]: 36: Hoare triple {7583#(<= ~counter~0 3)} ~cond := #in~cond; {7583#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:45,319 INFO L290 TraceCheckUtils]: 37: Hoare triple {7583#(<= ~counter~0 3)} assume !(0 == ~cond); {7583#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:45,319 INFO L290 TraceCheckUtils]: 38: Hoare triple {7583#(<= ~counter~0 3)} assume true; {7583#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:45,320 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7583#(<= ~counter~0 3)} {7583#(<= ~counter~0 3)} #96#return; {7583#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:45,320 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-28 05:58:45,320 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-28 05:58:45,321 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-28 05:58:45,321 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-28 05:58:45,321 INFO L290 TraceCheckUtils]: 44: Hoare triple {7608#(<= ~counter~0 4)} ~cond := #in~cond; {7608#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:45,322 INFO L290 TraceCheckUtils]: 45: Hoare triple {7608#(<= ~counter~0 4)} assume !(0 == ~cond); {7608#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:45,322 INFO L290 TraceCheckUtils]: 46: Hoare triple {7608#(<= ~counter~0 4)} assume true; {7608#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:45,327 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7608#(<= ~counter~0 4)} {7608#(<= ~counter~0 4)} #96#return; {7608#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:45,328 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-28 05:58:45,328 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-28 05:58:45,329 INFO L290 TraceCheckUtils]: 50: Hoare triple {7633#(<= |main_#t~post7| 4)} assume !(#t~post7 < 5);havoc #t~post7; {7477#false} is VALID [2022-04-28 05:58:45,329 INFO L290 TraceCheckUtils]: 51: Hoare triple {7477#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7477#false} is VALID [2022-04-28 05:58:45,329 INFO L290 TraceCheckUtils]: 52: Hoare triple {7477#false} assume !(#t~post8 < 5);havoc #t~post8; {7477#false} is VALID [2022-04-28 05:58:45,329 INFO L290 TraceCheckUtils]: 53: Hoare triple {7477#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7477#false} is VALID [2022-04-28 05:58:45,329 INFO L290 TraceCheckUtils]: 54: Hoare triple {7477#false} assume !(#t~post6 < 5);havoc #t~post6; {7477#false} is VALID [2022-04-28 05:58:45,329 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-28 05:58:45,329 INFO L290 TraceCheckUtils]: 56: Hoare triple {7477#false} ~cond := #in~cond; {7477#false} is VALID [2022-04-28 05:58:45,329 INFO L290 TraceCheckUtils]: 57: Hoare triple {7477#false} assume 0 == ~cond; {7477#false} is VALID [2022-04-28 05:58:45,330 INFO L290 TraceCheckUtils]: 58: Hoare triple {7477#false} assume !false; {7477#false} is VALID [2022-04-28 05:58:45,330 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-28 05:58:45,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:58:45,572 INFO L290 TraceCheckUtils]: 58: Hoare triple {7477#false} assume !false; {7477#false} is VALID [2022-04-28 05:58:45,572 INFO L290 TraceCheckUtils]: 57: Hoare triple {7477#false} assume 0 == ~cond; {7477#false} is VALID [2022-04-28 05:58:45,572 INFO L290 TraceCheckUtils]: 56: Hoare triple {7477#false} ~cond := #in~cond; {7477#false} is VALID [2022-04-28 05:58:45,572 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-28 05:58:45,572 INFO L290 TraceCheckUtils]: 54: Hoare triple {7477#false} assume !(#t~post6 < 5);havoc #t~post6; {7477#false} is VALID [2022-04-28 05:58:45,572 INFO L290 TraceCheckUtils]: 53: Hoare triple {7477#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7477#false} is VALID [2022-04-28 05:58:45,572 INFO L290 TraceCheckUtils]: 52: Hoare triple {7477#false} assume !(#t~post8 < 5);havoc #t~post8; {7477#false} is VALID [2022-04-28 05:58:45,573 INFO L290 TraceCheckUtils]: 51: Hoare triple {7477#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7477#false} is VALID [2022-04-28 05:58:45,573 INFO L290 TraceCheckUtils]: 50: Hoare triple {7633#(<= |main_#t~post7| 4)} assume !(#t~post7 < 5);havoc #t~post7; {7477#false} is VALID [2022-04-28 05:58:45,575 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-28 05:58:45,576 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-28 05:58:45,576 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7476#true} {7608#(<= ~counter~0 4)} #96#return; {7608#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:45,576 INFO L290 TraceCheckUtils]: 46: Hoare triple {7476#true} assume true; {7476#true} is VALID [2022-04-28 05:58:45,576 INFO L290 TraceCheckUtils]: 45: Hoare triple {7476#true} assume !(0 == ~cond); {7476#true} is VALID [2022-04-28 05:58:45,577 INFO L290 TraceCheckUtils]: 44: Hoare triple {7476#true} ~cond := #in~cond; {7476#true} is VALID [2022-04-28 05:58:45,577 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-28 05:58:45,577 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-28 05:58:45,578 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-28 05:58:45,578 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-28 05:58:45,578 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7476#true} {7583#(<= ~counter~0 3)} #96#return; {7583#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:45,579 INFO L290 TraceCheckUtils]: 38: Hoare triple {7476#true} assume true; {7476#true} is VALID [2022-04-28 05:58:45,579 INFO L290 TraceCheckUtils]: 37: Hoare triple {7476#true} assume !(0 == ~cond); {7476#true} is VALID [2022-04-28 05:58:45,579 INFO L290 TraceCheckUtils]: 36: Hoare triple {7476#true} ~cond := #in~cond; {7476#true} is VALID [2022-04-28 05:58:45,579 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-28 05:58:45,579 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-28 05:58:45,591 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-28 05:58:45,592 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-28 05:58:45,592 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7476#true} {7558#(<= ~counter~0 2)} #96#return; {7558#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:45,593 INFO L290 TraceCheckUtils]: 30: Hoare triple {7476#true} assume true; {7476#true} is VALID [2022-04-28 05:58:45,593 INFO L290 TraceCheckUtils]: 29: Hoare triple {7476#true} assume !(0 == ~cond); {7476#true} is VALID [2022-04-28 05:58:45,593 INFO L290 TraceCheckUtils]: 28: Hoare triple {7476#true} ~cond := #in~cond; {7476#true} is VALID [2022-04-28 05:58:45,593 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-28 05:58:45,593 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-28 05:58:45,594 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-28 05:58:45,594 INFO L290 TraceCheckUtils]: 24: Hoare triple {7533#(<= ~counter~0 1)} assume !!(0 != ~r~0); {7533#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:45,595 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7476#true} {7533#(<= ~counter~0 1)} #94#return; {7533#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:45,595 INFO L290 TraceCheckUtils]: 22: Hoare triple {7476#true} assume true; {7476#true} is VALID [2022-04-28 05:58:45,595 INFO L290 TraceCheckUtils]: 21: Hoare triple {7476#true} assume !(0 == ~cond); {7476#true} is VALID [2022-04-28 05:58:45,595 INFO L290 TraceCheckUtils]: 20: Hoare triple {7476#true} ~cond := #in~cond; {7476#true} is VALID [2022-04-28 05:58:45,595 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-28 05:58:45,596 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-28 05:58:45,596 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-28 05:58:45,597 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-28 05:58:45,597 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7476#true} {7484#(<= ~counter~0 0)} #92#return; {7484#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:45,597 INFO L290 TraceCheckUtils]: 14: Hoare triple {7476#true} assume true; {7476#true} is VALID [2022-04-28 05:58:45,597 INFO L290 TraceCheckUtils]: 13: Hoare triple {7476#true} assume !(0 == ~cond); {7476#true} is VALID [2022-04-28 05:58:45,597 INFO L290 TraceCheckUtils]: 12: Hoare triple {7476#true} ~cond := #in~cond; {7476#true} is VALID [2022-04-28 05:58:45,597 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-28 05:58:45,598 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7476#true} {7484#(<= ~counter~0 0)} #90#return; {7484#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:45,598 INFO L290 TraceCheckUtils]: 9: Hoare triple {7476#true} assume true; {7476#true} is VALID [2022-04-28 05:58:45,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {7476#true} assume !(0 == ~cond); {7476#true} is VALID [2022-04-28 05:58:45,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {7476#true} ~cond := #in~cond; {7476#true} is VALID [2022-04-28 05:58:45,598 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-28 05:58:45,599 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-28 05:58:45,599 INFO L272 TraceCheckUtils]: 4: Hoare triple {7484#(<= ~counter~0 0)} call #t~ret9 := main(); {7484#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:45,600 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7484#(<= ~counter~0 0)} {7476#true} #102#return; {7484#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:45,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {7484#(<= ~counter~0 0)} assume true; {7484#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:45,601 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-28 05:58:45,601 INFO L272 TraceCheckUtils]: 0: Hoare triple {7476#true} call ULTIMATE.init(); {7476#true} is VALID [2022-04-28 05:58:45,601 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-28 05:58:45,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:58:45,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098986106] [2022-04-28 05:58:45,601 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:58:45,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781330255] [2022-04-28 05:58:45,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781330255] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:58:45,602 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:58:45,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-28 05:58:45,602 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:58:45,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1463388799] [2022-04-28 05:58:45,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1463388799] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:58:45,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:58:45,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 05:58:45,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666628469] [2022-04-28 05:58:45,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:58:45,603 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-28 05:58:45,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:58:45,603 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-28 05:58:45,648 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-28 05:58:45,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 05:58:45,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:45,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 05:58:45,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-28 05:58:45,649 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-28 05:58:45,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:45,972 INFO L93 Difference]: Finished difference Result 133 states and 171 transitions. [2022-04-28 05:58:45,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 05:58:45,973 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-28 05:58:45,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:58:45,973 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-28 05:58:45,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2022-04-28 05:58:45,975 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-28 05:58:45,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2022-04-28 05:58:45,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 117 transitions. [2022-04-28 05:58:46,065 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-28 05:58:46,066 INFO L225 Difference]: With dead ends: 133 [2022-04-28 05:58:46,067 INFO L226 Difference]: Without dead ends: 96 [2022-04-28 05:58:46,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-04-28 05:58:46,068 INFO L413 NwaCegarLoop]: 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-28 05:58:46,068 INFO L414 NwaCegarLoop]: 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-28 05:58:46,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-28 05:58:46,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-04-28 05:58:46,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:58:46,155 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-28 05:58:46,155 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-28 05:58:46,155 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-28 05:58:46,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:46,158 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2022-04-28 05:58:46,158 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-28 05:58:46,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:46,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:46,159 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-28 05:58:46,159 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-28 05:58:46,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:46,161 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2022-04-28 05:58:46,161 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-28 05:58:46,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:46,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:46,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:58:46,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:58:46,162 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-28 05:58:46,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 118 transitions. [2022-04-28 05:58:46,164 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 118 transitions. Word has length 59 [2022-04-28 05:58:46,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:58:46,164 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 118 transitions. [2022-04-28 05:58:46,164 INFO L496 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-28 05:58:46,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 118 transitions. [2022-04-28 05:58:47,412 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-28 05:58:47,412 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-28 05:58:47,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 05:58:47,412 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:58:47,413 INFO L195 NwaCegarLoop]: 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-28 05:58:47,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-28 05:58:47,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 05:58:47,615 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:58:47,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:58:47,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1402694082, now seen corresponding path program 3 times [2022-04-28 05:58:47,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:47,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [745097113] [2022-04-28 05:58:47,616 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:58:47,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1402694082, now seen corresponding path program 4 times [2022-04-28 05:58:47,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:58:47,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206901515] [2022-04-28 05:58:47,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:58:47,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:58:47,640 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:58:47,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [382685730] [2022-04-28 05:58:47,640 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:58:47,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:47,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:58:47,642 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-28 05:58:47,648 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-28 05:58:47,703 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:58:47,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-28 05:58:47,703 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 05:58:47,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 05:58:47,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 05:58:47,745 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-28 05:58:47,745 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 05:58:47,748 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 05:58:47,787 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-28 05:58:47,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:47,975 INFO L356 BasicCegarLoop]: Path program histogram: [6, 4, 4, 2, 2, 2, 2, 2, 2, 2] [2022-04-28 05:58:47,978 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 05:58:47,994 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 05:58:47,994 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 05:58:47,994 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 05:58:47,994 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 05:58:47,994 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 05:58:47,994 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 05:58:47,994 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-28 05:58:47,994 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 05:58:47,994 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 05:58:47,994 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 05:58:47,994 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 05:58:47,995 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-28 05:58:47,995 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-28 05:58:47,995 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-28 05:58:47,995 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-28 05:58:47,995 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-28 05:58:47,995 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-28 05:58:47,995 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 05:58:47,995 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 05:58:47,995 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-28 05:58:47,995 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-28 05:58:47,995 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-28 05:58:47,995 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-28 05:58:47,995 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-28 05:58:47,995 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-28 05:58:47,995 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-28 05:58:47,995 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-28 05:58:47,995 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-28 05:58:47,995 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 05:58:47,995 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 05:58:47,995 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 05:58:47,995 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 05:58:47,996 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2022-04-28 05:58:47,996 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2022-04-28 05:58:47,996 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-28 05:58:47,996 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-28 05:58:47,996 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2022-04-28 05:58:47,996 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2022-04-28 05:58:47,996 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-28 05:58:47,996 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-28 05:58:47,996 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2022-04-28 05:58:47,996 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-28 05:58:47,996 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-28 05:58:47,996 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-28 05:58:47,996 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-28 05:58:47,996 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2022-04-28 05:58:47,996 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2022-04-28 05:58:47,996 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2022-04-28 05:58:47,996 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2022-04-28 05:58:47,996 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 05:58:47,996 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-28 05:58:47,996 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-28 05:58:47,997 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-04-28 05:58:47,997 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-04-28 05:58:47,997 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-28 05:58:47,997 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-28 05:58:47,997 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 05:58:47,997 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-28 05:58:47,997 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-28 05:58:47,997 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-28 05:58:47,997 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-28 05:58:47,997 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-28 05:58:47,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 05:58:47 BoogieIcfgContainer [2022-04-28 05:58:47,999 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 05:58:47,999 INFO L158 Benchmark]: Toolchain (without parser) took 66490.71ms. Allocated memory was 172.0MB in the beginning and 206.6MB in the end (delta: 34.6MB). Free memory was 122.2MB in the beginning and 88.3MB in the end (delta: 33.9MB). Peak memory consumption was 69.6MB. Max. memory is 8.0GB. [2022-04-28 05:58:48,000 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 172.0MB. Free memory is still 138.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 05:58:48,000 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.66ms. Allocated memory is still 172.0MB. Free memory was 122.0MB in the beginning and 146.2MB in the end (delta: -24.2MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. [2022-04-28 05:58:48,001 INFO L158 Benchmark]: Boogie Preprocessor took 25.45ms. Allocated memory is still 172.0MB. Free memory was 146.2MB in the beginning and 144.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 05:58:48,001 INFO L158 Benchmark]: RCFGBuilder took 311.35ms. Allocated memory is still 172.0MB. Free memory was 144.6MB in the beginning and 132.5MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 05:58:48,002 INFO L158 Benchmark]: TraceAbstraction took 65935.18ms. Allocated memory was 172.0MB in the beginning and 206.6MB in the end (delta: 34.6MB). Free memory was 131.5MB in the beginning and 88.3MB in the end (delta: 43.3MB). Peak memory consumption was 79.4MB. Max. memory is 8.0GB. [2022-04-28 05:58:48,002 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.14ms. Allocated memory is still 172.0MB. Free memory is still 138.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 213.66ms. Allocated memory is still 172.0MB. Free memory was 122.0MB in the beginning and 146.2MB in the end (delta: -24.2MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.45ms. Allocated memory is still 172.0MB. Free memory was 146.2MB in the beginning and 144.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 311.35ms. Allocated memory is still 172.0MB. Free memory was 144.6MB in the beginning and 132.5MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 65935.18ms. Allocated memory was 172.0MB in the beginning and 206.6MB in the end (delta: 34.6MB). Free memory was 131.5MB in the beginning and 88.3MB in the end (delta: 43.3MB). Peak memory consumption was 79.4MB. 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: 65.9s, OverallIterations: 14, TraceHistogramMax: 6, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 27.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 247 SdHoareTripleChecker+Valid, 10.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 238 mSDsluCounter, 1598 SdHoareTripleChecker+Invalid, 10.1s 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, 0.4s 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.9s 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-28 05:58:48,029 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...