/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 12:42:01,075 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 12:42:01,077 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 12:42:01,112 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 12:42:01,112 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 12:42:01,113 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 12:42:01,115 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 12:42:01,116 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 12:42:01,117 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 12:42:01,118 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 12:42:01,118 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 12:42:01,121 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 12:42:01,121 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 12:42:01,125 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 12:42:01,126 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 12:42:01,128 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 12:42:01,128 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 12:42:01,130 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 12:42:01,135 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 12:42:01,140 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 12:42:01,141 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 12:42:01,142 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 12:42:01,142 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 12:42:01,144 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 12:42:01,145 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 12:42:01,150 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 12:42:01,151 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 12:42:01,151 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 12:42:01,151 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 12:42:01,152 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 12:42:01,152 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 12:42:01,152 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 12:42:01,153 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 12:42:01,153 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 12:42:01,154 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 12:42:01,154 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 12:42:01,154 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 12:42:01,155 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 12:42:01,155 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 12:42:01,155 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 12:42:01,155 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 12:42:01,158 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 12:42:01,158 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 12:42:01,166 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 12:42:01,166 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 12:42:01,167 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 12:42:01,167 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 12:42:01,167 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 12:42:01,167 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 12:42:01,167 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 12:42:01,167 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 12:42:01,167 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 12:42:01,168 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 12:42:01,168 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 12:42:01,168 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 12:42:01,168 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 12:42:01,168 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 12:42:01,169 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 12:42:01,169 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 12:42:01,169 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 12:42:01,169 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 12:42:01,169 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 12:42:01,169 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 12:42:01,169 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 12:42:01,169 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 12:42:01,169 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 12:42:01,345 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 12:42:01,369 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 12:42:01,371 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 12:42:01,371 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 12:42:01,375 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 12:42:01,376 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_unwindbound5.c [2022-04-28 12:42:01,420 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6b6cb6b6/721c4d6ba16d4f3196d1e9455302a602/FLAG05f6025d0 [2022-04-28 12:42:01,758 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 12:42:01,758 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_unwindbound5.c [2022-04-28 12:42:01,762 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6b6cb6b6/721c4d6ba16d4f3196d1e9455302a602/FLAG05f6025d0 [2022-04-28 12:42:02,206 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6b6cb6b6/721c4d6ba16d4f3196d1e9455302a602 [2022-04-28 12:42:02,207 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 12:42:02,208 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 12:42:02,210 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 12:42:02,210 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 12:42:02,225 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 12:42:02,225 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 12:42:02" (1/1) ... [2022-04-28 12:42:02,226 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2539c890 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:42:02, skipping insertion in model container [2022-04-28 12:42:02,226 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 12:42:02" (1/1) ... [2022-04-28 12:42:02,232 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 12:42:02,242 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 12:42:02,363 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/fermat2-ll_unwindbound5.c[524,537] [2022-04-28 12:42:02,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 12:42:02,402 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 12:42:02,415 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/fermat2-ll_unwindbound5.c[524,537] [2022-04-28 12:42:02,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 12:42:02,430 INFO L208 MainTranslator]: Completed translation [2022-04-28 12:42:02,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:42:02 WrapperNode [2022-04-28 12:42:02,431 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 12:42:02,431 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 12:42:02,431 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 12:42:02,431 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 12:42:02,438 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:42:02" (1/1) ... [2022-04-28 12:42:02,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:42:02" (1/1) ... [2022-04-28 12:42:02,441 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:42:02" (1/1) ... [2022-04-28 12:42:02,441 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:42:02" (1/1) ... [2022-04-28 12:42:02,449 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:42:02" (1/1) ... [2022-04-28 12:42:02,451 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:42:02" (1/1) ... [2022-04-28 12:42:02,457 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:42:02" (1/1) ... [2022-04-28 12:42:02,458 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 12:42:02,459 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 12:42:02,459 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 12:42:02,459 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 12:42:02,460 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:42:02" (1/1) ... [2022-04-28 12:42:02,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 12:42:02,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:42:02,491 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 12:42:02,493 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 12:42:02,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 12:42:02,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 12:42:02,517 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 12:42:02,517 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 12:42:02,518 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 12:42:02,518 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 12:42:02,518 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 12:42:02,518 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 12:42:02,518 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 12:42:02,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 12:42:02,518 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 12:42:02,518 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 12:42:02,518 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 12:42:02,518 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 12:42:02,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 12:42:02,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 12:42:02,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 12:42:02,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 12:42:02,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 12:42:02,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 12:42:02,560 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 12:42:02,561 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 12:42:02,699 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 12:42:02,703 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 12:42:02,703 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 12:42:02,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 12:42:02 BoogieIcfgContainer [2022-04-28 12:42:02,705 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 12:42:02,706 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 12:42:02,706 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 12:42:02,709 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 12:42:02,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 12:42:02" (1/3) ... [2022-04-28 12:42:02,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77092fdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 12:42:02, skipping insertion in model container [2022-04-28 12:42:02,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:42:02" (2/3) ... [2022-04-28 12:42:02,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77092fdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 12:42:02, skipping insertion in model container [2022-04-28 12:42:02,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 12:42:02" (3/3) ... [2022-04-28 12:42:02,710 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat2-ll_unwindbound5.c [2022-04-28 12:42:02,726 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 12:42:02,726 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 12:42:02,767 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 12:42:02,771 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@5697f430, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@56104778 [2022-04-28 12:42:02,771 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 12:42:02,776 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 12:42:02,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 12:42:02,780 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:42:02,781 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 12:42:02,781 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:42:02,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:42:02,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1859024204, now seen corresponding path program 1 times [2022-04-28 12:42:02,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:42:02,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1453720325] [2022-04-28 12:42:02,795 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:42:02,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1859024204, now seen corresponding path program 2 times [2022-04-28 12:42:02,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:42:02,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848110127] [2022-04-28 12:42:02,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:42:02,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:42:02,863 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:42:02,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1477780268] [2022-04-28 12:42:02,863 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:42:02,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:42:02,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:42:02,865 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 12:42:02,867 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 12:42:02,933 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 12:42:02,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:42:02,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-28 12:42:02,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:42:02,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:42:03,051 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2022-04-28 12:42:03,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#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; {33#true} is VALID [2022-04-28 12:42:03,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-28 12:42:03,052 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #67#return; {33#true} is VALID [2022-04-28 12:42:03,052 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret7 := main(); {33#true} is VALID [2022-04-28 12:42:03,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#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; {33#true} is VALID [2022-04-28 12:42:03,053 INFO L272 TraceCheckUtils]: 6: Hoare triple {33#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {33#true} is VALID [2022-04-28 12:42:03,053 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-28 12:42:03,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} assume 0 == ~cond;assume false; {33#true} is VALID [2022-04-28 12:42:03,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-28 12:42:03,054 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#true} {33#true} #59#return; {33#true} is VALID [2022-04-28 12:42:03,054 INFO L272 TraceCheckUtils]: 11: Hoare triple {33#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)); {33#true} is VALID [2022-04-28 12:42:03,055 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-28 12:42:03,055 INFO L290 TraceCheckUtils]: 13: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-28 12:42:03,055 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-28 12:42:03,056 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34#false} {33#true} #61#return; {34#false} is VALID [2022-04-28 12:42:03,056 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {34#false} is VALID [2022-04-28 12:42:03,056 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-04-28 12:42:03,057 INFO L272 TraceCheckUtils]: 18: Hoare triple {34#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)); {34#false} is VALID [2022-04-28 12:42:03,058 INFO L290 TraceCheckUtils]: 19: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-28 12:42:03,058 INFO L290 TraceCheckUtils]: 20: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-04-28 12:42:03,058 INFO L290 TraceCheckUtils]: 21: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-28 12:42:03,059 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 12:42:03,059 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:42:03,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:42:03,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848110127] [2022-04-28 12:42:03,059 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:42:03,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477780268] [2022-04-28 12:42:03,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477780268] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:42:03,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:42:03,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-28 12:42:03,063 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:42:03,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1453720325] [2022-04-28 12:42:03,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1453720325] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:42:03,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:42:03,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-28 12:42:03,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820776994] [2022-04-28 12:42:03,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:42:03,069 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 12:42:03,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:42:03,072 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 12:42:03,100 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 12:42:03,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-28 12:42:03,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:42:03,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-28 12:42:03,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-28 12:42:03,125 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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 12:42:03,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:42:03,182 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-28 12:42:03,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-28 12:42:03,182 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 12:42:03,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:42:03,183 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 12:42:03,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2022-04-28 12:42:03,191 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 12:42:03,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2022-04-28 12:42:03,194 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 70 transitions. [2022-04-28 12:42:03,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:42:03,265 INFO L225 Difference]: With dead ends: 53 [2022-04-28 12:42:03,265 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 12:42:03,267 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 12:42:03,270 INFO L413 NwaCegarLoop]: 34 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, 34 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 12:42:03,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:42:03,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 12:42:03,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-28 12:42:03,291 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:42:03,291 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 12:42:03,292 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 12:42:03,292 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 12:42:03,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:42:03,306 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-28 12:42:03,307 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-28 12:42:03,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:42:03,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:42:03,307 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-04-28 12:42:03,308 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-04-28 12:42:03,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:42:03,309 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-28 12:42:03,310 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-28 12:42:03,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:42:03,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:42:03,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:42:03,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:42:03,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 12:42:03,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-04-28 12:42:03,313 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 22 [2022-04-28 12:42:03,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:42:03,313 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-04-28 12:42:03,313 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 12:42:03,314 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 29 transitions. [2022-04-28 12:42:03,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:42:03,335 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-28 12:42:03,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 12:42:03,335 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:42:03,336 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 12:42:03,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 12:42:03,555 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 12:42:03,556 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:42:03,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:42:03,557 INFO L85 PathProgramCache]: Analyzing trace with hash 243739414, now seen corresponding path program 1 times [2022-04-28 12:42:03,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:42:03,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1033765677] [2022-04-28 12:42:03,557 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:42:03,557 INFO L85 PathProgramCache]: Analyzing trace with hash 243739414, now seen corresponding path program 2 times [2022-04-28 12:42:03,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:42:03,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576653864] [2022-04-28 12:42:03,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:42:03,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:42:03,570 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:42:03,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1369728068] [2022-04-28 12:42:03,571 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:42:03,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:42:03,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:42:03,575 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 12:42:03,576 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 12:42:03,613 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 12:42:03,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:42:03,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 12:42:03,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:42:03,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:42:03,799 INFO L272 TraceCheckUtils]: 0: Hoare triple {306#true} call ULTIMATE.init(); {306#true} is VALID [2022-04-28 12:42:03,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {306#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; {314#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:03,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {314#(<= ~counter~0 0)} assume true; {314#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:03,801 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {314#(<= ~counter~0 0)} {306#true} #67#return; {314#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:03,801 INFO L272 TraceCheckUtils]: 4: Hoare triple {314#(<= ~counter~0 0)} call #t~ret7 := main(); {314#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:03,802 INFO L290 TraceCheckUtils]: 5: Hoare triple {314#(<= ~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; {314#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:03,803 INFO L272 TraceCheckUtils]: 6: Hoare triple {314#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {314#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:03,803 INFO L290 TraceCheckUtils]: 7: Hoare triple {314#(<= ~counter~0 0)} ~cond := #in~cond; {314#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:03,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {314#(<= ~counter~0 0)} assume !(0 == ~cond); {314#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:03,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {314#(<= ~counter~0 0)} assume true; {314#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:03,805 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {314#(<= ~counter~0 0)} {314#(<= ~counter~0 0)} #59#return; {314#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:03,805 INFO L272 TraceCheckUtils]: 11: Hoare triple {314#(<= ~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)); {314#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:03,806 INFO L290 TraceCheckUtils]: 12: Hoare triple {314#(<= ~counter~0 0)} ~cond := #in~cond; {314#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:03,806 INFO L290 TraceCheckUtils]: 13: Hoare triple {314#(<= ~counter~0 0)} assume !(0 == ~cond); {314#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:03,807 INFO L290 TraceCheckUtils]: 14: Hoare triple {314#(<= ~counter~0 0)} assume true; {314#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:03,807 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {314#(<= ~counter~0 0)} {314#(<= ~counter~0 0)} #61#return; {314#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:03,808 INFO L290 TraceCheckUtils]: 16: Hoare triple {314#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {314#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:03,808 INFO L290 TraceCheckUtils]: 17: Hoare triple {314#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {363#(<= |main_#t~post6| 0)} is VALID [2022-04-28 12:42:03,809 INFO L290 TraceCheckUtils]: 18: Hoare triple {363#(<= |main_#t~post6| 0)} assume !(#t~post6 < 5);havoc #t~post6; {307#false} is VALID [2022-04-28 12:42:03,809 INFO L272 TraceCheckUtils]: 19: Hoare triple {307#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)); {307#false} is VALID [2022-04-28 12:42:03,809 INFO L290 TraceCheckUtils]: 20: Hoare triple {307#false} ~cond := #in~cond; {307#false} is VALID [2022-04-28 12:42:03,810 INFO L290 TraceCheckUtils]: 21: Hoare triple {307#false} assume 0 == ~cond; {307#false} is VALID [2022-04-28 12:42:03,810 INFO L290 TraceCheckUtils]: 22: Hoare triple {307#false} assume !false; {307#false} is VALID [2022-04-28 12:42:03,810 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 12:42:03,810 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:42:03,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:42:03,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576653864] [2022-04-28 12:42:03,811 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:42:03,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369728068] [2022-04-28 12:42:03,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369728068] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:42:03,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:42:03,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 12:42:03,812 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:42:03,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1033765677] [2022-04-28 12:42:03,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1033765677] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:42:03,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:42:03,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 12:42:03,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708669494] [2022-04-28 12:42:03,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:42:03,813 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 12:42:03,814 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:42:03,814 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 12:42:03,828 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 12:42:03,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 12:42:03,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:42:03,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 12:42:03,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 12:42:03,830 INFO L87 Difference]: Start difference. First operand 25 states and 29 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 12:42:03,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:42:03,884 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-28 12:42:03,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 12:42:03,884 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 12:42:03,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:42:03,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:42:03,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-28 12:42:03,887 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 12:42:03,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-28 12:42:03,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-28 12:42:03,921 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 12:42:03,922 INFO L225 Difference]: With dead ends: 34 [2022-04-28 12:42:03,923 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 12:42:03,923 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 12:42:03,924 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:42:03,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:42:03,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 12:42:03,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-28 12:42:03,938 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:42:03,939 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 12:42:03,939 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 12:42:03,939 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 12:42:03,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:42:03,941 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-28 12:42:03,941 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-28 12:42:03,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:42:03,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:42:03,942 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states. [2022-04-28 12:42:03,942 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states. [2022-04-28 12:42:03,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:42:03,943 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-28 12:42:03,943 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-28 12:42:03,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:42:03,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:42:03,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:42:03,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:42:03,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 12:42:03,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-28 12:42:03,945 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2022-04-28 12:42:03,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:42:03,946 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-28 12:42:03,946 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 12:42:03,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 31 transitions. [2022-04-28 12:42:03,966 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:42:03,967 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-28 12:42:03,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 12:42:03,967 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:42:03,967 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 12:42:03,991 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 12:42:04,193 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 12:42:04,193 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:42:04,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:42:04,194 INFO L85 PathProgramCache]: Analyzing trace with hash 245526874, now seen corresponding path program 1 times [2022-04-28 12:42:04,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:42:04,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [593952211] [2022-04-28 12:42:04,194 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:42:04,194 INFO L85 PathProgramCache]: Analyzing trace with hash 245526874, now seen corresponding path program 2 times [2022-04-28 12:42:04,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:42:04,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6527662] [2022-04-28 12:42:04,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:42:04,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:42:04,215 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:42:04,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2136898750] [2022-04-28 12:42:04,215 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:42:04,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:42:04,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:42:04,216 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 12:42:04,218 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 12:42:04,264 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 12:42:04,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:42:04,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 12:42:04,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:42:04,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:42:04,696 INFO L272 TraceCheckUtils]: 0: Hoare triple {554#true} call ULTIMATE.init(); {554#true} is VALID [2022-04-28 12:42:04,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {554#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {554#true} is VALID [2022-04-28 12:42:04,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-28 12:42:04,697 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#true} {554#true} #67#return; {554#true} is VALID [2022-04-28 12:42:04,697 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#true} call #t~ret7 := main(); {554#true} is VALID [2022-04-28 12:42:04,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {554#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {554#true} is VALID [2022-04-28 12:42:04,697 INFO L272 TraceCheckUtils]: 6: Hoare triple {554#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {554#true} is VALID [2022-04-28 12:42:04,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {554#true} ~cond := #in~cond; {554#true} is VALID [2022-04-28 12:42:04,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {554#true} assume !(0 == ~cond); {554#true} is VALID [2022-04-28 12:42:04,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-28 12:42:04,697 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {554#true} {554#true} #59#return; {554#true} is VALID [2022-04-28 12:42:04,698 INFO L272 TraceCheckUtils]: 11: Hoare triple {554#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {554#true} is VALID [2022-04-28 12:42:04,698 INFO L290 TraceCheckUtils]: 12: Hoare triple {554#true} ~cond := #in~cond; {554#true} is VALID [2022-04-28 12:42:04,698 INFO L290 TraceCheckUtils]: 13: Hoare triple {554#true} assume !(0 == ~cond); {554#true} is VALID [2022-04-28 12:42:04,698 INFO L290 TraceCheckUtils]: 14: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-28 12:42:04,698 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {554#true} {554#true} #61#return; {554#true} is VALID [2022-04-28 12:42:06,700 WARN L290 TraceCheckUtils]: 16: Hoare triple {554#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {607#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is UNKNOWN [2022-04-28 12:42:06,701 INFO L290 TraceCheckUtils]: 17: Hoare triple {607#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {607#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-28 12:42:06,702 INFO L290 TraceCheckUtils]: 18: Hoare triple {607#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} assume !!(#t~post6 < 5);havoc #t~post6; {607#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-28 12:42:07,019 INFO L272 TraceCheckUtils]: 19: Hoare triple {607#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {617#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:42:07,020 INFO L290 TraceCheckUtils]: 20: Hoare triple {617#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {621#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:42:07,021 INFO L290 TraceCheckUtils]: 21: Hoare triple {621#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {555#false} is VALID [2022-04-28 12:42:07,021 INFO L290 TraceCheckUtils]: 22: Hoare triple {555#false} assume !false; {555#false} is VALID [2022-04-28 12:42:07,021 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 12:42:07,021 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:42:07,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:42:07,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6527662] [2022-04-28 12:42:07,022 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:42:07,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136898750] [2022-04-28 12:42:07,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136898750] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:42:07,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:42:07,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:42:07,023 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:42:07,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [593952211] [2022-04-28 12:42:07,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [593952211] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:42:07,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:42:07,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:42:07,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422767156] [2022-04-28 12:42:07,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:42:07,023 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 12:42:07,024 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:42:07,024 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 12:42:08,850 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 12:42:08,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 12:42:08,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:42:08,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 12:42:08,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 12:42:08,851 INFO L87 Difference]: Start difference. First operand 27 states and 31 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 12:42:10,733 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 12:42:13,585 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 12:42:13,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:42:13,605 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-28 12:42:13,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 12:42:13,606 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 12:42:13,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:42:13,606 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 12:42:13,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-04-28 12:42:13,607 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 12:42:13,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-04-28 12:42:13,608 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 43 transitions. [2022-04-28 12:42:16,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 12:42:16,339 INFO L225 Difference]: With dead ends: 37 [2022-04-28 12:42:16,339 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 12:42:16,339 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 12:42:16,340 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 7 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-04-28 12:42:16,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 82 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2022-04-28 12:42:16,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 12:42:16,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-04-28 12:42:16,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:42:16,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 12:42:16,356 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 12:42:16,356 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 12:42:16,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:42:16,358 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-28 12:42:16,358 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-28 12:42:16,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:42:16,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:42:16,367 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-28 12:42:16,367 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-28 12:42:16,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:42:16,368 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-28 12:42:16,368 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-28 12:42:16,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:42:16,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:42:16,369 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:42:16,369 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:42:16,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 12:42:16,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-04-28 12:42:16,370 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23 [2022-04-28 12:42:16,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:42:16,370 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-04-28 12:42:16,371 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 12:42:16,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 36 transitions. [2022-04-28 12:42:17,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:42:17,952 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-28 12:42:17,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 12:42:17,953 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:42:17,953 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 12:42:17,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-28 12:42:18,153 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 12:42:18,154 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:42:18,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:42:18,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1019533657, now seen corresponding path program 1 times [2022-04-28 12:42:18,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:42:18,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [104764023] [2022-04-28 12:42:18,155 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:42:18,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1019533657, now seen corresponding path program 2 times [2022-04-28 12:42:18,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:42:18,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790645708] [2022-04-28 12:42:18,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:42:18,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:42:18,164 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:42:18,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [59229342] [2022-04-28 12:42:18,165 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:42:18,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:42:18,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:42:18,166 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 12:42:18,166 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 12:42:18,201 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:42:18,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:42:18,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 12:42:18,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:42:18,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:42:18,376 INFO L272 TraceCheckUtils]: 0: Hoare triple {837#true} call ULTIMATE.init(); {837#true} is VALID [2022-04-28 12:42:18,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {837#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; {837#true} is VALID [2022-04-28 12:42:18,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {837#true} assume true; {837#true} is VALID [2022-04-28 12:42:18,376 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {837#true} {837#true} #67#return; {837#true} is VALID [2022-04-28 12:42:18,376 INFO L272 TraceCheckUtils]: 4: Hoare triple {837#true} call #t~ret7 := main(); {837#true} is VALID [2022-04-28 12:42:18,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {837#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; {837#true} is VALID [2022-04-28 12:42:18,379 INFO L272 TraceCheckUtils]: 6: Hoare triple {837#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {837#true} is VALID [2022-04-28 12:42:18,379 INFO L290 TraceCheckUtils]: 7: Hoare triple {837#true} ~cond := #in~cond; {837#true} is VALID [2022-04-28 12:42:18,380 INFO L290 TraceCheckUtils]: 8: Hoare triple {837#true} assume !(0 == ~cond); {837#true} is VALID [2022-04-28 12:42:18,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {837#true} assume true; {837#true} is VALID [2022-04-28 12:42:18,380 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {837#true} {837#true} #59#return; {837#true} is VALID [2022-04-28 12:42:18,380 INFO L272 TraceCheckUtils]: 11: Hoare triple {837#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)); {837#true} is VALID [2022-04-28 12:42:18,380 INFO L290 TraceCheckUtils]: 12: Hoare triple {837#true} ~cond := #in~cond; {837#true} is VALID [2022-04-28 12:42:18,380 INFO L290 TraceCheckUtils]: 13: Hoare triple {837#true} assume !(0 == ~cond); {837#true} is VALID [2022-04-28 12:42:18,380 INFO L290 TraceCheckUtils]: 14: Hoare triple {837#true} assume true; {837#true} is VALID [2022-04-28 12:42:18,380 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {837#true} {837#true} #61#return; {837#true} is VALID [2022-04-28 12:42:18,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {837#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {837#true} is VALID [2022-04-28 12:42:18,381 INFO L290 TraceCheckUtils]: 17: Hoare triple {837#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {837#true} is VALID [2022-04-28 12:42:18,381 INFO L290 TraceCheckUtils]: 18: Hoare triple {837#true} assume !!(#t~post6 < 5);havoc #t~post6; {837#true} is VALID [2022-04-28 12:42:18,382 INFO L272 TraceCheckUtils]: 19: Hoare triple {837#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)); {837#true} is VALID [2022-04-28 12:42:18,383 INFO L290 TraceCheckUtils]: 20: Hoare triple {837#true} ~cond := #in~cond; {902#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:42:18,384 INFO L290 TraceCheckUtils]: 21: Hoare triple {902#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {906#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:42:18,384 INFO L290 TraceCheckUtils]: 22: Hoare triple {906#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {906#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:42:18,385 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {906#(not (= |__VERIFIER_assert_#in~cond| 0))} {837#true} #63#return; {913#(= (+ (* 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 12:42:18,385 INFO L290 TraceCheckUtils]: 24: Hoare triple {913#(= (+ (* 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); {917#(= (+ (* 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 12:42:18,386 INFO L272 TraceCheckUtils]: 25: Hoare triple {917#(= (+ (* 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)); {921#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:42:18,386 INFO L290 TraceCheckUtils]: 26: Hoare triple {921#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {925#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:42:18,387 INFO L290 TraceCheckUtils]: 27: Hoare triple {925#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {838#false} is VALID [2022-04-28 12:42:18,387 INFO L290 TraceCheckUtils]: 28: Hoare triple {838#false} assume !false; {838#false} is VALID [2022-04-28 12:42:18,387 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 12:42:18,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:42:18,815 INFO L290 TraceCheckUtils]: 28: Hoare triple {838#false} assume !false; {838#false} is VALID [2022-04-28 12:42:18,816 INFO L290 TraceCheckUtils]: 27: Hoare triple {925#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {838#false} is VALID [2022-04-28 12:42:18,816 INFO L290 TraceCheckUtils]: 26: Hoare triple {921#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {925#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:42:18,817 INFO L272 TraceCheckUtils]: 25: Hoare triple {917#(= (+ (* 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)); {921#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:42:18,817 INFO L290 TraceCheckUtils]: 24: Hoare triple {944#(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); {917#(= (+ (* 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 12:42:18,818 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {906#(not (= |__VERIFIER_assert_#in~cond| 0))} {837#true} #63#return; {944#(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 12:42:18,818 INFO L290 TraceCheckUtils]: 22: Hoare triple {906#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {906#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:42:18,819 INFO L290 TraceCheckUtils]: 21: Hoare triple {957#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {906#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:42:18,819 INFO L290 TraceCheckUtils]: 20: Hoare triple {837#true} ~cond := #in~cond; {957#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 12:42:18,819 INFO L272 TraceCheckUtils]: 19: Hoare triple {837#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)); {837#true} is VALID [2022-04-28 12:42:18,819 INFO L290 TraceCheckUtils]: 18: Hoare triple {837#true} assume !!(#t~post6 < 5);havoc #t~post6; {837#true} is VALID [2022-04-28 12:42:18,819 INFO L290 TraceCheckUtils]: 17: Hoare triple {837#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {837#true} is VALID [2022-04-28 12:42:18,820 INFO L290 TraceCheckUtils]: 16: Hoare triple {837#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {837#true} is VALID [2022-04-28 12:42:18,820 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {837#true} {837#true} #61#return; {837#true} is VALID [2022-04-28 12:42:18,820 INFO L290 TraceCheckUtils]: 14: Hoare triple {837#true} assume true; {837#true} is VALID [2022-04-28 12:42:18,820 INFO L290 TraceCheckUtils]: 13: Hoare triple {837#true} assume !(0 == ~cond); {837#true} is VALID [2022-04-28 12:42:18,820 INFO L290 TraceCheckUtils]: 12: Hoare triple {837#true} ~cond := #in~cond; {837#true} is VALID [2022-04-28 12:42:18,820 INFO L272 TraceCheckUtils]: 11: Hoare triple {837#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)); {837#true} is VALID [2022-04-28 12:42:18,820 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {837#true} {837#true} #59#return; {837#true} is VALID [2022-04-28 12:42:18,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {837#true} assume true; {837#true} is VALID [2022-04-28 12:42:18,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {837#true} assume !(0 == ~cond); {837#true} is VALID [2022-04-28 12:42:18,820 INFO L290 TraceCheckUtils]: 7: Hoare triple {837#true} ~cond := #in~cond; {837#true} is VALID [2022-04-28 12:42:18,821 INFO L272 TraceCheckUtils]: 6: Hoare triple {837#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {837#true} is VALID [2022-04-28 12:42:18,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {837#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; {837#true} is VALID [2022-04-28 12:42:18,821 INFO L272 TraceCheckUtils]: 4: Hoare triple {837#true} call #t~ret7 := main(); {837#true} is VALID [2022-04-28 12:42:18,821 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {837#true} {837#true} #67#return; {837#true} is VALID [2022-04-28 12:42:18,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {837#true} assume true; {837#true} is VALID [2022-04-28 12:42:18,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {837#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; {837#true} is VALID [2022-04-28 12:42:18,821 INFO L272 TraceCheckUtils]: 0: Hoare triple {837#true} call ULTIMATE.init(); {837#true} is VALID [2022-04-28 12:42:18,821 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 12:42:18,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:42:18,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790645708] [2022-04-28 12:42:18,822 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:42:18,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59229342] [2022-04-28 12:42:18,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59229342] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:42:18,822 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:42:18,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-28 12:42:18,822 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:42:18,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [104764023] [2022-04-28 12:42:18,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [104764023] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:42:18,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:42:18,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 12:42:18,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455867951] [2022-04-28 12:42:18,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:42:18,823 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 12:42:18,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:42:18,823 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 12:42:18,854 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 12:42:18,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 12:42:18,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:42:18,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 12:42:18,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 12:42:18,855 INFO L87 Difference]: Start difference. First operand 32 states and 36 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 12:42:19,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:42:19,144 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-28 12:42:19,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 12:42:19,144 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 12:42:19,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:42:19,144 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 12:42:19,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-28 12:42:19,145 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 12:42:19,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-28 12:42:19,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2022-04-28 12:42:19,179 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 12:42:19,180 INFO L225 Difference]: With dead ends: 39 [2022-04-28 12:42:19,180 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 12:42:19,180 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 12:42:19,181 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:42:19,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 103 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 12:42:19,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 12:42:19,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2022-04-28 12:42:19,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:42:19,201 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 12:42:19,201 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 12:42:19,201 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 12:42:19,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:42:19,203 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-28 12:42:19,203 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-28 12:42:19,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:42:19,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:42:19,205 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-28 12:42:19,206 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-28 12:42:19,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:42:19,208 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-28 12:42:19,208 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-28 12:42:19,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:42:19,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:42:19,208 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:42:19,208 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:42:19,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 12:42:19,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-04-28 12:42:19,210 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 29 [2022-04-28 12:42:19,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:42:19,210 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-04-28 12:42:19,210 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 12:42:19,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 31 transitions. [2022-04-28 12:42:21,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 30 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 12:42:21,244 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-28 12:42:21,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 12:42:21,244 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:42:21,244 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] [2022-04-28 12:42:21,263 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 12:42:21,445 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 12:42:21,445 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:42:21,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:42:21,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1080225052, now seen corresponding path program 1 times [2022-04-28 12:42:21,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:42:21,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [152271785] [2022-04-28 12:42:21,446 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:42:21,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1080225052, now seen corresponding path program 2 times [2022-04-28 12:42:21,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:42:21,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89459069] [2022-04-28 12:42:21,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:42:21,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:42:21,455 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:42:21,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [463161499] [2022-04-28 12:42:21,455 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:42:21,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:42:21,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:42:21,462 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 12:42:21,463 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 12:42:21,501 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:42:21,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:42:21,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 12:42:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:42:21,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:42:21,666 INFO L272 TraceCheckUtils]: 0: Hoare triple {1230#true} call ULTIMATE.init(); {1230#true} is VALID [2022-04-28 12:42:21,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {1230#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; {1238#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:21,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {1238#(<= ~counter~0 0)} assume true; {1238#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:21,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1238#(<= ~counter~0 0)} {1230#true} #67#return; {1238#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:21,668 INFO L272 TraceCheckUtils]: 4: Hoare triple {1238#(<= ~counter~0 0)} call #t~ret7 := main(); {1238#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:21,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {1238#(<= ~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; {1238#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:21,670 INFO L272 TraceCheckUtils]: 6: Hoare triple {1238#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1238#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:21,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {1238#(<= ~counter~0 0)} ~cond := #in~cond; {1238#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:21,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {1238#(<= ~counter~0 0)} assume !(0 == ~cond); {1238#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:21,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {1238#(<= ~counter~0 0)} assume true; {1238#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:21,672 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1238#(<= ~counter~0 0)} {1238#(<= ~counter~0 0)} #59#return; {1238#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:21,672 INFO L272 TraceCheckUtils]: 11: Hoare triple {1238#(<= ~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)); {1238#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:21,673 INFO L290 TraceCheckUtils]: 12: Hoare triple {1238#(<= ~counter~0 0)} ~cond := #in~cond; {1238#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:21,673 INFO L290 TraceCheckUtils]: 13: Hoare triple {1238#(<= ~counter~0 0)} assume !(0 == ~cond); {1238#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:21,673 INFO L290 TraceCheckUtils]: 14: Hoare triple {1238#(<= ~counter~0 0)} assume true; {1238#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:21,674 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1238#(<= ~counter~0 0)} {1238#(<= ~counter~0 0)} #61#return; {1238#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:21,674 INFO L290 TraceCheckUtils]: 16: Hoare triple {1238#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1238#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:21,675 INFO L290 TraceCheckUtils]: 17: Hoare triple {1238#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1287#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:21,675 INFO L290 TraceCheckUtils]: 18: Hoare triple {1287#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {1287#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:21,676 INFO L272 TraceCheckUtils]: 19: Hoare triple {1287#(<= ~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)); {1287#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:21,676 INFO L290 TraceCheckUtils]: 20: Hoare triple {1287#(<= ~counter~0 1)} ~cond := #in~cond; {1287#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:21,677 INFO L290 TraceCheckUtils]: 21: Hoare triple {1287#(<= ~counter~0 1)} assume !(0 == ~cond); {1287#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:21,677 INFO L290 TraceCheckUtils]: 22: Hoare triple {1287#(<= ~counter~0 1)} assume true; {1287#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:21,678 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1287#(<= ~counter~0 1)} {1287#(<= ~counter~0 1)} #63#return; {1287#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:21,678 INFO L290 TraceCheckUtils]: 24: Hoare triple {1287#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1287#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:21,678 INFO L290 TraceCheckUtils]: 25: Hoare triple {1287#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1287#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:21,679 INFO L290 TraceCheckUtils]: 26: Hoare triple {1287#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1315#(<= |main_#t~post6| 1)} is VALID [2022-04-28 12:42:21,679 INFO L290 TraceCheckUtils]: 27: Hoare triple {1315#(<= |main_#t~post6| 1)} assume !(#t~post6 < 5);havoc #t~post6; {1231#false} is VALID [2022-04-28 12:42:21,679 INFO L272 TraceCheckUtils]: 28: Hoare triple {1231#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)); {1231#false} is VALID [2022-04-28 12:42:21,679 INFO L290 TraceCheckUtils]: 29: Hoare triple {1231#false} ~cond := #in~cond; {1231#false} is VALID [2022-04-28 12:42:21,679 INFO L290 TraceCheckUtils]: 30: Hoare triple {1231#false} assume 0 == ~cond; {1231#false} is VALID [2022-04-28 12:42:21,679 INFO L290 TraceCheckUtils]: 31: Hoare triple {1231#false} assume !false; {1231#false} is VALID [2022-04-28 12:42:21,680 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:42:21,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:42:21,830 INFO L290 TraceCheckUtils]: 31: Hoare triple {1231#false} assume !false; {1231#false} is VALID [2022-04-28 12:42:21,830 INFO L290 TraceCheckUtils]: 30: Hoare triple {1231#false} assume 0 == ~cond; {1231#false} is VALID [2022-04-28 12:42:21,830 INFO L290 TraceCheckUtils]: 29: Hoare triple {1231#false} ~cond := #in~cond; {1231#false} is VALID [2022-04-28 12:42:21,830 INFO L272 TraceCheckUtils]: 28: Hoare triple {1231#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)); {1231#false} is VALID [2022-04-28 12:42:21,831 INFO L290 TraceCheckUtils]: 27: Hoare triple {1343#(< |main_#t~post6| 5)} assume !(#t~post6 < 5);havoc #t~post6; {1231#false} is VALID [2022-04-28 12:42:21,831 INFO L290 TraceCheckUtils]: 26: Hoare triple {1347#(< ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1343#(< |main_#t~post6| 5)} is VALID [2022-04-28 12:42:21,831 INFO L290 TraceCheckUtils]: 25: Hoare triple {1347#(< ~counter~0 5)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1347#(< ~counter~0 5)} is VALID [2022-04-28 12:42:21,832 INFO L290 TraceCheckUtils]: 24: Hoare triple {1347#(< ~counter~0 5)} assume !!(0 != ~r~0); {1347#(< ~counter~0 5)} is VALID [2022-04-28 12:42:21,833 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1230#true} {1347#(< ~counter~0 5)} #63#return; {1347#(< ~counter~0 5)} is VALID [2022-04-28 12:42:21,833 INFO L290 TraceCheckUtils]: 22: Hoare triple {1230#true} assume true; {1230#true} is VALID [2022-04-28 12:42:21,833 INFO L290 TraceCheckUtils]: 21: Hoare triple {1230#true} assume !(0 == ~cond); {1230#true} is VALID [2022-04-28 12:42:21,833 INFO L290 TraceCheckUtils]: 20: Hoare triple {1230#true} ~cond := #in~cond; {1230#true} is VALID [2022-04-28 12:42:21,833 INFO L272 TraceCheckUtils]: 19: Hoare triple {1347#(< ~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)); {1230#true} is VALID [2022-04-28 12:42:21,833 INFO L290 TraceCheckUtils]: 18: Hoare triple {1347#(< ~counter~0 5)} assume !!(#t~post6 < 5);havoc #t~post6; {1347#(< ~counter~0 5)} is VALID [2022-04-28 12:42:21,834 INFO L290 TraceCheckUtils]: 17: Hoare triple {1375#(< ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1347#(< ~counter~0 5)} is VALID [2022-04-28 12:42:21,834 INFO L290 TraceCheckUtils]: 16: Hoare triple {1375#(< ~counter~0 4)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1375#(< ~counter~0 4)} is VALID [2022-04-28 12:42:21,835 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1230#true} {1375#(< ~counter~0 4)} #61#return; {1375#(< ~counter~0 4)} is VALID [2022-04-28 12:42:21,835 INFO L290 TraceCheckUtils]: 14: Hoare triple {1230#true} assume true; {1230#true} is VALID [2022-04-28 12:42:21,835 INFO L290 TraceCheckUtils]: 13: Hoare triple {1230#true} assume !(0 == ~cond); {1230#true} is VALID [2022-04-28 12:42:21,835 INFO L290 TraceCheckUtils]: 12: Hoare triple {1230#true} ~cond := #in~cond; {1230#true} is VALID [2022-04-28 12:42:21,835 INFO L272 TraceCheckUtils]: 11: Hoare triple {1375#(< ~counter~0 4)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1230#true} is VALID [2022-04-28 12:42:21,836 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1230#true} {1375#(< ~counter~0 4)} #59#return; {1375#(< ~counter~0 4)} is VALID [2022-04-28 12:42:21,836 INFO L290 TraceCheckUtils]: 9: Hoare triple {1230#true} assume true; {1230#true} is VALID [2022-04-28 12:42:21,836 INFO L290 TraceCheckUtils]: 8: Hoare triple {1230#true} assume !(0 == ~cond); {1230#true} is VALID [2022-04-28 12:42:21,836 INFO L290 TraceCheckUtils]: 7: Hoare triple {1230#true} ~cond := #in~cond; {1230#true} is VALID [2022-04-28 12:42:21,836 INFO L272 TraceCheckUtils]: 6: Hoare triple {1375#(< ~counter~0 4)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1230#true} is VALID [2022-04-28 12:42:21,836 INFO L290 TraceCheckUtils]: 5: Hoare triple {1375#(< ~counter~0 4)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {1375#(< ~counter~0 4)} is VALID [2022-04-28 12:42:21,837 INFO L272 TraceCheckUtils]: 4: Hoare triple {1375#(< ~counter~0 4)} call #t~ret7 := main(); {1375#(< ~counter~0 4)} is VALID [2022-04-28 12:42:21,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1375#(< ~counter~0 4)} {1230#true} #67#return; {1375#(< ~counter~0 4)} is VALID [2022-04-28 12:42:21,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {1375#(< ~counter~0 4)} assume true; {1375#(< ~counter~0 4)} is VALID [2022-04-28 12:42:21,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {1230#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; {1375#(< ~counter~0 4)} is VALID [2022-04-28 12:42:21,838 INFO L272 TraceCheckUtils]: 0: Hoare triple {1230#true} call ULTIMATE.init(); {1230#true} is VALID [2022-04-28 12:42:21,838 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:42:21,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:42:21,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89459069] [2022-04-28 12:42:21,838 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:42:21,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463161499] [2022-04-28 12:42:21,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463161499] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:42:21,838 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:42:21,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-28 12:42:21,839 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:42:21,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [152271785] [2022-04-28 12:42:21,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [152271785] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:42:21,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:42:21,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:42:21,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074246067] [2022-04-28 12:42:21,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:42:21,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 32 [2022-04-28 12:42:21,840 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:42:21,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 12:42:21,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:42:21,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 12:42:21,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:42:21,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 12:42:21,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-28 12:42:21,862 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 12:42:21,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:42:21,951 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2022-04-28 12:42:21,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 12:42:21,951 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 32 [2022-04-28 12:42:21,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:42:21,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 12:42:21,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-28 12:42:21,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 12:42:21,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-28 12:42:21,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2022-04-28 12:42:21,992 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:42:21,993 INFO L225 Difference]: With dead ends: 43 [2022-04-28 12:42:21,993 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 12:42:21,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-28 12:42:21,994 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:42:21,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 78 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:42:21,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 12:42:22,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-28 12:42:22,016 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:42:22,016 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 12:42:22,016 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 12:42:22,016 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 12:42:22,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:42:22,017 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-28 12:42:22,017 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 12:42:22,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:42:22,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:42:22,018 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 38 states. [2022-04-28 12:42:22,018 INFO L87 Difference]: Start difference. First operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 38 states. [2022-04-28 12:42:22,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:42:22,019 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-28 12:42:22,019 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 12:42:22,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:42:22,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:42:22,019 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:42:22,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:42:22,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 12:42:22,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-28 12:42:22,020 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 32 [2022-04-28 12:42:22,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:42:22,020 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-28 12:42:22,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 12:42:22,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 41 transitions. [2022-04-28 12:42:22,718 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 12:42:22,718 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 12:42:22,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 12:42:22,718 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:42:22,719 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:42:22,735 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 12:42:22,919 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 12:42:22,919 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:42:22,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:42:22,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1448743382, now seen corresponding path program 3 times [2022-04-28 12:42:22,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:42:22,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [113989807] [2022-04-28 12:42:22,920 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:42:22,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1448743382, now seen corresponding path program 4 times [2022-04-28 12:42:22,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:42:22,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685609077] [2022-04-28 12:42:22,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:42:22,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:42:22,931 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:42:22,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [781853926] [2022-04-28 12:42:22,931 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:42:22,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:42:22,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:42:22,932 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 12:42:22,933 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 12:42:23,004 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:42:23,004 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:42:23,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 12:42:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:42:23,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:42:23,185 INFO L272 TraceCheckUtils]: 0: Hoare triple {1669#true} call ULTIMATE.init(); {1669#true} is VALID [2022-04-28 12:42:23,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {1669#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; {1677#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:23,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {1677#(<= ~counter~0 0)} assume true; {1677#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:23,187 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1677#(<= ~counter~0 0)} {1669#true} #67#return; {1677#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:23,187 INFO L272 TraceCheckUtils]: 4: Hoare triple {1677#(<= ~counter~0 0)} call #t~ret7 := main(); {1677#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:23,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {1677#(<= ~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; {1677#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:23,188 INFO L272 TraceCheckUtils]: 6: Hoare triple {1677#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1677#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:23,188 INFO L290 TraceCheckUtils]: 7: Hoare triple {1677#(<= ~counter~0 0)} ~cond := #in~cond; {1677#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:23,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {1677#(<= ~counter~0 0)} assume !(0 == ~cond); {1677#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:23,192 INFO L290 TraceCheckUtils]: 9: Hoare triple {1677#(<= ~counter~0 0)} assume true; {1677#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:23,193 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1677#(<= ~counter~0 0)} {1677#(<= ~counter~0 0)} #59#return; {1677#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:23,194 INFO L272 TraceCheckUtils]: 11: Hoare triple {1677#(<= ~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)); {1677#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:23,194 INFO L290 TraceCheckUtils]: 12: Hoare triple {1677#(<= ~counter~0 0)} ~cond := #in~cond; {1677#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:23,194 INFO L290 TraceCheckUtils]: 13: Hoare triple {1677#(<= ~counter~0 0)} assume !(0 == ~cond); {1677#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:23,195 INFO L290 TraceCheckUtils]: 14: Hoare triple {1677#(<= ~counter~0 0)} assume true; {1677#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:23,195 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1677#(<= ~counter~0 0)} {1677#(<= ~counter~0 0)} #61#return; {1677#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:23,195 INFO L290 TraceCheckUtils]: 16: Hoare triple {1677#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1677#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:23,196 INFO L290 TraceCheckUtils]: 17: Hoare triple {1677#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1726#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:23,196 INFO L290 TraceCheckUtils]: 18: Hoare triple {1726#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {1726#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:23,197 INFO L272 TraceCheckUtils]: 19: Hoare triple {1726#(<= ~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)); {1726#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:23,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {1726#(<= ~counter~0 1)} ~cond := #in~cond; {1726#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:23,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {1726#(<= ~counter~0 1)} assume !(0 == ~cond); {1726#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:23,197 INFO L290 TraceCheckUtils]: 22: Hoare triple {1726#(<= ~counter~0 1)} assume true; {1726#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:23,198 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1726#(<= ~counter~0 1)} {1726#(<= ~counter~0 1)} #63#return; {1726#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:23,198 INFO L290 TraceCheckUtils]: 24: Hoare triple {1726#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1726#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:23,199 INFO L290 TraceCheckUtils]: 25: Hoare triple {1726#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1726#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:23,199 INFO L290 TraceCheckUtils]: 26: Hoare triple {1726#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1754#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:23,199 INFO L290 TraceCheckUtils]: 27: Hoare triple {1754#(<= ~counter~0 2)} assume !!(#t~post6 < 5);havoc #t~post6; {1754#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:23,200 INFO L272 TraceCheckUtils]: 28: Hoare triple {1754#(<= ~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)); {1754#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:23,200 INFO L290 TraceCheckUtils]: 29: Hoare triple {1754#(<= ~counter~0 2)} ~cond := #in~cond; {1754#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:23,200 INFO L290 TraceCheckUtils]: 30: Hoare triple {1754#(<= ~counter~0 2)} assume !(0 == ~cond); {1754#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:23,201 INFO L290 TraceCheckUtils]: 31: Hoare triple {1754#(<= ~counter~0 2)} assume true; {1754#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:23,201 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1754#(<= ~counter~0 2)} {1754#(<= ~counter~0 2)} #63#return; {1754#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:23,201 INFO L290 TraceCheckUtils]: 33: Hoare triple {1754#(<= ~counter~0 2)} assume !!(0 != ~r~0); {1754#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:23,202 INFO L290 TraceCheckUtils]: 34: Hoare triple {1754#(<= ~counter~0 2)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1754#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:23,202 INFO L290 TraceCheckUtils]: 35: Hoare triple {1754#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1782#(<= |main_#t~post6| 2)} is VALID [2022-04-28 12:42:23,202 INFO L290 TraceCheckUtils]: 36: Hoare triple {1782#(<= |main_#t~post6| 2)} assume !(#t~post6 < 5);havoc #t~post6; {1670#false} is VALID [2022-04-28 12:42:23,203 INFO L272 TraceCheckUtils]: 37: Hoare triple {1670#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)); {1670#false} is VALID [2022-04-28 12:42:23,203 INFO L290 TraceCheckUtils]: 38: Hoare triple {1670#false} ~cond := #in~cond; {1670#false} is VALID [2022-04-28 12:42:23,203 INFO L290 TraceCheckUtils]: 39: Hoare triple {1670#false} assume 0 == ~cond; {1670#false} is VALID [2022-04-28 12:42:23,203 INFO L290 TraceCheckUtils]: 40: Hoare triple {1670#false} assume !false; {1670#false} is VALID [2022-04-28 12:42:23,204 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:42:23,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:42:23,394 INFO L290 TraceCheckUtils]: 40: Hoare triple {1670#false} assume !false; {1670#false} is VALID [2022-04-28 12:42:23,394 INFO L290 TraceCheckUtils]: 39: Hoare triple {1670#false} assume 0 == ~cond; {1670#false} is VALID [2022-04-28 12:42:23,394 INFO L290 TraceCheckUtils]: 38: Hoare triple {1670#false} ~cond := #in~cond; {1670#false} is VALID [2022-04-28 12:42:23,394 INFO L272 TraceCheckUtils]: 37: Hoare triple {1670#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)); {1670#false} is VALID [2022-04-28 12:42:23,395 INFO L290 TraceCheckUtils]: 36: Hoare triple {1810#(< |main_#t~post6| 5)} assume !(#t~post6 < 5);havoc #t~post6; {1670#false} is VALID [2022-04-28 12:42:23,395 INFO L290 TraceCheckUtils]: 35: Hoare triple {1814#(< ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1810#(< |main_#t~post6| 5)} is VALID [2022-04-28 12:42:23,395 INFO L290 TraceCheckUtils]: 34: Hoare triple {1814#(< ~counter~0 5)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1814#(< ~counter~0 5)} is VALID [2022-04-28 12:42:23,396 INFO L290 TraceCheckUtils]: 33: Hoare triple {1814#(< ~counter~0 5)} assume !!(0 != ~r~0); {1814#(< ~counter~0 5)} is VALID [2022-04-28 12:42:23,396 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1669#true} {1814#(< ~counter~0 5)} #63#return; {1814#(< ~counter~0 5)} is VALID [2022-04-28 12:42:23,396 INFO L290 TraceCheckUtils]: 31: Hoare triple {1669#true} assume true; {1669#true} is VALID [2022-04-28 12:42:23,396 INFO L290 TraceCheckUtils]: 30: Hoare triple {1669#true} assume !(0 == ~cond); {1669#true} is VALID [2022-04-28 12:42:23,396 INFO L290 TraceCheckUtils]: 29: Hoare triple {1669#true} ~cond := #in~cond; {1669#true} is VALID [2022-04-28 12:42:23,397 INFO L272 TraceCheckUtils]: 28: Hoare triple {1814#(< ~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)); {1669#true} is VALID [2022-04-28 12:42:23,397 INFO L290 TraceCheckUtils]: 27: Hoare triple {1814#(< ~counter~0 5)} assume !!(#t~post6 < 5);havoc #t~post6; {1814#(< ~counter~0 5)} is VALID [2022-04-28 12:42:23,398 INFO L290 TraceCheckUtils]: 26: Hoare triple {1842#(< ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1814#(< ~counter~0 5)} is VALID [2022-04-28 12:42:23,400 INFO L290 TraceCheckUtils]: 25: Hoare triple {1842#(< ~counter~0 4)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1842#(< ~counter~0 4)} is VALID [2022-04-28 12:42:23,401 INFO L290 TraceCheckUtils]: 24: Hoare triple {1842#(< ~counter~0 4)} assume !!(0 != ~r~0); {1842#(< ~counter~0 4)} is VALID [2022-04-28 12:42:23,407 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1669#true} {1842#(< ~counter~0 4)} #63#return; {1842#(< ~counter~0 4)} is VALID [2022-04-28 12:42:23,408 INFO L290 TraceCheckUtils]: 22: Hoare triple {1669#true} assume true; {1669#true} is VALID [2022-04-28 12:42:23,408 INFO L290 TraceCheckUtils]: 21: Hoare triple {1669#true} assume !(0 == ~cond); {1669#true} is VALID [2022-04-28 12:42:23,408 INFO L290 TraceCheckUtils]: 20: Hoare triple {1669#true} ~cond := #in~cond; {1669#true} is VALID [2022-04-28 12:42:23,408 INFO L272 TraceCheckUtils]: 19: Hoare triple {1842#(< ~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)); {1669#true} is VALID [2022-04-28 12:42:23,409 INFO L290 TraceCheckUtils]: 18: Hoare triple {1842#(< ~counter~0 4)} assume !!(#t~post6 < 5);havoc #t~post6; {1842#(< ~counter~0 4)} is VALID [2022-04-28 12:42:23,410 INFO L290 TraceCheckUtils]: 17: Hoare triple {1754#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1842#(< ~counter~0 4)} is VALID [2022-04-28 12:42:23,413 INFO L290 TraceCheckUtils]: 16: Hoare triple {1754#(<= ~counter~0 2)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1754#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:23,414 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1669#true} {1754#(<= ~counter~0 2)} #61#return; {1754#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:23,414 INFO L290 TraceCheckUtils]: 14: Hoare triple {1669#true} assume true; {1669#true} is VALID [2022-04-28 12:42:23,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {1669#true} assume !(0 == ~cond); {1669#true} is VALID [2022-04-28 12:42:23,414 INFO L290 TraceCheckUtils]: 12: Hoare triple {1669#true} ~cond := #in~cond; {1669#true} is VALID [2022-04-28 12:42:23,414 INFO L272 TraceCheckUtils]: 11: Hoare triple {1754#(<= ~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)); {1669#true} is VALID [2022-04-28 12:42:23,414 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1669#true} {1754#(<= ~counter~0 2)} #59#return; {1754#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:23,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {1669#true} assume true; {1669#true} is VALID [2022-04-28 12:42:23,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {1669#true} assume !(0 == ~cond); {1669#true} is VALID [2022-04-28 12:42:23,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {1669#true} ~cond := #in~cond; {1669#true} is VALID [2022-04-28 12:42:23,414 INFO L272 TraceCheckUtils]: 6: Hoare triple {1754#(<= ~counter~0 2)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1669#true} is VALID [2022-04-28 12:42:23,415 INFO L290 TraceCheckUtils]: 5: Hoare triple {1754#(<= ~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; {1754#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:23,415 INFO L272 TraceCheckUtils]: 4: Hoare triple {1754#(<= ~counter~0 2)} call #t~ret7 := main(); {1754#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:23,415 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1754#(<= ~counter~0 2)} {1669#true} #67#return; {1754#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:23,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {1754#(<= ~counter~0 2)} assume true; {1754#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:23,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {1669#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; {1754#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:23,416 INFO L272 TraceCheckUtils]: 0: Hoare triple {1669#true} call ULTIMATE.init(); {1669#true} is VALID [2022-04-28 12:42:23,416 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-28 12:42:23,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:42:23,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685609077] [2022-04-28 12:42:23,417 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:42:23,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781853926] [2022-04-28 12:42:23,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781853926] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:42:23,417 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:42:23,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-28 12:42:23,417 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:42:23,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [113989807] [2022-04-28 12:42:23,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [113989807] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:42:23,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:42:23,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 12:42:23,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135206465] [2022-04-28 12:42:23,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:42:23,418 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 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 41 [2022-04-28 12:42:23,418 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:42:23,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 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 12:42:23,452 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 12:42:23,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 12:42:23,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:42:23,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 12:42:23,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-28 12:42:23,454 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 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 12:42:23,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:42:23,577 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-04-28 12:42:23,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 12:42:23,577 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 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 41 [2022-04-28 12:42:23,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:42:23,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 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 12:42:23,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2022-04-28 12:42:23,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 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 12:42:23,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2022-04-28 12:42:23,580 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 55 transitions. [2022-04-28 12:42:23,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:42:23,619 INFO L225 Difference]: With dead ends: 52 [2022-04-28 12:42:23,619 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 12:42:23,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-04-28 12:42:23,622 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 15 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:42:23,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 86 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:42:23,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 12:42:23,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-28 12:42:23,654 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:42:23,654 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 12:42:23,654 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 12:42:23,654 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 12:42:23,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:42:23,656 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-28 12:42:23,656 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-28 12:42:23,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:42:23,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:42:23,657 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 47 states. [2022-04-28 12:42:23,657 INFO L87 Difference]: Start difference. First operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 47 states. [2022-04-28 12:42:23,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:42:23,659 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-28 12:42:23,659 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-28 12:42:23,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:42:23,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:42:23,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:42:23,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:42:23,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 12:42:23,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-04-28 12:42:23,660 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 41 [2022-04-28 12:42:23,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:42:23,661 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-04-28 12:42:23,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 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 12:42:23,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 51 transitions. [2022-04-28 12:42:25,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 50 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 12:42:25,709 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-28 12:42:25,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 12:42:25,710 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:42:25,710 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:42:25,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 12:42:25,910 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 12:42:25,911 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:42:25,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:42:25,911 INFO L85 PathProgramCache]: Analyzing trace with hash -678977956, now seen corresponding path program 5 times [2022-04-28 12:42:25,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:42:25,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1783297271] [2022-04-28 12:42:25,912 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:42:25,912 INFO L85 PathProgramCache]: Analyzing trace with hash -678977956, now seen corresponding path program 6 times [2022-04-28 12:42:25,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:42:25,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162296357] [2022-04-28 12:42:25,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:42:25,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:42:25,941 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:42:25,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1987059997] [2022-04-28 12:42:25,942 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 12:42:25,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:42:25,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:42:25,943 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 12:42:25,951 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 12:42:26,005 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 12:42:26,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:42:26,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 12:42:26,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:42:26,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:42:26,246 INFO L272 TraceCheckUtils]: 0: Hoare triple {2219#true} call ULTIMATE.init(); {2219#true} is VALID [2022-04-28 12:42:26,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {2219#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; {2227#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:26,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {2227#(<= ~counter~0 0)} assume true; {2227#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:26,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2227#(<= ~counter~0 0)} {2219#true} #67#return; {2227#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:26,247 INFO L272 TraceCheckUtils]: 4: Hoare triple {2227#(<= ~counter~0 0)} call #t~ret7 := main(); {2227#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:26,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {2227#(<= ~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; {2227#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:26,248 INFO L272 TraceCheckUtils]: 6: Hoare triple {2227#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2227#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:26,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {2227#(<= ~counter~0 0)} ~cond := #in~cond; {2227#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:26,249 INFO L290 TraceCheckUtils]: 8: Hoare triple {2227#(<= ~counter~0 0)} assume !(0 == ~cond); {2227#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:26,249 INFO L290 TraceCheckUtils]: 9: Hoare triple {2227#(<= ~counter~0 0)} assume true; {2227#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:26,250 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2227#(<= ~counter~0 0)} {2227#(<= ~counter~0 0)} #59#return; {2227#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:26,250 INFO L272 TraceCheckUtils]: 11: Hoare triple {2227#(<= ~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)); {2227#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:26,250 INFO L290 TraceCheckUtils]: 12: Hoare triple {2227#(<= ~counter~0 0)} ~cond := #in~cond; {2227#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:26,251 INFO L290 TraceCheckUtils]: 13: Hoare triple {2227#(<= ~counter~0 0)} assume !(0 == ~cond); {2227#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:26,251 INFO L290 TraceCheckUtils]: 14: Hoare triple {2227#(<= ~counter~0 0)} assume true; {2227#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:26,251 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2227#(<= ~counter~0 0)} {2227#(<= ~counter~0 0)} #61#return; {2227#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:26,252 INFO L290 TraceCheckUtils]: 16: Hoare triple {2227#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2227#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:26,253 INFO L290 TraceCheckUtils]: 17: Hoare triple {2227#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2276#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:26,253 INFO L290 TraceCheckUtils]: 18: Hoare triple {2276#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {2276#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:26,254 INFO L272 TraceCheckUtils]: 19: Hoare triple {2276#(<= ~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)); {2276#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:26,254 INFO L290 TraceCheckUtils]: 20: Hoare triple {2276#(<= ~counter~0 1)} ~cond := #in~cond; {2276#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:26,254 INFO L290 TraceCheckUtils]: 21: Hoare triple {2276#(<= ~counter~0 1)} assume !(0 == ~cond); {2276#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:26,254 INFO L290 TraceCheckUtils]: 22: Hoare triple {2276#(<= ~counter~0 1)} assume true; {2276#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:26,255 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2276#(<= ~counter~0 1)} {2276#(<= ~counter~0 1)} #63#return; {2276#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:26,256 INFO L290 TraceCheckUtils]: 24: Hoare triple {2276#(<= ~counter~0 1)} assume !!(0 != ~r~0); {2276#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:26,256 INFO L290 TraceCheckUtils]: 25: Hoare triple {2276#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2276#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:26,256 INFO L290 TraceCheckUtils]: 26: Hoare triple {2276#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2304#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:26,257 INFO L290 TraceCheckUtils]: 27: Hoare triple {2304#(<= ~counter~0 2)} assume !!(#t~post6 < 5);havoc #t~post6; {2304#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:26,257 INFO L272 TraceCheckUtils]: 28: Hoare triple {2304#(<= ~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)); {2304#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:26,257 INFO L290 TraceCheckUtils]: 29: Hoare triple {2304#(<= ~counter~0 2)} ~cond := #in~cond; {2304#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:26,258 INFO L290 TraceCheckUtils]: 30: Hoare triple {2304#(<= ~counter~0 2)} assume !(0 == ~cond); {2304#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:26,258 INFO L290 TraceCheckUtils]: 31: Hoare triple {2304#(<= ~counter~0 2)} assume true; {2304#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:26,259 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2304#(<= ~counter~0 2)} {2304#(<= ~counter~0 2)} #63#return; {2304#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:26,259 INFO L290 TraceCheckUtils]: 33: Hoare triple {2304#(<= ~counter~0 2)} assume !!(0 != ~r~0); {2304#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:26,259 INFO L290 TraceCheckUtils]: 34: Hoare triple {2304#(<= ~counter~0 2)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2304#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:26,260 INFO L290 TraceCheckUtils]: 35: Hoare triple {2304#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2332#(<= ~counter~0 3)} is VALID [2022-04-28 12:42:26,260 INFO L290 TraceCheckUtils]: 36: Hoare triple {2332#(<= ~counter~0 3)} assume !!(#t~post6 < 5);havoc #t~post6; {2332#(<= ~counter~0 3)} is VALID [2022-04-28 12:42:26,260 INFO L272 TraceCheckUtils]: 37: Hoare triple {2332#(<= ~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)); {2332#(<= ~counter~0 3)} is VALID [2022-04-28 12:42:26,261 INFO L290 TraceCheckUtils]: 38: Hoare triple {2332#(<= ~counter~0 3)} ~cond := #in~cond; {2332#(<= ~counter~0 3)} is VALID [2022-04-28 12:42:26,261 INFO L290 TraceCheckUtils]: 39: Hoare triple {2332#(<= ~counter~0 3)} assume !(0 == ~cond); {2332#(<= ~counter~0 3)} is VALID [2022-04-28 12:42:26,261 INFO L290 TraceCheckUtils]: 40: Hoare triple {2332#(<= ~counter~0 3)} assume true; {2332#(<= ~counter~0 3)} is VALID [2022-04-28 12:42:26,262 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2332#(<= ~counter~0 3)} {2332#(<= ~counter~0 3)} #63#return; {2332#(<= ~counter~0 3)} is VALID [2022-04-28 12:42:26,262 INFO L290 TraceCheckUtils]: 42: Hoare triple {2332#(<= ~counter~0 3)} assume !!(0 != ~r~0); {2332#(<= ~counter~0 3)} is VALID [2022-04-28 12:42:26,262 INFO L290 TraceCheckUtils]: 43: Hoare triple {2332#(<= ~counter~0 3)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2332#(<= ~counter~0 3)} is VALID [2022-04-28 12:42:26,263 INFO L290 TraceCheckUtils]: 44: Hoare triple {2332#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2360#(<= |main_#t~post6| 3)} is VALID [2022-04-28 12:42:26,263 INFO L290 TraceCheckUtils]: 45: Hoare triple {2360#(<= |main_#t~post6| 3)} assume !(#t~post6 < 5);havoc #t~post6; {2220#false} is VALID [2022-04-28 12:42:26,263 INFO L272 TraceCheckUtils]: 46: Hoare triple {2220#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)); {2220#false} is VALID [2022-04-28 12:42:26,263 INFO L290 TraceCheckUtils]: 47: Hoare triple {2220#false} ~cond := #in~cond; {2220#false} is VALID [2022-04-28 12:42:26,263 INFO L290 TraceCheckUtils]: 48: Hoare triple {2220#false} assume 0 == ~cond; {2220#false} is VALID [2022-04-28 12:42:26,263 INFO L290 TraceCheckUtils]: 49: Hoare triple {2220#false} assume !false; {2220#false} is VALID [2022-04-28 12:42:26,263 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:42:26,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:42:26,485 INFO L290 TraceCheckUtils]: 49: Hoare triple {2220#false} assume !false; {2220#false} is VALID [2022-04-28 12:42:26,494 INFO L290 TraceCheckUtils]: 48: Hoare triple {2220#false} assume 0 == ~cond; {2220#false} is VALID [2022-04-28 12:42:26,494 INFO L290 TraceCheckUtils]: 47: Hoare triple {2220#false} ~cond := #in~cond; {2220#false} is VALID [2022-04-28 12:42:26,494 INFO L272 TraceCheckUtils]: 46: Hoare triple {2220#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)); {2220#false} is VALID [2022-04-28 12:42:26,495 INFO L290 TraceCheckUtils]: 45: Hoare triple {2388#(< |main_#t~post6| 5)} assume !(#t~post6 < 5);havoc #t~post6; {2220#false} is VALID [2022-04-28 12:42:26,496 INFO L290 TraceCheckUtils]: 44: Hoare triple {2392#(< ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2388#(< |main_#t~post6| 5)} is VALID [2022-04-28 12:42:26,496 INFO L290 TraceCheckUtils]: 43: Hoare triple {2392#(< ~counter~0 5)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2392#(< ~counter~0 5)} is VALID [2022-04-28 12:42:26,496 INFO L290 TraceCheckUtils]: 42: Hoare triple {2392#(< ~counter~0 5)} assume !!(0 != ~r~0); {2392#(< ~counter~0 5)} is VALID [2022-04-28 12:42:26,497 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2219#true} {2392#(< ~counter~0 5)} #63#return; {2392#(< ~counter~0 5)} is VALID [2022-04-28 12:42:26,497 INFO L290 TraceCheckUtils]: 40: Hoare triple {2219#true} assume true; {2219#true} is VALID [2022-04-28 12:42:26,497 INFO L290 TraceCheckUtils]: 39: Hoare triple {2219#true} assume !(0 == ~cond); {2219#true} is VALID [2022-04-28 12:42:26,497 INFO L290 TraceCheckUtils]: 38: Hoare triple {2219#true} ~cond := #in~cond; {2219#true} is VALID [2022-04-28 12:42:26,497 INFO L272 TraceCheckUtils]: 37: Hoare triple {2392#(< ~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)); {2219#true} is VALID [2022-04-28 12:42:26,497 INFO L290 TraceCheckUtils]: 36: Hoare triple {2392#(< ~counter~0 5)} assume !!(#t~post6 < 5);havoc #t~post6; {2392#(< ~counter~0 5)} is VALID [2022-04-28 12:42:26,498 INFO L290 TraceCheckUtils]: 35: Hoare triple {2332#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2392#(< ~counter~0 5)} is VALID [2022-04-28 12:42:26,498 INFO L290 TraceCheckUtils]: 34: Hoare triple {2332#(<= ~counter~0 3)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2332#(<= ~counter~0 3)} is VALID [2022-04-28 12:42:26,498 INFO L290 TraceCheckUtils]: 33: Hoare triple {2332#(<= ~counter~0 3)} assume !!(0 != ~r~0); {2332#(<= ~counter~0 3)} is VALID [2022-04-28 12:42:26,499 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2219#true} {2332#(<= ~counter~0 3)} #63#return; {2332#(<= ~counter~0 3)} is VALID [2022-04-28 12:42:26,499 INFO L290 TraceCheckUtils]: 31: Hoare triple {2219#true} assume true; {2219#true} is VALID [2022-04-28 12:42:26,499 INFO L290 TraceCheckUtils]: 30: Hoare triple {2219#true} assume !(0 == ~cond); {2219#true} is VALID [2022-04-28 12:42:26,499 INFO L290 TraceCheckUtils]: 29: Hoare triple {2219#true} ~cond := #in~cond; {2219#true} is VALID [2022-04-28 12:42:26,499 INFO L272 TraceCheckUtils]: 28: Hoare triple {2332#(<= ~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)); {2219#true} is VALID [2022-04-28 12:42:26,499 INFO L290 TraceCheckUtils]: 27: Hoare triple {2332#(<= ~counter~0 3)} assume !!(#t~post6 < 5);havoc #t~post6; {2332#(<= ~counter~0 3)} is VALID [2022-04-28 12:42:26,500 INFO L290 TraceCheckUtils]: 26: Hoare triple {2304#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2332#(<= ~counter~0 3)} is VALID [2022-04-28 12:42:26,500 INFO L290 TraceCheckUtils]: 25: Hoare triple {2304#(<= ~counter~0 2)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2304#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:26,500 INFO L290 TraceCheckUtils]: 24: Hoare triple {2304#(<= ~counter~0 2)} assume !!(0 != ~r~0); {2304#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:26,501 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2219#true} {2304#(<= ~counter~0 2)} #63#return; {2304#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:26,501 INFO L290 TraceCheckUtils]: 22: Hoare triple {2219#true} assume true; {2219#true} is VALID [2022-04-28 12:42:26,501 INFO L290 TraceCheckUtils]: 21: Hoare triple {2219#true} assume !(0 == ~cond); {2219#true} is VALID [2022-04-28 12:42:26,501 INFO L290 TraceCheckUtils]: 20: Hoare triple {2219#true} ~cond := #in~cond; {2219#true} is VALID [2022-04-28 12:42:26,501 INFO L272 TraceCheckUtils]: 19: Hoare triple {2304#(<= ~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)); {2219#true} is VALID [2022-04-28 12:42:26,501 INFO L290 TraceCheckUtils]: 18: Hoare triple {2304#(<= ~counter~0 2)} assume !!(#t~post6 < 5);havoc #t~post6; {2304#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:26,502 INFO L290 TraceCheckUtils]: 17: Hoare triple {2276#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2304#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:26,502 INFO L290 TraceCheckUtils]: 16: Hoare triple {2276#(<= ~counter~0 1)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2276#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:26,503 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2219#true} {2276#(<= ~counter~0 1)} #61#return; {2276#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:26,503 INFO L290 TraceCheckUtils]: 14: Hoare triple {2219#true} assume true; {2219#true} is VALID [2022-04-28 12:42:26,503 INFO L290 TraceCheckUtils]: 13: Hoare triple {2219#true} assume !(0 == ~cond); {2219#true} is VALID [2022-04-28 12:42:26,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {2219#true} ~cond := #in~cond; {2219#true} is VALID [2022-04-28 12:42:26,503 INFO L272 TraceCheckUtils]: 11: Hoare triple {2276#(<= ~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)); {2219#true} is VALID [2022-04-28 12:42:26,503 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2219#true} {2276#(<= ~counter~0 1)} #59#return; {2276#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:26,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {2219#true} assume true; {2219#true} is VALID [2022-04-28 12:42:26,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {2219#true} assume !(0 == ~cond); {2219#true} is VALID [2022-04-28 12:42:26,504 INFO L290 TraceCheckUtils]: 7: Hoare triple {2219#true} ~cond := #in~cond; {2219#true} is VALID [2022-04-28 12:42:26,504 INFO L272 TraceCheckUtils]: 6: Hoare triple {2276#(<= ~counter~0 1)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2219#true} is VALID [2022-04-28 12:42:26,504 INFO L290 TraceCheckUtils]: 5: Hoare triple {2276#(<= ~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; {2276#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:26,504 INFO L272 TraceCheckUtils]: 4: Hoare triple {2276#(<= ~counter~0 1)} call #t~ret7 := main(); {2276#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:26,505 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2276#(<= ~counter~0 1)} {2219#true} #67#return; {2276#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:26,505 INFO L290 TraceCheckUtils]: 2: Hoare triple {2276#(<= ~counter~0 1)} assume true; {2276#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:26,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {2219#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; {2276#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:26,505 INFO L272 TraceCheckUtils]: 0: Hoare triple {2219#true} call ULTIMATE.init(); {2219#true} is VALID [2022-04-28 12:42:26,506 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 12:42:26,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:42:26,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162296357] [2022-04-28 12:42:26,506 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:42:26,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987059997] [2022-04-28 12:42:26,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987059997] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:42:26,506 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:42:26,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-28 12:42:26,506 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:42:26,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1783297271] [2022-04-28 12:42:26,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1783297271] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:42:26,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:42:26,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 12:42:26,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738417211] [2022-04-28 12:42:26,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:42:26,507 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 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 50 [2022-04-28 12:42:26,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:42:26,507 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 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 12:42:26,543 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 12:42:26,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 12:42:26,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:42:26,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 12:42:26,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-28 12:42:26,544 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 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 12:42:26,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:42:26,694 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2022-04-28 12:42:26,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 12:42:26,694 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 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 50 [2022-04-28 12:42:26,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:42:26,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 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 12:42:26,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 65 transitions. [2022-04-28 12:42:26,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 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 12:42:26,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 65 transitions. [2022-04-28 12:42:26,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 65 transitions. [2022-04-28 12:42:26,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:42:26,743 INFO L225 Difference]: With dead ends: 61 [2022-04-28 12:42:26,743 INFO L226 Difference]: Without dead ends: 56 [2022-04-28 12:42:26,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-28 12:42:26,743 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 17 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:42:26,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 88 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:42:26,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-28 12:42:26,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-28 12:42:26,783 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:42:26,783 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 12:42:26,784 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 12:42:26,784 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 12:42:26,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:42:26,785 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-28 12:42:26,785 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-28 12:42:26,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:42:26,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:42:26,785 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 56 states. [2022-04-28 12:42:26,786 INFO L87 Difference]: Start difference. First operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 56 states. [2022-04-28 12:42:26,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:42:26,787 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-28 12:42:26,787 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-28 12:42:26,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:42:26,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:42:26,787 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:42:26,787 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:42:26,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 12:42:26,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-04-28 12:42:26,789 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 50 [2022-04-28 12:42:26,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:42:26,789 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-04-28 12:42:26,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 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 12:42:26,789 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 61 transitions. [2022-04-28 12:42:27,225 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:42:27,225 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-28 12:42:27,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 12:42:27,226 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:42:27,226 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:42:27,244 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 12:42:27,430 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 12:42:27,430 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:42:27,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:42:27,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1632159894, now seen corresponding path program 7 times [2022-04-28 12:42:27,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:42:27,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [289355994] [2022-04-28 12:42:27,431 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:42:27,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1632159894, now seen corresponding path program 8 times [2022-04-28 12:42:27,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:42:27,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554369575] [2022-04-28 12:42:27,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:42:27,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:42:27,442 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:42:27,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [791261649] [2022-04-28 12:42:27,442 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:42:27,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:42:27,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:42:27,443 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 12:42:27,455 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 12:42:27,493 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:42:27,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:42:27,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 12:42:27,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:42:27,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:42:27,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {2879#true} call ULTIMATE.init(); {2879#true} is VALID [2022-04-28 12:42:27,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {2879#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; {2887#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:27,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {2887#(<= ~counter~0 0)} assume true; {2887#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:27,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2887#(<= ~counter~0 0)} {2879#true} #67#return; {2887#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:27,773 INFO L272 TraceCheckUtils]: 4: Hoare triple {2887#(<= ~counter~0 0)} call #t~ret7 := main(); {2887#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:27,773 INFO L290 TraceCheckUtils]: 5: Hoare triple {2887#(<= ~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; {2887#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:27,773 INFO L272 TraceCheckUtils]: 6: Hoare triple {2887#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2887#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:27,774 INFO L290 TraceCheckUtils]: 7: Hoare triple {2887#(<= ~counter~0 0)} ~cond := #in~cond; {2887#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:27,774 INFO L290 TraceCheckUtils]: 8: Hoare triple {2887#(<= ~counter~0 0)} assume !(0 == ~cond); {2887#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:27,774 INFO L290 TraceCheckUtils]: 9: Hoare triple {2887#(<= ~counter~0 0)} assume true; {2887#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:27,775 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2887#(<= ~counter~0 0)} {2887#(<= ~counter~0 0)} #59#return; {2887#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:27,775 INFO L272 TraceCheckUtils]: 11: Hoare triple {2887#(<= ~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)); {2887#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:27,775 INFO L290 TraceCheckUtils]: 12: Hoare triple {2887#(<= ~counter~0 0)} ~cond := #in~cond; {2887#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:27,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {2887#(<= ~counter~0 0)} assume !(0 == ~cond); {2887#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:27,776 INFO L290 TraceCheckUtils]: 14: Hoare triple {2887#(<= ~counter~0 0)} assume true; {2887#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:27,776 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2887#(<= ~counter~0 0)} {2887#(<= ~counter~0 0)} #61#return; {2887#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:27,776 INFO L290 TraceCheckUtils]: 16: Hoare triple {2887#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2887#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:27,777 INFO L290 TraceCheckUtils]: 17: Hoare triple {2887#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2936#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:27,777 INFO L290 TraceCheckUtils]: 18: Hoare triple {2936#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {2936#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:27,778 INFO L272 TraceCheckUtils]: 19: Hoare triple {2936#(<= ~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)); {2936#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:27,778 INFO L290 TraceCheckUtils]: 20: Hoare triple {2936#(<= ~counter~0 1)} ~cond := #in~cond; {2936#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:27,778 INFO L290 TraceCheckUtils]: 21: Hoare triple {2936#(<= ~counter~0 1)} assume !(0 == ~cond); {2936#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:27,779 INFO L290 TraceCheckUtils]: 22: Hoare triple {2936#(<= ~counter~0 1)} assume true; {2936#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:27,779 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2936#(<= ~counter~0 1)} {2936#(<= ~counter~0 1)} #63#return; {2936#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:27,779 INFO L290 TraceCheckUtils]: 24: Hoare triple {2936#(<= ~counter~0 1)} assume !!(0 != ~r~0); {2936#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:27,780 INFO L290 TraceCheckUtils]: 25: Hoare triple {2936#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2936#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:27,780 INFO L290 TraceCheckUtils]: 26: Hoare triple {2936#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2964#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:27,780 INFO L290 TraceCheckUtils]: 27: Hoare triple {2964#(<= ~counter~0 2)} assume !!(#t~post6 < 5);havoc #t~post6; {2964#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:27,781 INFO L272 TraceCheckUtils]: 28: Hoare triple {2964#(<= ~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)); {2964#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:27,781 INFO L290 TraceCheckUtils]: 29: Hoare triple {2964#(<= ~counter~0 2)} ~cond := #in~cond; {2964#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:27,781 INFO L290 TraceCheckUtils]: 30: Hoare triple {2964#(<= ~counter~0 2)} assume !(0 == ~cond); {2964#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:27,781 INFO L290 TraceCheckUtils]: 31: Hoare triple {2964#(<= ~counter~0 2)} assume true; {2964#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:27,782 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2964#(<= ~counter~0 2)} {2964#(<= ~counter~0 2)} #63#return; {2964#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:27,782 INFO L290 TraceCheckUtils]: 33: Hoare triple {2964#(<= ~counter~0 2)} assume !!(0 != ~r~0); {2964#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:27,782 INFO L290 TraceCheckUtils]: 34: Hoare triple {2964#(<= ~counter~0 2)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2964#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:27,783 INFO L290 TraceCheckUtils]: 35: Hoare triple {2964#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2992#(<= ~counter~0 3)} is VALID [2022-04-28 12:42:27,783 INFO L290 TraceCheckUtils]: 36: Hoare triple {2992#(<= ~counter~0 3)} assume !!(#t~post6 < 5);havoc #t~post6; {2992#(<= ~counter~0 3)} is VALID [2022-04-28 12:42:27,784 INFO L272 TraceCheckUtils]: 37: Hoare triple {2992#(<= ~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)); {2992#(<= ~counter~0 3)} is VALID [2022-04-28 12:42:27,784 INFO L290 TraceCheckUtils]: 38: Hoare triple {2992#(<= ~counter~0 3)} ~cond := #in~cond; {2992#(<= ~counter~0 3)} is VALID [2022-04-28 12:42:27,784 INFO L290 TraceCheckUtils]: 39: Hoare triple {2992#(<= ~counter~0 3)} assume !(0 == ~cond); {2992#(<= ~counter~0 3)} is VALID [2022-04-28 12:42:27,784 INFO L290 TraceCheckUtils]: 40: Hoare triple {2992#(<= ~counter~0 3)} assume true; {2992#(<= ~counter~0 3)} is VALID [2022-04-28 12:42:27,785 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2992#(<= ~counter~0 3)} {2992#(<= ~counter~0 3)} #63#return; {2992#(<= ~counter~0 3)} is VALID [2022-04-28 12:42:27,785 INFO L290 TraceCheckUtils]: 42: Hoare triple {2992#(<= ~counter~0 3)} assume !!(0 != ~r~0); {2992#(<= ~counter~0 3)} is VALID [2022-04-28 12:42:27,785 INFO L290 TraceCheckUtils]: 43: Hoare triple {2992#(<= ~counter~0 3)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2992#(<= ~counter~0 3)} is VALID [2022-04-28 12:42:27,786 INFO L290 TraceCheckUtils]: 44: Hoare triple {2992#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3020#(<= ~counter~0 4)} is VALID [2022-04-28 12:42:27,786 INFO L290 TraceCheckUtils]: 45: Hoare triple {3020#(<= ~counter~0 4)} assume !!(#t~post6 < 5);havoc #t~post6; {3020#(<= ~counter~0 4)} is VALID [2022-04-28 12:42:27,787 INFO L272 TraceCheckUtils]: 46: Hoare triple {3020#(<= ~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)); {3020#(<= ~counter~0 4)} is VALID [2022-04-28 12:42:27,787 INFO L290 TraceCheckUtils]: 47: Hoare triple {3020#(<= ~counter~0 4)} ~cond := #in~cond; {3020#(<= ~counter~0 4)} is VALID [2022-04-28 12:42:27,787 INFO L290 TraceCheckUtils]: 48: Hoare triple {3020#(<= ~counter~0 4)} assume !(0 == ~cond); {3020#(<= ~counter~0 4)} is VALID [2022-04-28 12:42:27,787 INFO L290 TraceCheckUtils]: 49: Hoare triple {3020#(<= ~counter~0 4)} assume true; {3020#(<= ~counter~0 4)} is VALID [2022-04-28 12:42:27,788 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3020#(<= ~counter~0 4)} {3020#(<= ~counter~0 4)} #63#return; {3020#(<= ~counter~0 4)} is VALID [2022-04-28 12:42:27,788 INFO L290 TraceCheckUtils]: 51: Hoare triple {3020#(<= ~counter~0 4)} assume !!(0 != ~r~0); {3020#(<= ~counter~0 4)} is VALID [2022-04-28 12:42:27,788 INFO L290 TraceCheckUtils]: 52: Hoare triple {3020#(<= ~counter~0 4)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {3020#(<= ~counter~0 4)} is VALID [2022-04-28 12:42:27,789 INFO L290 TraceCheckUtils]: 53: Hoare triple {3020#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3048#(<= |main_#t~post6| 4)} is VALID [2022-04-28 12:42:27,789 INFO L290 TraceCheckUtils]: 54: Hoare triple {3048#(<= |main_#t~post6| 4)} assume !(#t~post6 < 5);havoc #t~post6; {2880#false} is VALID [2022-04-28 12:42:27,789 INFO L272 TraceCheckUtils]: 55: Hoare triple {2880#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)); {2880#false} is VALID [2022-04-28 12:42:27,789 INFO L290 TraceCheckUtils]: 56: Hoare triple {2880#false} ~cond := #in~cond; {2880#false} is VALID [2022-04-28 12:42:27,789 INFO L290 TraceCheckUtils]: 57: Hoare triple {2880#false} assume 0 == ~cond; {2880#false} is VALID [2022-04-28 12:42:27,789 INFO L290 TraceCheckUtils]: 58: Hoare triple {2880#false} assume !false; {2880#false} is VALID [2022-04-28 12:42:27,790 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:42:27,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:42:28,028 INFO L290 TraceCheckUtils]: 58: Hoare triple {2880#false} assume !false; {2880#false} is VALID [2022-04-28 12:42:28,028 INFO L290 TraceCheckUtils]: 57: Hoare triple {2880#false} assume 0 == ~cond; {2880#false} is VALID [2022-04-28 12:42:28,028 INFO L290 TraceCheckUtils]: 56: Hoare triple {2880#false} ~cond := #in~cond; {2880#false} is VALID [2022-04-28 12:42:28,028 INFO L272 TraceCheckUtils]: 55: Hoare triple {2880#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)); {2880#false} is VALID [2022-04-28 12:42:28,029 INFO L290 TraceCheckUtils]: 54: Hoare triple {3048#(<= |main_#t~post6| 4)} assume !(#t~post6 < 5);havoc #t~post6; {2880#false} is VALID [2022-04-28 12:42:28,029 INFO L290 TraceCheckUtils]: 53: Hoare triple {3020#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3048#(<= |main_#t~post6| 4)} is VALID [2022-04-28 12:42:28,029 INFO L290 TraceCheckUtils]: 52: Hoare triple {3020#(<= ~counter~0 4)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {3020#(<= ~counter~0 4)} is VALID [2022-04-28 12:42:28,029 INFO L290 TraceCheckUtils]: 51: Hoare triple {3020#(<= ~counter~0 4)} assume !!(0 != ~r~0); {3020#(<= ~counter~0 4)} is VALID [2022-04-28 12:42:28,030 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2879#true} {3020#(<= ~counter~0 4)} #63#return; {3020#(<= ~counter~0 4)} is VALID [2022-04-28 12:42:28,030 INFO L290 TraceCheckUtils]: 49: Hoare triple {2879#true} assume true; {2879#true} is VALID [2022-04-28 12:42:28,030 INFO L290 TraceCheckUtils]: 48: Hoare triple {2879#true} assume !(0 == ~cond); {2879#true} is VALID [2022-04-28 12:42:28,030 INFO L290 TraceCheckUtils]: 47: Hoare triple {2879#true} ~cond := #in~cond; {2879#true} is VALID [2022-04-28 12:42:28,030 INFO L272 TraceCheckUtils]: 46: Hoare triple {3020#(<= ~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)); {2879#true} is VALID [2022-04-28 12:42:28,031 INFO L290 TraceCheckUtils]: 45: Hoare triple {3020#(<= ~counter~0 4)} assume !!(#t~post6 < 5);havoc #t~post6; {3020#(<= ~counter~0 4)} is VALID [2022-04-28 12:42:28,031 INFO L290 TraceCheckUtils]: 44: Hoare triple {2992#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3020#(<= ~counter~0 4)} is VALID [2022-04-28 12:42:28,031 INFO L290 TraceCheckUtils]: 43: Hoare triple {2992#(<= ~counter~0 3)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2992#(<= ~counter~0 3)} is VALID [2022-04-28 12:42:28,031 INFO L290 TraceCheckUtils]: 42: Hoare triple {2992#(<= ~counter~0 3)} assume !!(0 != ~r~0); {2992#(<= ~counter~0 3)} is VALID [2022-04-28 12:42:28,032 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2879#true} {2992#(<= ~counter~0 3)} #63#return; {2992#(<= ~counter~0 3)} is VALID [2022-04-28 12:42:28,032 INFO L290 TraceCheckUtils]: 40: Hoare triple {2879#true} assume true; {2879#true} is VALID [2022-04-28 12:42:28,032 INFO L290 TraceCheckUtils]: 39: Hoare triple {2879#true} assume !(0 == ~cond); {2879#true} is VALID [2022-04-28 12:42:28,032 INFO L290 TraceCheckUtils]: 38: Hoare triple {2879#true} ~cond := #in~cond; {2879#true} is VALID [2022-04-28 12:42:28,032 INFO L272 TraceCheckUtils]: 37: Hoare triple {2992#(<= ~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)); {2879#true} is VALID [2022-04-28 12:42:28,032 INFO L290 TraceCheckUtils]: 36: Hoare triple {2992#(<= ~counter~0 3)} assume !!(#t~post6 < 5);havoc #t~post6; {2992#(<= ~counter~0 3)} is VALID [2022-04-28 12:42:28,037 INFO L290 TraceCheckUtils]: 35: Hoare triple {2964#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2992#(<= ~counter~0 3)} is VALID [2022-04-28 12:42:28,037 INFO L290 TraceCheckUtils]: 34: Hoare triple {2964#(<= ~counter~0 2)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2964#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:28,037 INFO L290 TraceCheckUtils]: 33: Hoare triple {2964#(<= ~counter~0 2)} assume !!(0 != ~r~0); {2964#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:28,038 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2879#true} {2964#(<= ~counter~0 2)} #63#return; {2964#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:28,038 INFO L290 TraceCheckUtils]: 31: Hoare triple {2879#true} assume true; {2879#true} is VALID [2022-04-28 12:42:28,038 INFO L290 TraceCheckUtils]: 30: Hoare triple {2879#true} assume !(0 == ~cond); {2879#true} is VALID [2022-04-28 12:42:28,038 INFO L290 TraceCheckUtils]: 29: Hoare triple {2879#true} ~cond := #in~cond; {2879#true} is VALID [2022-04-28 12:42:28,038 INFO L272 TraceCheckUtils]: 28: Hoare triple {2964#(<= ~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)); {2879#true} is VALID [2022-04-28 12:42:28,038 INFO L290 TraceCheckUtils]: 27: Hoare triple {2964#(<= ~counter~0 2)} assume !!(#t~post6 < 5);havoc #t~post6; {2964#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:28,039 INFO L290 TraceCheckUtils]: 26: Hoare triple {2936#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2964#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:28,039 INFO L290 TraceCheckUtils]: 25: Hoare triple {2936#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2936#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:28,039 INFO L290 TraceCheckUtils]: 24: Hoare triple {2936#(<= ~counter~0 1)} assume !!(0 != ~r~0); {2936#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:28,040 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2879#true} {2936#(<= ~counter~0 1)} #63#return; {2936#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:28,040 INFO L290 TraceCheckUtils]: 22: Hoare triple {2879#true} assume true; {2879#true} is VALID [2022-04-28 12:42:28,040 INFO L290 TraceCheckUtils]: 21: Hoare triple {2879#true} assume !(0 == ~cond); {2879#true} is VALID [2022-04-28 12:42:28,040 INFO L290 TraceCheckUtils]: 20: Hoare triple {2879#true} ~cond := #in~cond; {2879#true} is VALID [2022-04-28 12:42:28,040 INFO L272 TraceCheckUtils]: 19: Hoare triple {2936#(<= ~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)); {2879#true} is VALID [2022-04-28 12:42:28,040 INFO L290 TraceCheckUtils]: 18: Hoare triple {2936#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {2936#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:28,041 INFO L290 TraceCheckUtils]: 17: Hoare triple {2887#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2936#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:28,041 INFO L290 TraceCheckUtils]: 16: Hoare triple {2887#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2887#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:28,041 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2879#true} {2887#(<= ~counter~0 0)} #61#return; {2887#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:28,041 INFO L290 TraceCheckUtils]: 14: Hoare triple {2879#true} assume true; {2879#true} is VALID [2022-04-28 12:42:28,041 INFO L290 TraceCheckUtils]: 13: Hoare triple {2879#true} assume !(0 == ~cond); {2879#true} is VALID [2022-04-28 12:42:28,042 INFO L290 TraceCheckUtils]: 12: Hoare triple {2879#true} ~cond := #in~cond; {2879#true} is VALID [2022-04-28 12:42:28,042 INFO L272 TraceCheckUtils]: 11: Hoare triple {2887#(<= ~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)); {2879#true} is VALID [2022-04-28 12:42:28,042 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2879#true} {2887#(<= ~counter~0 0)} #59#return; {2887#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:28,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {2879#true} assume true; {2879#true} is VALID [2022-04-28 12:42:28,042 INFO L290 TraceCheckUtils]: 8: Hoare triple {2879#true} assume !(0 == ~cond); {2879#true} is VALID [2022-04-28 12:42:28,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {2879#true} ~cond := #in~cond; {2879#true} is VALID [2022-04-28 12:42:28,042 INFO L272 TraceCheckUtils]: 6: Hoare triple {2887#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2879#true} is VALID [2022-04-28 12:42:28,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {2887#(<= ~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; {2887#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:28,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {2887#(<= ~counter~0 0)} call #t~ret7 := main(); {2887#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:28,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2887#(<= ~counter~0 0)} {2879#true} #67#return; {2887#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:28,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {2887#(<= ~counter~0 0)} assume true; {2887#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:28,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {2879#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; {2887#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:28,044 INFO L272 TraceCheckUtils]: 0: Hoare triple {2879#true} call ULTIMATE.init(); {2879#true} is VALID [2022-04-28 12:42:28,044 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 12:42:28,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:42:28,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554369575] [2022-04-28 12:42:28,044 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:42:28,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791261649] [2022-04-28 12:42:28,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791261649] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:42:28,044 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:42:28,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-28 12:42:28,045 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:42:28,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [289355994] [2022-04-28 12:42:28,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [289355994] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:42:28,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:42:28,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 12:42:28,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670046793] [2022-04-28 12:42:28,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:42:28,045 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 12:42:28,045 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:42:28,046 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 12:42:28,081 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 12:42:28,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 12:42:28,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:42:28,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 12:42:28,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-28 12:42:28,081 INFO L87 Difference]: Start difference. First operand 56 states and 61 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 12:42:28,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:42:28,268 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2022-04-28 12:42:28,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 12:42:28,268 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 12:42:28,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:42:28,268 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 12:42:28,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 75 transitions. [2022-04-28 12:42:28,270 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 12:42:28,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 75 transitions. [2022-04-28 12:42:28,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 75 transitions. [2022-04-28 12:42:28,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:42:28,328 INFO L225 Difference]: With dead ends: 70 [2022-04-28 12:42:28,328 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 12:42:28,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-28 12:42:28,329 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 25 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:42:28,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 102 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:42:28,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 12:42:28,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-28 12:42:28,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:42:28,377 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 12:42:28,377 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 12:42:28,377 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 12:42:28,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:42:28,378 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-04-28 12:42:28,379 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-04-28 12:42:28,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:42:28,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:42:28,379 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 65 states. [2022-04-28 12:42:28,379 INFO L87 Difference]: Start difference. First operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 65 states. [2022-04-28 12:42:28,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:42:28,380 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-04-28 12:42:28,380 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-04-28 12:42:28,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:42:28,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:42:28,381 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:42:28,381 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:42:28,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 12:42:28,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2022-04-28 12:42:28,382 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 59 [2022-04-28 12:42:28,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:42:28,382 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2022-04-28 12:42:28,382 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 12:42:28,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 71 transitions. [2022-04-28 12:42:30,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:42:30,079 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-04-28 12:42:30,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-28 12:42:30,085 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:42:30,085 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:42:30,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-28 12:42:30,286 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 12:42:30,286 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:42:30,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:42:30,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1512407140, now seen corresponding path program 9 times [2022-04-28 12:42:30,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:42:30,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1406880121] [2022-04-28 12:42:30,287 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:42:30,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1512407140, now seen corresponding path program 10 times [2022-04-28 12:42:30,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:42:30,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362351173] [2022-04-28 12:42:30,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:42:30,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:42:30,309 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:42:30,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [590984329] [2022-04-28 12:42:30,309 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:42:30,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:42:30,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:42:30,310 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 12:42:30,311 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 12:42:30,425 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:42:30,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-28 12:42:30,425 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 12:42:30,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 12:42:30,464 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 12:42:30,464 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-28 12:42:30,464 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 12:42:30,466 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 12:42:30,485 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 12:42:30,683 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 12:42:30,686 INFO L356 BasicCegarLoop]: Path program histogram: [10, 2, 2, 2, 2] [2022-04-28 12:42:30,688 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 12:42:30,699 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 12:42:30,700 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 12:42:30,700 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 12:42:30,700 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 12:42:30,700 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 12:42:30,700 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 12:42:30,700 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-28 12:42:30,700 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 12:42:30,700 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 12:42:30,700 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 12:42:30,700 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 12:42:30,700 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-28 12:42:30,700 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-28 12:42:30,700 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-28 12:42:30,700 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-28 12:42:30,700 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-28 12:42:30,700 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-28 12:42:30,700 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 12:42:30,700 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 12:42:30,700 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-28 12:42:30,700 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-04-28 12:42:30,700 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-04-28 12:42:30,700 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-28 12:42:30,700 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-28 12:42:30,700 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-28 12:42:30,700 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-28 12:42:30,700 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-28 12:42:30,700 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-28 12:42:30,700 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 12:42:30,700 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 12:42:30,700 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2022-04-28 12:42:30,700 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2022-04-28 12:42:30,700 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-28 12:42:30,700 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-28 12:42:30,701 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-28 12:42:30,701 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-28 12:42:30,701 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-28 12:42:30,701 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-28 12:42:30,701 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-28 12:42:30,701 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-28 12:42:30,701 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-28 12:42:30,701 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 12:42:30,701 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-28 12:42:30,701 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-28 12:42:30,701 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 12:42:30,701 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 12:42:30,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 12:42:30 BoogieIcfgContainer [2022-04-28 12:42:30,701 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 12:42:30,702 INFO L158 Benchmark]: Toolchain (without parser) took 28493.92ms. Allocated memory was 192.9MB in the beginning and 231.7MB in the end (delta: 38.8MB). Free memory was 143.6MB in the beginning and 161.6MB in the end (delta: -18.0MB). Peak memory consumption was 21.8MB. Max. memory is 8.0GB. [2022-04-28 12:42:30,702 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 192.9MB. Free memory was 160.4MB in the beginning and 160.3MB in the end (delta: 151.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 12:42:30,702 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.06ms. Allocated memory is still 192.9MB. Free memory was 143.5MB in the beginning and 167.8MB in the end (delta: -24.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 12:42:30,703 INFO L158 Benchmark]: Boogie Preprocessor took 26.74ms. Allocated memory is still 192.9MB. Free memory was 167.8MB in the beginning and 166.5MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 12:42:30,703 INFO L158 Benchmark]: RCFGBuilder took 246.09ms. Allocated memory is still 192.9MB. Free memory was 166.5MB in the beginning and 155.2MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 12:42:30,703 INFO L158 Benchmark]: TraceAbstraction took 27996.05ms. Allocated memory was 192.9MB in the beginning and 231.7MB in the end (delta: 38.8MB). Free memory was 154.5MB in the beginning and 161.6MB in the end (delta: -7.0MB). Peak memory consumption was 32.7MB. Max. memory is 8.0GB. [2022-04-28 12:42:30,704 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 192.9MB. Free memory was 160.4MB in the beginning and 160.3MB in the end (delta: 151.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 221.06ms. Allocated memory is still 192.9MB. Free memory was 143.5MB in the beginning and 167.8MB in the end (delta: -24.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.74ms. Allocated memory is still 192.9MB. Free memory was 167.8MB in the beginning and 166.5MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 246.09ms. Allocated memory is still 192.9MB. Free memory was 166.5MB in the beginning and 155.2MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 27996.05ms. Allocated memory was 192.9MB in the beginning and 231.7MB in the end (delta: 38.8MB). Free memory was 154.5MB in the beginning and 161.6MB in the end (delta: -7.0MB). Peak memory consumption was 32.7MB. 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() [L26] CALL assume_abort_if_not(((long long) R - 1) * ((long long) R - 1) < A) [L9] COND FALSE !(!cond) [L26] RET assume_abort_if_not(((long long) R - 1) * ((long long) R - 1) < A) [L28] CALL assume_abort_if_not(A % 2 == 1) [L9] COND FALSE !(!cond) [L28] RET assume_abort_if_not(A % 2 == 1) [L30] u = ((long long) 2 * R) + 1 [L31] v = 1 [L32] 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)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 [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)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 [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)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 [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)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 [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)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 [L34] EXPR counter++ [L34] COND FALSE !(counter++<5) [L48] 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, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.9s, OverallIterations: 9, TraceHistogramMax: 6, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 89 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 88 mSDsluCounter, 640 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 421 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 168 IncrementalHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 219 mSDtfsCounter, 168 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 496 GetRequests, 439 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=8, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 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 12:42:30,717 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...