/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 09:05:56,153 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 09:05:56,155 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 09:05:56,203 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 09:05:56,204 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 09:05:56,206 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 09:05:56,208 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 09:05:56,211 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 09:05:56,212 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 09:05:56,216 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 09:05:56,217 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 09:05:56,218 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 09:05:56,218 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 09:05:56,220 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 09:05:56,221 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 09:05:56,225 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 09:05:56,225 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 09:05:56,226 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 09:05:56,228 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 09:05:56,232 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 09:05:56,233 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 09:05:56,234 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 09:05:56,235 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 09:05:56,235 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 09:05:56,236 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 09:05:56,240 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 09:05:56,240 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 09:05:56,240 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 09:05:56,241 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 09:05:56,241 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 09:05:56,242 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 09:05:56,242 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 09:05:56,244 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 09:05:56,244 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 09:05:56,245 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 09:05:56,245 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 09:05:56,245 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 09:05:56,246 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 09:05:56,246 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 09:05:56,246 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 09:05:56,247 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 09:05:56,248 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 09:05:56,249 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 09:05:56,259 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 09:05:56,259 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 09:05:56,260 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 09:05:56,260 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 09:05:56,260 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 09:05:56,260 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 09:05:56,260 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 09:05:56,260 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 09:05:56,260 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 09:05:56,261 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 09:05:56,261 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 09:05:56,261 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 09:05:56,261 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 09:05:56,262 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 09:05:56,262 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 09:05:56,262 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 09:05:56,262 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 09:05:56,262 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 09:05:56,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 09:05:56,262 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 09:05:56,262 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 09:05:56,263 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 09:05:56,263 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 09:05:56,263 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 09:05:56,263 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 09:05:56,263 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 09:05:56,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 09:05:56,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 09:05:56,507 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 09:05:56,508 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 09:05:56,508 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 09:05:56,509 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-15 09:05:56,563 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/342124cff/dab30cdaf69e4204b53537fad96494aa/FLAG8e456a61b [2022-04-15 09:05:56,962 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 09:05:56,962 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_unwindbound5.c [2022-04-15 09:05:56,969 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/342124cff/dab30cdaf69e4204b53537fad96494aa/FLAG8e456a61b [2022-04-15 09:05:56,985 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/342124cff/dab30cdaf69e4204b53537fad96494aa [2022-04-15 09:05:56,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 09:05:56,990 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 09:05:56,992 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 09:05:56,992 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 09:05:56,995 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 09:05:56,996 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 09:05:56" (1/1) ... [2022-04-15 09:05:56,997 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2acea181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:05:56, skipping insertion in model container [2022-04-15 09:05:56,997 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 09:05:56" (1/1) ... [2022-04-15 09:05:57,003 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 09:05:57,015 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 09:05:57,178 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-15 09:05:57,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 09:05:57,211 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 09:05:57,220 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-15 09:05:57,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 09:05:57,240 INFO L208 MainTranslator]: Completed translation [2022-04-15 09:05:57,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:05:57 WrapperNode [2022-04-15 09:05:57,241 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 09:05:57,242 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 09:05:57,242 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 09:05:57,242 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 09:05:57,250 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:05:57" (1/1) ... [2022-04-15 09:05:57,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:05:57" (1/1) ... [2022-04-15 09:05:57,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:05:57" (1/1) ... [2022-04-15 09:05:57,257 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:05:57" (1/1) ... [2022-04-15 09:05:57,270 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:05:57" (1/1) ... [2022-04-15 09:05:57,276 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:05:57" (1/1) ... [2022-04-15 09:05:57,280 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:05:57" (1/1) ... [2022-04-15 09:05:57,283 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 09:05:57,284 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 09:05:57,284 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 09:05:57,284 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 09:05:57,285 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:05:57" (1/1) ... [2022-04-15 09:05:57,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 09:05:57,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:05:57,316 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 09:05:57,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 09:05:57,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 09:05:57,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 09:05:57,358 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 09:05:57,359 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 09:05:57,359 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 09:05:57,359 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 09:05:57,359 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 09:05:57,359 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 09:05:57,359 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 09:05:57,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 09:05:57,360 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 09:05:57,360 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 09:05:57,361 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 09:05:57,361 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 09:05:57,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 09:05:57,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 09:05:57,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 09:05:57,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 09:05:57,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 09:05:57,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 09:05:57,417 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 09:05:57,418 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 09:05:57,632 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 09:05:57,637 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 09:05:57,638 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 09:05:57,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 09:05:57 BoogieIcfgContainer [2022-04-15 09:05:57,639 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 09:05:57,640 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 09:05:57,640 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 09:05:57,643 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 09:05:57,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 09:05:56" (1/3) ... [2022-04-15 09:05:57,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42db26d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 09:05:57, skipping insertion in model container [2022-04-15 09:05:57,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:05:57" (2/3) ... [2022-04-15 09:05:57,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42db26d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 09:05:57, skipping insertion in model container [2022-04-15 09:05:57,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 09:05:57" (3/3) ... [2022-04-15 09:05:57,645 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat2-ll_unwindbound5.c [2022-04-15 09:05:57,648 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 09:05:57,648 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 09:05:57,687 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 09:05:57,696 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 09:05:57,697 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 09:05:57,717 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-15 09:05:57,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 09:05:57,722 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:05:57,723 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:05:57,723 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:05:57,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:05:57,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1859024204, now seen corresponding path program 1 times [2022-04-15 09:05:57,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:05:57,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1793360986] [2022-04-15 09:05:57,747 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:05:57,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1859024204, now seen corresponding path program 2 times [2022-04-15 09:05:57,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:05:57,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344496157] [2022-04-15 09:05:57,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:05:57,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:05:57,843 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:05:57,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1853462299] [2022-04-15 09:05:57,844 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:05:57,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:05:57,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:05:57,846 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:05:57,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 09:05:57,897 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 09:05:57,898 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:05:57,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-15 09:05:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:05:57,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:05:57,989 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2022-04-15 09:05:57,990 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-15 09:05:57,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-15 09:05:57,990 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #67#return; {33#true} is VALID [2022-04-15 09:05:57,991 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret7 := main(); {33#true} is VALID [2022-04-15 09:05:57,991 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-15 09:05:57,991 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-15 09:05:57,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-15 09:05:57,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} assume 0 == ~cond;assume false; {33#true} is VALID [2022-04-15 09:05:57,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-15 09:05:57,992 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#true} {33#true} #59#return; {33#true} is VALID [2022-04-15 09:05:57,992 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-15 09:05:57,993 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-15 09:05:57,993 INFO L290 TraceCheckUtils]: 13: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-15 09:05:57,994 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-15 09:05:57,994 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34#false} {33#true} #61#return; {34#false} is VALID [2022-04-15 09:05:57,994 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-15 09:05:57,994 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-04-15 09:05:57,995 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-15 09:05:57,995 INFO L290 TraceCheckUtils]: 19: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-15 09:05:57,995 INFO L290 TraceCheckUtils]: 20: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-04-15 09:05:57,995 INFO L290 TraceCheckUtils]: 21: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-15 09:05:57,996 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 09:05:57,996 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 09:05:57,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:05:57,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344496157] [2022-04-15 09:05:57,997 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:05:57,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853462299] [2022-04-15 09:05:57,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853462299] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:05:57,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:05:57,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-15 09:05:58,000 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:05:58,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1793360986] [2022-04-15 09:05:58,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1793360986] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:05:58,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:05:58,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-15 09:05:58,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936447655] [2022-04-15 09:05:58,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:05:58,006 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-15 09:05:58,007 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:05:58,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 09:05:58,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:05:58,032 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-15 09:05:58,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:05:58,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-15 09:05:58,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-15 09:05:58,053 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-15 09:05:58,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:05:58,135 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-15 09:05:58,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-15 09:05:58,136 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-15 09:05:58,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:05:58,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 09:05:58,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2022-04-15 09:05:58,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 09:05:58,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2022-04-15 09:05:58,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 70 transitions. [2022-04-15 09:05:58,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:05:58,247 INFO L225 Difference]: With dead ends: 53 [2022-04-15 09:05:58,247 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 09:05:58,249 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-15 09:05:58,251 INFO L913 BasicCegarLoop]: 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-15 09:05:58,252 INFO L914 BasicCegarLoop]: 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-15 09:05:58,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 09:05:58,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-15 09:05:58,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:05:58,276 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-15 09:05:58,277 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-15 09:05:58,277 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-15 09:05:58,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:05:58,280 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-15 09:05:58,280 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-15 09:05:58,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:05:58,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:05:58,281 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-15 09:05:58,281 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-15 09:05:58,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:05:58,284 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-15 09:05:58,284 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-15 09:05:58,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:05:58,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:05:58,285 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:05:58,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:05:58,286 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-15 09:05:58,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-04-15 09:05:58,288 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 22 [2022-04-15 09:05:58,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:05:58,289 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-04-15 09:05:58,289 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 09:05:58,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 29 transitions. [2022-04-15 09:05:58,316 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-15 09:05:58,316 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-15 09:05:58,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 09:05:58,317 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:05:58,317 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:05:58,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 09:05:58,522 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-15 09:05:58,522 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:05:58,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:05:58,523 INFO L85 PathProgramCache]: Analyzing trace with hash 243739414, now seen corresponding path program 1 times [2022-04-15 09:05:58,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:05:58,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [540299981] [2022-04-15 09:05:58,543 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:05:58,544 INFO L85 PathProgramCache]: Analyzing trace with hash 243739414, now seen corresponding path program 2 times [2022-04-15 09:05:58,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:05:58,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339885555] [2022-04-15 09:05:58,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:05:58,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:05:58,567 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:05:58,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1951382896] [2022-04-15 09:05:58,568 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:05:58,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:05:58,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:05:58,571 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:05:58,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 09:05:58,631 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 09:05:58,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:05:58,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 09:05:58,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:05:58,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:05:58,841 INFO L272 TraceCheckUtils]: 0: Hoare triple {306#true} call ULTIMATE.init(); {306#true} is VALID [2022-04-15 09:05:58,842 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-15 09:05:58,842 INFO L290 TraceCheckUtils]: 2: Hoare triple {314#(<= ~counter~0 0)} assume true; {314#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:58,843 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {314#(<= ~counter~0 0)} {306#true} #67#return; {314#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:58,844 INFO L272 TraceCheckUtils]: 4: Hoare triple {314#(<= ~counter~0 0)} call #t~ret7 := main(); {314#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:58,844 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-15 09:05:58,847 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-15 09:05:58,848 INFO L290 TraceCheckUtils]: 7: Hoare triple {314#(<= ~counter~0 0)} ~cond := #in~cond; {314#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:58,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {314#(<= ~counter~0 0)} assume !(0 == ~cond); {314#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:58,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {314#(<= ~counter~0 0)} assume true; {314#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:58,850 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {314#(<= ~counter~0 0)} {314#(<= ~counter~0 0)} #59#return; {314#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:58,851 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-15 09:05:58,851 INFO L290 TraceCheckUtils]: 12: Hoare triple {314#(<= ~counter~0 0)} ~cond := #in~cond; {314#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:58,852 INFO L290 TraceCheckUtils]: 13: Hoare triple {314#(<= ~counter~0 0)} assume !(0 == ~cond); {314#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:58,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {314#(<= ~counter~0 0)} assume true; {314#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:58,853 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {314#(<= ~counter~0 0)} {314#(<= ~counter~0 0)} #61#return; {314#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:58,854 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-15 09:05:58,855 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-15 09:05:58,856 INFO L290 TraceCheckUtils]: 18: Hoare triple {363#(<= |main_#t~post6| 0)} assume !(#t~post6 < 5);havoc #t~post6; {307#false} is VALID [2022-04-15 09:05:58,856 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-15 09:05:58,857 INFO L290 TraceCheckUtils]: 20: Hoare triple {307#false} ~cond := #in~cond; {307#false} is VALID [2022-04-15 09:05:58,857 INFO L290 TraceCheckUtils]: 21: Hoare triple {307#false} assume 0 == ~cond; {307#false} is VALID [2022-04-15 09:05:58,857 INFO L290 TraceCheckUtils]: 22: Hoare triple {307#false} assume !false; {307#false} is VALID [2022-04-15 09:05:58,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 09:05:58,857 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 09:05:58,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:05:58,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339885555] [2022-04-15 09:05:58,858 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:05:58,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951382896] [2022-04-15 09:05:58,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951382896] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:05:58,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:05:58,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 09:05:58,859 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:05:58,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [540299981] [2022-04-15 09:05:58,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [540299981] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:05:58,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:05:58,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 09:05:58,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061362990] [2022-04-15 09:05:58,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:05:58,865 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-15 09:05:58,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:05:58,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 09:05:58,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:05:58,908 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 09:05:58,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:05:58,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 09:05:58,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 09:05:58,909 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-15 09:05:58,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:05:58,986 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-15 09:05:58,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 09:05:58,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-15 09:05:58,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:05:58,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 09:05:58,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-15 09:05:58,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 09:05:58,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-15 09:05:58,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-15 09:05:59,038 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:05:59,040 INFO L225 Difference]: With dead ends: 34 [2022-04-15 09:05:59,040 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 09:05:59,040 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 09:05:59,041 INFO L913 BasicCegarLoop]: 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-15 09:05:59,042 INFO L914 BasicCegarLoop]: 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-15 09:05:59,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 09:05:59,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-15 09:05:59,059 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:05:59,059 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-15 09:05:59,060 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-15 09:05:59,060 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-15 09:05:59,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:05:59,062 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-15 09:05:59,062 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-15 09:05:59,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:05:59,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:05:59,063 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-15 09:05:59,064 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-15 09:05:59,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:05:59,081 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-15 09:05:59,081 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-15 09:05:59,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:05:59,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:05:59,082 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:05:59,082 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:05:59,082 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-15 09:05:59,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-15 09:05:59,092 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2022-04-15 09:05:59,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:05:59,093 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-15 09:05:59,093 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 09:05:59,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 31 transitions. [2022-04-15 09:05:59,128 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-15 09:05:59,128 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-15 09:05:59,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 09:05:59,130 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:05:59,130 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:05:59,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 09:05:59,344 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-15 09:05:59,345 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:05:59,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:05:59,345 INFO L85 PathProgramCache]: Analyzing trace with hash 245526874, now seen corresponding path program 1 times [2022-04-15 09:05:59,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:05:59,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1336457662] [2022-04-15 09:05:59,346 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:05:59,346 INFO L85 PathProgramCache]: Analyzing trace with hash 245526874, now seen corresponding path program 2 times [2022-04-15 09:05:59,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:05:59,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977312826] [2022-04-15 09:05:59,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:05:59,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:05:59,364 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:05:59,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [852954005] [2022-04-15 09:05:59,364 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:05:59,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:05:59,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:05:59,368 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:05:59,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 09:05:59,416 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 09:05:59,417 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:05:59,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 09:05:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:05:59,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:05:59,850 INFO L272 TraceCheckUtils]: 0: Hoare triple {554#true} call ULTIMATE.init(); {554#true} is VALID [2022-04-15 09:05:59,850 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-15 09:05:59,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-15 09:05:59,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#true} {554#true} #67#return; {554#true} is VALID [2022-04-15 09:05:59,851 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#true} call #t~ret7 := main(); {554#true} is VALID [2022-04-15 09:05:59,851 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-15 09:05:59,851 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-15 09:05:59,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {554#true} ~cond := #in~cond; {554#true} is VALID [2022-04-15 09:05:59,852 INFO L290 TraceCheckUtils]: 8: Hoare triple {554#true} assume !(0 == ~cond); {554#true} is VALID [2022-04-15 09:05:59,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-15 09:05:59,852 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {554#true} {554#true} #59#return; {554#true} is VALID [2022-04-15 09:05:59,852 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-15 09:05:59,853 INFO L290 TraceCheckUtils]: 12: Hoare triple {554#true} ~cond := #in~cond; {554#true} is VALID [2022-04-15 09:05:59,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {554#true} assume !(0 == ~cond); {554#true} is VALID [2022-04-15 09:05:59,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-15 09:05:59,853 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {554#true} {554#true} #61#return; {554#true} is VALID [2022-04-15 09:06:01,857 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-15 09:06:01,858 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-15 09:06:01,859 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-15 09:06:03,698 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-15 09:06:03,699 INFO L290 TraceCheckUtils]: 20: Hoare triple {617#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {621#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:06:03,700 INFO L290 TraceCheckUtils]: 21: Hoare triple {621#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {555#false} is VALID [2022-04-15 09:06:03,700 INFO L290 TraceCheckUtils]: 22: Hoare triple {555#false} assume !false; {555#false} is VALID [2022-04-15 09:06:03,700 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 09:06:03,700 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 09:06:03,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:06:03,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977312826] [2022-04-15 09:06:03,702 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:06:03,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852954005] [2022-04-15 09:06:03,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852954005] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:06:03,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:06:03,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 09:06:03,702 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:06:03,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1336457662] [2022-04-15 09:06:03,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1336457662] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:06:03,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:06:03,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 09:06:03,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912112675] [2022-04-15 09:06:03,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:06:03,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-15 09:06:03,704 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:06:03,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 09:06:06,030 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 19 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 09:06:06,031 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 09:06:06,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:06:06,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 09:06:06,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 09:06:06,032 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-15 09:06:10,729 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 09:06:10,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:06:10,780 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-15 09:06:10,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 09:06:10,781 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-15 09:06:10,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:06:10,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 09:06:10,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-04-15 09:06:10,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 09:06:10,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-04-15 09:06:10,784 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 44 transitions. [2022-04-15 09:06:15,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 43 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 09:06:15,380 INFO L225 Difference]: With dead ends: 39 [2022-04-15 09:06:15,380 INFO L226 Difference]: Without dead ends: 37 [2022-04-15 09:06:15,380 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 09:06:15,381 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 8 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-15 09:06:15,382 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 85 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-15 09:06:15,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-15 09:06:15,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2022-04-15 09:06:15,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:06:15,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 36 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 5 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-15 09:06:15,409 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 36 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 5 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-15 09:06:15,409 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 36 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 5 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-15 09:06:15,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:06:15,412 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-04-15 09:06:15,412 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-04-15 09:06:15,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:06:15,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:06:15,413 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 5 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 37 states. [2022-04-15 09:06:15,413 INFO L87 Difference]: Start difference. First operand has 36 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 5 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 37 states. [2022-04-15 09:06:15,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:06:15,415 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-04-15 09:06:15,415 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-04-15 09:06:15,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:06:15,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:06:15,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:06:15,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:06:15,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 5 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-15 09:06:15,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-04-15 09:06:15,419 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 23 [2022-04-15 09:06:15,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:06:15,419 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-04-15 09:06:15,419 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 09:06:15,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 43 transitions. [2022-04-15 09:06:17,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:06:17,173 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-15 09:06:17,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 09:06:17,174 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:06:17,174 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:06:17,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 09:06:17,375 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:06:17,375 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:06:17,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:06:17,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1019533657, now seen corresponding path program 1 times [2022-04-15 09:06:17,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:06:17,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [649925467] [2022-04-15 09:06:17,377 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:06:17,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1019533657, now seen corresponding path program 2 times [2022-04-15 09:06:17,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:06:17,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518790225] [2022-04-15 09:06:17,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:06:17,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:06:17,395 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:06:17,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2048879404] [2022-04-15 09:06:17,395 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:06:17,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:06:17,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:06:17,396 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:06:17,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 09:06:17,451 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:06:17,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:06:17,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 09:06:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:06:17,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:06:17,652 INFO L272 TraceCheckUtils]: 0: Hoare triple {853#true} call ULTIMATE.init(); {853#true} is VALID [2022-04-15 09:06:17,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {853#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; {853#true} is VALID [2022-04-15 09:06:17,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {853#true} assume true; {853#true} is VALID [2022-04-15 09:06:17,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {853#true} {853#true} #67#return; {853#true} is VALID [2022-04-15 09:06:17,653 INFO L272 TraceCheckUtils]: 4: Hoare triple {853#true} call #t~ret7 := main(); {853#true} is VALID [2022-04-15 09:06:17,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {853#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; {853#true} is VALID [2022-04-15 09:06:17,654 INFO L272 TraceCheckUtils]: 6: Hoare triple {853#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {853#true} is VALID [2022-04-15 09:06:17,654 INFO L290 TraceCheckUtils]: 7: Hoare triple {853#true} ~cond := #in~cond; {853#true} is VALID [2022-04-15 09:06:17,654 INFO L290 TraceCheckUtils]: 8: Hoare triple {853#true} assume !(0 == ~cond); {853#true} is VALID [2022-04-15 09:06:17,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {853#true} assume true; {853#true} is VALID [2022-04-15 09:06:17,655 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {853#true} {853#true} #59#return; {853#true} is VALID [2022-04-15 09:06:17,655 INFO L272 TraceCheckUtils]: 11: Hoare triple {853#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)); {853#true} is VALID [2022-04-15 09:06:17,655 INFO L290 TraceCheckUtils]: 12: Hoare triple {853#true} ~cond := #in~cond; {853#true} is VALID [2022-04-15 09:06:17,655 INFO L290 TraceCheckUtils]: 13: Hoare triple {853#true} assume !(0 == ~cond); {853#true} is VALID [2022-04-15 09:06:17,655 INFO L290 TraceCheckUtils]: 14: Hoare triple {853#true} assume true; {853#true} is VALID [2022-04-15 09:06:17,655 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {853#true} {853#true} #61#return; {853#true} is VALID [2022-04-15 09:06:17,657 INFO L290 TraceCheckUtils]: 16: Hoare triple {853#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {853#true} is VALID [2022-04-15 09:06:17,657 INFO L290 TraceCheckUtils]: 17: Hoare triple {853#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {853#true} is VALID [2022-04-15 09:06:17,657 INFO L290 TraceCheckUtils]: 18: Hoare triple {853#true} assume !!(#t~post6 < 5);havoc #t~post6; {853#true} is VALID [2022-04-15 09:06:17,657 INFO L272 TraceCheckUtils]: 19: Hoare triple {853#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)); {853#true} is VALID [2022-04-15 09:06:17,658 INFO L290 TraceCheckUtils]: 20: Hoare triple {853#true} ~cond := #in~cond; {918#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:06:17,659 INFO L290 TraceCheckUtils]: 21: Hoare triple {918#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {922#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:06:17,659 INFO L290 TraceCheckUtils]: 22: Hoare triple {922#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {922#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:06:17,660 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {922#(not (= |__VERIFIER_assert_#in~cond| 0))} {853#true} #63#return; {929#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4)))} is VALID [2022-04-15 09:06:17,661 INFO L290 TraceCheckUtils]: 24: Hoare triple {929#(= (+ (* 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); {933#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} is VALID [2022-04-15 09:06:17,661 INFO L272 TraceCheckUtils]: 25: Hoare triple {933#(= (+ (* 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)); {937#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 09:06:17,662 INFO L290 TraceCheckUtils]: 26: Hoare triple {937#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {941#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:06:17,662 INFO L290 TraceCheckUtils]: 27: Hoare triple {941#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {854#false} is VALID [2022-04-15 09:06:17,663 INFO L290 TraceCheckUtils]: 28: Hoare triple {854#false} assume !false; {854#false} is VALID [2022-04-15 09:06:17,663 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 09:06:17,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:06:18,115 INFO L290 TraceCheckUtils]: 28: Hoare triple {854#false} assume !false; {854#false} is VALID [2022-04-15 09:06:18,117 INFO L290 TraceCheckUtils]: 27: Hoare triple {941#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {854#false} is VALID [2022-04-15 09:06:18,117 INFO L290 TraceCheckUtils]: 26: Hoare triple {937#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {941#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:06:18,118 INFO L272 TraceCheckUtils]: 25: Hoare triple {933#(= (+ (* 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)); {937#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 09:06:18,120 INFO L290 TraceCheckUtils]: 24: Hoare triple {960#(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); {933#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} is VALID [2022-04-15 09:06:18,121 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {922#(not (= |__VERIFIER_assert_#in~cond| 0))} {853#true} #63#return; {960#(or (not (= main_~r~0 0)) (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4))))} is VALID [2022-04-15 09:06:18,122 INFO L290 TraceCheckUtils]: 22: Hoare triple {922#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {922#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:06:18,122 INFO L290 TraceCheckUtils]: 21: Hoare triple {973#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {922#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:06:18,123 INFO L290 TraceCheckUtils]: 20: Hoare triple {853#true} ~cond := #in~cond; {973#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 09:06:18,123 INFO L272 TraceCheckUtils]: 19: Hoare triple {853#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)); {853#true} is VALID [2022-04-15 09:06:18,123 INFO L290 TraceCheckUtils]: 18: Hoare triple {853#true} assume !!(#t~post6 < 5);havoc #t~post6; {853#true} is VALID [2022-04-15 09:06:18,123 INFO L290 TraceCheckUtils]: 17: Hoare triple {853#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {853#true} is VALID [2022-04-15 09:06:18,123 INFO L290 TraceCheckUtils]: 16: Hoare triple {853#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {853#true} is VALID [2022-04-15 09:06:18,124 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {853#true} {853#true} #61#return; {853#true} is VALID [2022-04-15 09:06:18,125 INFO L290 TraceCheckUtils]: 14: Hoare triple {853#true} assume true; {853#true} is VALID [2022-04-15 09:06:18,125 INFO L290 TraceCheckUtils]: 13: Hoare triple {853#true} assume !(0 == ~cond); {853#true} is VALID [2022-04-15 09:06:18,125 INFO L290 TraceCheckUtils]: 12: Hoare triple {853#true} ~cond := #in~cond; {853#true} is VALID [2022-04-15 09:06:18,126 INFO L272 TraceCheckUtils]: 11: Hoare triple {853#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)); {853#true} is VALID [2022-04-15 09:06:18,127 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {853#true} {853#true} #59#return; {853#true} is VALID [2022-04-15 09:06:18,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {853#true} assume true; {853#true} is VALID [2022-04-15 09:06:18,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {853#true} assume !(0 == ~cond); {853#true} is VALID [2022-04-15 09:06:18,135 INFO L290 TraceCheckUtils]: 7: Hoare triple {853#true} ~cond := #in~cond; {853#true} is VALID [2022-04-15 09:06:18,135 INFO L272 TraceCheckUtils]: 6: Hoare triple {853#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {853#true} is VALID [2022-04-15 09:06:18,135 INFO L290 TraceCheckUtils]: 5: Hoare triple {853#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; {853#true} is VALID [2022-04-15 09:06:18,135 INFO L272 TraceCheckUtils]: 4: Hoare triple {853#true} call #t~ret7 := main(); {853#true} is VALID [2022-04-15 09:06:18,136 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {853#true} {853#true} #67#return; {853#true} is VALID [2022-04-15 09:06:18,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {853#true} assume true; {853#true} is VALID [2022-04-15 09:06:18,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {853#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; {853#true} is VALID [2022-04-15 09:06:18,136 INFO L272 TraceCheckUtils]: 0: Hoare triple {853#true} call ULTIMATE.init(); {853#true} is VALID [2022-04-15 09:06:18,136 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 09:06:18,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:06:18,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518790225] [2022-04-15 09:06:18,137 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:06:18,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048879404] [2022-04-15 09:06:18,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048879404] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:06:18,137 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:06:18,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-15 09:06:18,138 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:06:18,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [649925467] [2022-04-15 09:06:18,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [649925467] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:06:18,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:06:18,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 09:06:18,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253975666] [2022-04-15 09:06:18,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:06:18,139 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-04-15 09:06:18,139 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:06:18,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 09:06:18,169 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:06:18,169 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 09:06:18,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:06:18,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 09:06:18,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-15 09:06:18,171 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 09:06:18,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:06:18,489 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-04-15 09:06:18,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 09:06:18,489 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-04-15 09:06:18,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:06:18,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 09:06:18,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-15 09:06:18,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 09:06:18,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-15 09:06:18,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2022-04-15 09:06:18,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:06:18,529 INFO L225 Difference]: With dead ends: 43 [2022-04-15 09:06:18,529 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 09:06:18,530 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-15 09:06:18,530 INFO L913 BasicCegarLoop]: 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-15 09:06:18,531 INFO L914 BasicCegarLoop]: 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-15 09:06:18,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 09:06:18,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 29. [2022-04-15 09:06:18,548 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:06:18,548 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 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-15 09:06:18,548 INFO L74 IsIncluded]: Start isIncluded. First operand 38 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-15 09:06:18,549 INFO L87 Difference]: Start difference. First operand 38 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-15 09:06:18,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:06:18,551 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-04-15 09:06:18,551 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-04-15 09:06:18,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:06:18,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:06:18,552 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 38 states. [2022-04-15 09:06:18,552 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 38 states. [2022-04-15 09:06:18,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:06:18,554 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-04-15 09:06:18,554 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-04-15 09:06:18,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:06:18,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:06:18,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:06:18,555 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:06:18,555 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-15 09:06:18,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-04-15 09:06:18,557 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 29 [2022-04-15 09:06:18,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:06:18,557 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-04-15 09:06:18,557 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 09:06:18,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 31 transitions. [2022-04-15 09:06:20,606 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-15 09:06:20,607 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-15 09:06:20,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 09:06:20,608 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:06:20,608 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:06:20,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 09:06:20,808 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:06:20,808 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:06:20,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:06:20,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1080225052, now seen corresponding path program 1 times [2022-04-15 09:06:20,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:06:20,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1781181404] [2022-04-15 09:06:20,809 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:06:20,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1080225052, now seen corresponding path program 2 times [2022-04-15 09:06:20,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:06:20,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295713474] [2022-04-15 09:06:20,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:06:20,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:06:20,832 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:06:20,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [957870095] [2022-04-15 09:06:20,832 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:06:20,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:06:20,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:06:20,833 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:06:20,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 09:06:20,886 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:06:20,886 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:06:20,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 09:06:20,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:06:20,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:06:21,085 INFO L272 TraceCheckUtils]: 0: Hoare triple {1262#true} call ULTIMATE.init(); {1262#true} is VALID [2022-04-15 09:06:21,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {1262#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; {1270#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:21,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {1270#(<= ~counter~0 0)} assume true; {1270#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:21,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1270#(<= ~counter~0 0)} {1262#true} #67#return; {1270#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:21,087 INFO L272 TraceCheckUtils]: 4: Hoare triple {1270#(<= ~counter~0 0)} call #t~ret7 := main(); {1270#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:21,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {1270#(<= ~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; {1270#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:21,088 INFO L272 TraceCheckUtils]: 6: Hoare triple {1270#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1270#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:21,089 INFO L290 TraceCheckUtils]: 7: Hoare triple {1270#(<= ~counter~0 0)} ~cond := #in~cond; {1270#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:21,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {1270#(<= ~counter~0 0)} assume !(0 == ~cond); {1270#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:21,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {1270#(<= ~counter~0 0)} assume true; {1270#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:21,090 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1270#(<= ~counter~0 0)} {1270#(<= ~counter~0 0)} #59#return; {1270#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:21,090 INFO L272 TraceCheckUtils]: 11: Hoare triple {1270#(<= ~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)); {1270#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:21,091 INFO L290 TraceCheckUtils]: 12: Hoare triple {1270#(<= ~counter~0 0)} ~cond := #in~cond; {1270#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:21,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {1270#(<= ~counter~0 0)} assume !(0 == ~cond); {1270#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:21,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {1270#(<= ~counter~0 0)} assume true; {1270#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:21,092 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1270#(<= ~counter~0 0)} {1270#(<= ~counter~0 0)} #61#return; {1270#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:21,092 INFO L290 TraceCheckUtils]: 16: Hoare triple {1270#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1270#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:21,093 INFO L290 TraceCheckUtils]: 17: Hoare triple {1270#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1319#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:21,093 INFO L290 TraceCheckUtils]: 18: Hoare triple {1319#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {1319#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:21,094 INFO L272 TraceCheckUtils]: 19: Hoare triple {1319#(<= ~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)); {1319#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:21,094 INFO L290 TraceCheckUtils]: 20: Hoare triple {1319#(<= ~counter~0 1)} ~cond := #in~cond; {1319#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:21,095 INFO L290 TraceCheckUtils]: 21: Hoare triple {1319#(<= ~counter~0 1)} assume !(0 == ~cond); {1319#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:21,095 INFO L290 TraceCheckUtils]: 22: Hoare triple {1319#(<= ~counter~0 1)} assume true; {1319#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:21,096 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1319#(<= ~counter~0 1)} {1319#(<= ~counter~0 1)} #63#return; {1319#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:21,096 INFO L290 TraceCheckUtils]: 24: Hoare triple {1319#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1319#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:21,096 INFO L290 TraceCheckUtils]: 25: Hoare triple {1319#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1319#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:21,097 INFO L290 TraceCheckUtils]: 26: Hoare triple {1319#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1347#(<= |main_#t~post6| 1)} is VALID [2022-04-15 09:06:21,097 INFO L290 TraceCheckUtils]: 27: Hoare triple {1347#(<= |main_#t~post6| 1)} assume !(#t~post6 < 5);havoc #t~post6; {1263#false} is VALID [2022-04-15 09:06:21,097 INFO L272 TraceCheckUtils]: 28: Hoare triple {1263#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)); {1263#false} is VALID [2022-04-15 09:06:21,098 INFO L290 TraceCheckUtils]: 29: Hoare triple {1263#false} ~cond := #in~cond; {1263#false} is VALID [2022-04-15 09:06:21,098 INFO L290 TraceCheckUtils]: 30: Hoare triple {1263#false} assume 0 == ~cond; {1263#false} is VALID [2022-04-15 09:06:21,098 INFO L290 TraceCheckUtils]: 31: Hoare triple {1263#false} assume !false; {1263#false} is VALID [2022-04-15 09:06:21,098 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-15 09:06:21,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:06:21,301 INFO L290 TraceCheckUtils]: 31: Hoare triple {1263#false} assume !false; {1263#false} is VALID [2022-04-15 09:06:21,301 INFO L290 TraceCheckUtils]: 30: Hoare triple {1263#false} assume 0 == ~cond; {1263#false} is VALID [2022-04-15 09:06:21,301 INFO L290 TraceCheckUtils]: 29: Hoare triple {1263#false} ~cond := #in~cond; {1263#false} is VALID [2022-04-15 09:06:21,301 INFO L272 TraceCheckUtils]: 28: Hoare triple {1263#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)); {1263#false} is VALID [2022-04-15 09:06:21,303 INFO L290 TraceCheckUtils]: 27: Hoare triple {1375#(< |main_#t~post6| 5)} assume !(#t~post6 < 5);havoc #t~post6; {1263#false} is VALID [2022-04-15 09:06:21,303 INFO L290 TraceCheckUtils]: 26: Hoare triple {1379#(< ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1375#(< |main_#t~post6| 5)} is VALID [2022-04-15 09:06:21,304 INFO L290 TraceCheckUtils]: 25: Hoare triple {1379#(< ~counter~0 5)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1379#(< ~counter~0 5)} is VALID [2022-04-15 09:06:21,304 INFO L290 TraceCheckUtils]: 24: Hoare triple {1379#(< ~counter~0 5)} assume !!(0 != ~r~0); {1379#(< ~counter~0 5)} is VALID [2022-04-15 09:06:21,305 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1262#true} {1379#(< ~counter~0 5)} #63#return; {1379#(< ~counter~0 5)} is VALID [2022-04-15 09:06:21,305 INFO L290 TraceCheckUtils]: 22: Hoare triple {1262#true} assume true; {1262#true} is VALID [2022-04-15 09:06:21,305 INFO L290 TraceCheckUtils]: 21: Hoare triple {1262#true} assume !(0 == ~cond); {1262#true} is VALID [2022-04-15 09:06:21,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {1262#true} ~cond := #in~cond; {1262#true} is VALID [2022-04-15 09:06:21,305 INFO L272 TraceCheckUtils]: 19: Hoare triple {1379#(< ~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)); {1262#true} is VALID [2022-04-15 09:06:21,306 INFO L290 TraceCheckUtils]: 18: Hoare triple {1379#(< ~counter~0 5)} assume !!(#t~post6 < 5);havoc #t~post6; {1379#(< ~counter~0 5)} is VALID [2022-04-15 09:06:21,307 INFO L290 TraceCheckUtils]: 17: Hoare triple {1407#(< ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1379#(< ~counter~0 5)} is VALID [2022-04-15 09:06:21,307 INFO L290 TraceCheckUtils]: 16: Hoare triple {1407#(< ~counter~0 4)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1407#(< ~counter~0 4)} is VALID [2022-04-15 09:06:21,308 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1262#true} {1407#(< ~counter~0 4)} #61#return; {1407#(< ~counter~0 4)} is VALID [2022-04-15 09:06:21,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {1262#true} assume true; {1262#true} is VALID [2022-04-15 09:06:21,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {1262#true} assume !(0 == ~cond); {1262#true} is VALID [2022-04-15 09:06:21,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {1262#true} ~cond := #in~cond; {1262#true} is VALID [2022-04-15 09:06:21,308 INFO L272 TraceCheckUtils]: 11: Hoare triple {1407#(< ~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)); {1262#true} is VALID [2022-04-15 09:06:21,309 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1262#true} {1407#(< ~counter~0 4)} #59#return; {1407#(< ~counter~0 4)} is VALID [2022-04-15 09:06:21,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {1262#true} assume true; {1262#true} is VALID [2022-04-15 09:06:21,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {1262#true} assume !(0 == ~cond); {1262#true} is VALID [2022-04-15 09:06:21,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {1262#true} ~cond := #in~cond; {1262#true} is VALID [2022-04-15 09:06:21,310 INFO L272 TraceCheckUtils]: 6: Hoare triple {1407#(< ~counter~0 4)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1262#true} is VALID [2022-04-15 09:06:21,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {1407#(< ~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; {1407#(< ~counter~0 4)} is VALID [2022-04-15 09:06:21,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {1407#(< ~counter~0 4)} call #t~ret7 := main(); {1407#(< ~counter~0 4)} is VALID [2022-04-15 09:06:21,312 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1407#(< ~counter~0 4)} {1262#true} #67#return; {1407#(< ~counter~0 4)} is VALID [2022-04-15 09:06:21,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {1407#(< ~counter~0 4)} assume true; {1407#(< ~counter~0 4)} is VALID [2022-04-15 09:06:21,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {1262#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; {1407#(< ~counter~0 4)} is VALID [2022-04-15 09:06:21,317 INFO L272 TraceCheckUtils]: 0: Hoare triple {1262#true} call ULTIMATE.init(); {1262#true} is VALID [2022-04-15 09:06:21,318 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-15 09:06:21,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:06:21,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295713474] [2022-04-15 09:06:21,318 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:06:21,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957870095] [2022-04-15 09:06:21,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957870095] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:06:21,318 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:06:21,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-15 09:06:21,319 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:06:21,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1781181404] [2022-04-15 09:06:21,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1781181404] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:06:21,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:06:21,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 09:06:21,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140275631] [2022-04-15 09:06:21,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:06:21,320 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-15 09:06:21,320 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:06:21,320 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-15 09:06:21,351 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-15 09:06:21,351 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 09:06:21,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:06:21,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 09:06:21,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-15 09:06:21,352 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-15 09:06:21,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:06:21,458 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2022-04-15 09:06:21,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 09:06:21,458 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-15 09:06:21,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:06:21,458 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-15 09:06:21,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-15 09:06:21,460 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-15 09:06:21,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-15 09:06:21,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2022-04-15 09:06:21,495 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-15 09:06:21,497 INFO L225 Difference]: With dead ends: 43 [2022-04-15 09:06:21,497 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 09:06:21,497 INFO L912 BasicCegarLoop]: 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-15 09:06:21,498 INFO L913 BasicCegarLoop]: 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-15 09:06:21,499 INFO L914 BasicCegarLoop]: 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-15 09:06:21,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 09:06:21,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-15 09:06:21,527 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:06:21,527 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-15 09:06:21,528 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-15 09:06:21,528 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-15 09:06:21,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:06:21,530 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-15 09:06:21,530 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-15 09:06:21,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:06:21,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:06:21,530 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-15 09:06:21,531 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-15 09:06:21,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:06:21,532 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-15 09:06:21,532 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-15 09:06:21,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:06:21,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:06:21,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:06:21,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:06:21,533 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-15 09:06:21,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-15 09:06:21,535 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 32 [2022-04-15 09:06:21,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:06:21,535 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-15 09:06:21,535 INFO L479 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-15 09:06:21,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 41 transitions. [2022-04-15 09:06:23,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:06:23,328 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-15 09:06:23,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 09:06:23,329 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:06:23,329 INFO L499 BasicCegarLoop]: 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-15 09:06:23,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-15 09:06:23,529 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:06:23,530 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:06:23,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:06:23,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1448743382, now seen corresponding path program 3 times [2022-04-15 09:06:23,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:06:23,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [166763412] [2022-04-15 09:06:23,531 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:06:23,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1448743382, now seen corresponding path program 4 times [2022-04-15 09:06:23,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:06:23,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424636697] [2022-04-15 09:06:23,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:06:23,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:06:23,544 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:06:23,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1754120268] [2022-04-15 09:06:23,544 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 09:06:23,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:06:23,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:06:23,545 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:06:23,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 09:06:23,622 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 09:06:23,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:06:23,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 09:06:23,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:06:23,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:06:23,874 INFO L272 TraceCheckUtils]: 0: Hoare triple {1701#true} call ULTIMATE.init(); {1701#true} is VALID [2022-04-15 09:06:23,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {1701#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; {1709#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:23,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {1709#(<= ~counter~0 0)} assume true; {1709#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:23,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1709#(<= ~counter~0 0)} {1701#true} #67#return; {1709#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:23,877 INFO L272 TraceCheckUtils]: 4: Hoare triple {1709#(<= ~counter~0 0)} call #t~ret7 := main(); {1709#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:23,877 INFO L290 TraceCheckUtils]: 5: Hoare triple {1709#(<= ~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; {1709#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:23,878 INFO L272 TraceCheckUtils]: 6: Hoare triple {1709#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1709#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:23,878 INFO L290 TraceCheckUtils]: 7: Hoare triple {1709#(<= ~counter~0 0)} ~cond := #in~cond; {1709#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:23,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {1709#(<= ~counter~0 0)} assume !(0 == ~cond); {1709#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:23,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {1709#(<= ~counter~0 0)} assume true; {1709#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:23,883 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1709#(<= ~counter~0 0)} {1709#(<= ~counter~0 0)} #59#return; {1709#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:23,883 INFO L272 TraceCheckUtils]: 11: Hoare triple {1709#(<= ~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)); {1709#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:23,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {1709#(<= ~counter~0 0)} ~cond := #in~cond; {1709#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:23,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {1709#(<= ~counter~0 0)} assume !(0 == ~cond); {1709#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:23,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {1709#(<= ~counter~0 0)} assume true; {1709#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:23,885 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1709#(<= ~counter~0 0)} {1709#(<= ~counter~0 0)} #61#return; {1709#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:23,885 INFO L290 TraceCheckUtils]: 16: Hoare triple {1709#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1709#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:23,886 INFO L290 TraceCheckUtils]: 17: Hoare triple {1709#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1758#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:23,887 INFO L290 TraceCheckUtils]: 18: Hoare triple {1758#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {1758#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:23,887 INFO L272 TraceCheckUtils]: 19: Hoare triple {1758#(<= ~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)); {1758#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:23,888 INFO L290 TraceCheckUtils]: 20: Hoare triple {1758#(<= ~counter~0 1)} ~cond := #in~cond; {1758#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:23,888 INFO L290 TraceCheckUtils]: 21: Hoare triple {1758#(<= ~counter~0 1)} assume !(0 == ~cond); {1758#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:23,888 INFO L290 TraceCheckUtils]: 22: Hoare triple {1758#(<= ~counter~0 1)} assume true; {1758#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:23,889 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1758#(<= ~counter~0 1)} {1758#(<= ~counter~0 1)} #63#return; {1758#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:23,889 INFO L290 TraceCheckUtils]: 24: Hoare triple {1758#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1758#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:23,890 INFO L290 TraceCheckUtils]: 25: Hoare triple {1758#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1758#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:23,890 INFO L290 TraceCheckUtils]: 26: Hoare triple {1758#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1786#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:23,891 INFO L290 TraceCheckUtils]: 27: Hoare triple {1786#(<= ~counter~0 2)} assume !!(#t~post6 < 5);havoc #t~post6; {1786#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:23,891 INFO L272 TraceCheckUtils]: 28: Hoare triple {1786#(<= ~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)); {1786#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:23,892 INFO L290 TraceCheckUtils]: 29: Hoare triple {1786#(<= ~counter~0 2)} ~cond := #in~cond; {1786#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:23,892 INFO L290 TraceCheckUtils]: 30: Hoare triple {1786#(<= ~counter~0 2)} assume !(0 == ~cond); {1786#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:23,892 INFO L290 TraceCheckUtils]: 31: Hoare triple {1786#(<= ~counter~0 2)} assume true; {1786#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:23,893 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1786#(<= ~counter~0 2)} {1786#(<= ~counter~0 2)} #63#return; {1786#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:23,893 INFO L290 TraceCheckUtils]: 33: Hoare triple {1786#(<= ~counter~0 2)} assume !!(0 != ~r~0); {1786#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:23,894 INFO L290 TraceCheckUtils]: 34: Hoare triple {1786#(<= ~counter~0 2)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1786#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:23,894 INFO L290 TraceCheckUtils]: 35: Hoare triple {1786#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1814#(<= |main_#t~post6| 2)} is VALID [2022-04-15 09:06:23,895 INFO L290 TraceCheckUtils]: 36: Hoare triple {1814#(<= |main_#t~post6| 2)} assume !(#t~post6 < 5);havoc #t~post6; {1702#false} is VALID [2022-04-15 09:06:23,895 INFO L272 TraceCheckUtils]: 37: Hoare triple {1702#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)); {1702#false} is VALID [2022-04-15 09:06:23,895 INFO L290 TraceCheckUtils]: 38: Hoare triple {1702#false} ~cond := #in~cond; {1702#false} is VALID [2022-04-15 09:06:23,895 INFO L290 TraceCheckUtils]: 39: Hoare triple {1702#false} assume 0 == ~cond; {1702#false} is VALID [2022-04-15 09:06:23,895 INFO L290 TraceCheckUtils]: 40: Hoare triple {1702#false} assume !false; {1702#false} is VALID [2022-04-15 09:06:23,896 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-15 09:06:23,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:06:24,126 INFO L290 TraceCheckUtils]: 40: Hoare triple {1702#false} assume !false; {1702#false} is VALID [2022-04-15 09:06:24,126 INFO L290 TraceCheckUtils]: 39: Hoare triple {1702#false} assume 0 == ~cond; {1702#false} is VALID [2022-04-15 09:06:24,126 INFO L290 TraceCheckUtils]: 38: Hoare triple {1702#false} ~cond := #in~cond; {1702#false} is VALID [2022-04-15 09:06:24,126 INFO L272 TraceCheckUtils]: 37: Hoare triple {1702#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)); {1702#false} is VALID [2022-04-15 09:06:24,127 INFO L290 TraceCheckUtils]: 36: Hoare triple {1842#(< |main_#t~post6| 5)} assume !(#t~post6 < 5);havoc #t~post6; {1702#false} is VALID [2022-04-15 09:06:24,127 INFO L290 TraceCheckUtils]: 35: Hoare triple {1846#(< ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1842#(< |main_#t~post6| 5)} is VALID [2022-04-15 09:06:24,127 INFO L290 TraceCheckUtils]: 34: Hoare triple {1846#(< ~counter~0 5)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1846#(< ~counter~0 5)} is VALID [2022-04-15 09:06:24,128 INFO L290 TraceCheckUtils]: 33: Hoare triple {1846#(< ~counter~0 5)} assume !!(0 != ~r~0); {1846#(< ~counter~0 5)} is VALID [2022-04-15 09:06:24,128 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1701#true} {1846#(< ~counter~0 5)} #63#return; {1846#(< ~counter~0 5)} is VALID [2022-04-15 09:06:24,128 INFO L290 TraceCheckUtils]: 31: Hoare triple {1701#true} assume true; {1701#true} is VALID [2022-04-15 09:06:24,129 INFO L290 TraceCheckUtils]: 30: Hoare triple {1701#true} assume !(0 == ~cond); {1701#true} is VALID [2022-04-15 09:06:24,129 INFO L290 TraceCheckUtils]: 29: Hoare triple {1701#true} ~cond := #in~cond; {1701#true} is VALID [2022-04-15 09:06:24,129 INFO L272 TraceCheckUtils]: 28: Hoare triple {1846#(< ~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)); {1701#true} is VALID [2022-04-15 09:06:24,133 INFO L290 TraceCheckUtils]: 27: Hoare triple {1846#(< ~counter~0 5)} assume !!(#t~post6 < 5);havoc #t~post6; {1846#(< ~counter~0 5)} is VALID [2022-04-15 09:06:24,134 INFO L290 TraceCheckUtils]: 26: Hoare triple {1874#(< ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1846#(< ~counter~0 5)} is VALID [2022-04-15 09:06:24,134 INFO L290 TraceCheckUtils]: 25: Hoare triple {1874#(< ~counter~0 4)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1874#(< ~counter~0 4)} is VALID [2022-04-15 09:06:24,135 INFO L290 TraceCheckUtils]: 24: Hoare triple {1874#(< ~counter~0 4)} assume !!(0 != ~r~0); {1874#(< ~counter~0 4)} is VALID [2022-04-15 09:06:24,135 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1701#true} {1874#(< ~counter~0 4)} #63#return; {1874#(< ~counter~0 4)} is VALID [2022-04-15 09:06:24,136 INFO L290 TraceCheckUtils]: 22: Hoare triple {1701#true} assume true; {1701#true} is VALID [2022-04-15 09:06:24,136 INFO L290 TraceCheckUtils]: 21: Hoare triple {1701#true} assume !(0 == ~cond); {1701#true} is VALID [2022-04-15 09:06:24,136 INFO L290 TraceCheckUtils]: 20: Hoare triple {1701#true} ~cond := #in~cond; {1701#true} is VALID [2022-04-15 09:06:24,136 INFO L272 TraceCheckUtils]: 19: Hoare triple {1874#(< ~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)); {1701#true} is VALID [2022-04-15 09:06:24,136 INFO L290 TraceCheckUtils]: 18: Hoare triple {1874#(< ~counter~0 4)} assume !!(#t~post6 < 5);havoc #t~post6; {1874#(< ~counter~0 4)} is VALID [2022-04-15 09:06:24,137 INFO L290 TraceCheckUtils]: 17: Hoare triple {1786#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1874#(< ~counter~0 4)} is VALID [2022-04-15 09:06:24,137 INFO L290 TraceCheckUtils]: 16: Hoare triple {1786#(<= ~counter~0 2)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1786#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:24,138 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1701#true} {1786#(<= ~counter~0 2)} #61#return; {1786#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:24,138 INFO L290 TraceCheckUtils]: 14: Hoare triple {1701#true} assume true; {1701#true} is VALID [2022-04-15 09:06:24,138 INFO L290 TraceCheckUtils]: 13: Hoare triple {1701#true} assume !(0 == ~cond); {1701#true} is VALID [2022-04-15 09:06:24,138 INFO L290 TraceCheckUtils]: 12: Hoare triple {1701#true} ~cond := #in~cond; {1701#true} is VALID [2022-04-15 09:06:24,138 INFO L272 TraceCheckUtils]: 11: Hoare triple {1786#(<= ~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)); {1701#true} is VALID [2022-04-15 09:06:24,139 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1701#true} {1786#(<= ~counter~0 2)} #59#return; {1786#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:24,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {1701#true} assume true; {1701#true} is VALID [2022-04-15 09:06:24,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {1701#true} assume !(0 == ~cond); {1701#true} is VALID [2022-04-15 09:06:24,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {1701#true} ~cond := #in~cond; {1701#true} is VALID [2022-04-15 09:06:24,139 INFO L272 TraceCheckUtils]: 6: Hoare triple {1786#(<= ~counter~0 2)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1701#true} is VALID [2022-04-15 09:06:24,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {1786#(<= ~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; {1786#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:24,140 INFO L272 TraceCheckUtils]: 4: Hoare triple {1786#(<= ~counter~0 2)} call #t~ret7 := main(); {1786#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:24,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1786#(<= ~counter~0 2)} {1701#true} #67#return; {1786#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:24,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {1786#(<= ~counter~0 2)} assume true; {1786#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:24,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {1701#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; {1786#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:24,142 INFO L272 TraceCheckUtils]: 0: Hoare triple {1701#true} call ULTIMATE.init(); {1701#true} is VALID [2022-04-15 09:06:24,142 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-15 09:06:24,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:06:24,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424636697] [2022-04-15 09:06:24,142 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:06:24,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754120268] [2022-04-15 09:06:24,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754120268] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:06:24,143 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:06:24,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-15 09:06:24,143 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:06:24,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [166763412] [2022-04-15 09:06:24,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [166763412] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:06:24,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:06:24,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 09:06:24,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804037513] [2022-04-15 09:06:24,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:06:24,144 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-15 09:06:24,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:06:24,144 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-15 09:06:24,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:06:24,173 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 09:06:24,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:06:24,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 09:06:24,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-15 09:06:24,174 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-15 09:06:24,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:06:24,319 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-04-15 09:06:24,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 09:06:24,320 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-15 09:06:24,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:06:24,320 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-15 09:06:24,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2022-04-15 09:06:24,322 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-15 09:06:24,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2022-04-15 09:06:24,324 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 55 transitions. [2022-04-15 09:06:24,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:06:24,369 INFO L225 Difference]: With dead ends: 52 [2022-04-15 09:06:24,369 INFO L226 Difference]: Without dead ends: 47 [2022-04-15 09:06:24,370 INFO L912 BasicCegarLoop]: 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-15 09:06:24,370 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 8 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 09:06:24,371 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 92 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 09:06:24,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-15 09:06:24,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-15 09:06:24,407 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:06:24,407 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-15 09:06:24,408 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-15 09:06:24,408 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-15 09:06:24,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:06:24,410 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-15 09:06:24,410 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-15 09:06:24,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:06:24,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:06:24,411 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-15 09:06:24,411 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-15 09:06:24,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:06:24,413 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-15 09:06:24,413 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-15 09:06:24,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:06:24,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:06:24,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:06:24,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:06:24,414 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-15 09:06:24,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-04-15 09:06:24,415 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 41 [2022-04-15 09:06:24,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:06:24,416 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-04-15 09:06:24,416 INFO L479 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-15 09:06:24,416 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 51 transitions. [2022-04-15 09:06:25,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:06:25,137 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-15 09:06:25,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 09:06:25,137 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:06:25,137 INFO L499 BasicCegarLoop]: 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-15 09:06:25,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-15 09:06:25,339 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:06:25,339 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:06:25,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:06:25,340 INFO L85 PathProgramCache]: Analyzing trace with hash -678977956, now seen corresponding path program 5 times [2022-04-15 09:06:25,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:06:25,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1363208348] [2022-04-15 09:06:25,340 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:06:25,341 INFO L85 PathProgramCache]: Analyzing trace with hash -678977956, now seen corresponding path program 6 times [2022-04-15 09:06:25,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:06:25,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660654817] [2022-04-15 09:06:25,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:06:25,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:06:25,375 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:06:25,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [414020800] [2022-04-15 09:06:25,375 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 09:06:25,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:06:25,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:06:25,379 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:06:25,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 09:06:25,465 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-15 09:06:25,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:06:25,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 09:06:25,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:06:25,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:06:25,809 INFO L272 TraceCheckUtils]: 0: Hoare triple {2251#true} call ULTIMATE.init(); {2251#true} is VALID [2022-04-15 09:06:25,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {2251#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; {2259#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:25,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {2259#(<= ~counter~0 0)} assume true; {2259#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:25,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2259#(<= ~counter~0 0)} {2251#true} #67#return; {2259#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:25,811 INFO L272 TraceCheckUtils]: 4: Hoare triple {2259#(<= ~counter~0 0)} call #t~ret7 := main(); {2259#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:25,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {2259#(<= ~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; {2259#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:25,813 INFO L272 TraceCheckUtils]: 6: Hoare triple {2259#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2259#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:25,814 INFO L290 TraceCheckUtils]: 7: Hoare triple {2259#(<= ~counter~0 0)} ~cond := #in~cond; {2259#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:25,814 INFO L290 TraceCheckUtils]: 8: Hoare triple {2259#(<= ~counter~0 0)} assume !(0 == ~cond); {2259#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:25,815 INFO L290 TraceCheckUtils]: 9: Hoare triple {2259#(<= ~counter~0 0)} assume true; {2259#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:25,815 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2259#(<= ~counter~0 0)} {2259#(<= ~counter~0 0)} #59#return; {2259#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:25,816 INFO L272 TraceCheckUtils]: 11: Hoare triple {2259#(<= ~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)); {2259#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:25,817 INFO L290 TraceCheckUtils]: 12: Hoare triple {2259#(<= ~counter~0 0)} ~cond := #in~cond; {2259#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:25,817 INFO L290 TraceCheckUtils]: 13: Hoare triple {2259#(<= ~counter~0 0)} assume !(0 == ~cond); {2259#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:25,818 INFO L290 TraceCheckUtils]: 14: Hoare triple {2259#(<= ~counter~0 0)} assume true; {2259#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:25,818 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2259#(<= ~counter~0 0)} {2259#(<= ~counter~0 0)} #61#return; {2259#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:25,819 INFO L290 TraceCheckUtils]: 16: Hoare triple {2259#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2259#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:25,819 INFO L290 TraceCheckUtils]: 17: Hoare triple {2259#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2308#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:25,820 INFO L290 TraceCheckUtils]: 18: Hoare triple {2308#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {2308#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:25,821 INFO L272 TraceCheckUtils]: 19: Hoare triple {2308#(<= ~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)); {2308#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:25,821 INFO L290 TraceCheckUtils]: 20: Hoare triple {2308#(<= ~counter~0 1)} ~cond := #in~cond; {2308#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:25,821 INFO L290 TraceCheckUtils]: 21: Hoare triple {2308#(<= ~counter~0 1)} assume !(0 == ~cond); {2308#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:25,822 INFO L290 TraceCheckUtils]: 22: Hoare triple {2308#(<= ~counter~0 1)} assume true; {2308#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:25,822 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2308#(<= ~counter~0 1)} {2308#(<= ~counter~0 1)} #63#return; {2308#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:25,823 INFO L290 TraceCheckUtils]: 24: Hoare triple {2308#(<= ~counter~0 1)} assume !!(0 != ~r~0); {2308#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:25,823 INFO L290 TraceCheckUtils]: 25: Hoare triple {2308#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2308#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:25,824 INFO L290 TraceCheckUtils]: 26: Hoare triple {2308#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2336#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:25,824 INFO L290 TraceCheckUtils]: 27: Hoare triple {2336#(<= ~counter~0 2)} assume !!(#t~post6 < 5);havoc #t~post6; {2336#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:25,825 INFO L272 TraceCheckUtils]: 28: Hoare triple {2336#(<= ~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)); {2336#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:25,825 INFO L290 TraceCheckUtils]: 29: Hoare triple {2336#(<= ~counter~0 2)} ~cond := #in~cond; {2336#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:25,826 INFO L290 TraceCheckUtils]: 30: Hoare triple {2336#(<= ~counter~0 2)} assume !(0 == ~cond); {2336#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:25,826 INFO L290 TraceCheckUtils]: 31: Hoare triple {2336#(<= ~counter~0 2)} assume true; {2336#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:25,828 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2336#(<= ~counter~0 2)} {2336#(<= ~counter~0 2)} #63#return; {2336#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:25,828 INFO L290 TraceCheckUtils]: 33: Hoare triple {2336#(<= ~counter~0 2)} assume !!(0 != ~r~0); {2336#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:25,829 INFO L290 TraceCheckUtils]: 34: Hoare triple {2336#(<= ~counter~0 2)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2336#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:25,830 INFO L290 TraceCheckUtils]: 35: Hoare triple {2336#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2364#(<= ~counter~0 3)} is VALID [2022-04-15 09:06:25,830 INFO L290 TraceCheckUtils]: 36: Hoare triple {2364#(<= ~counter~0 3)} assume !!(#t~post6 < 5);havoc #t~post6; {2364#(<= ~counter~0 3)} is VALID [2022-04-15 09:06:25,831 INFO L272 TraceCheckUtils]: 37: Hoare triple {2364#(<= ~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)); {2364#(<= ~counter~0 3)} is VALID [2022-04-15 09:06:25,832 INFO L290 TraceCheckUtils]: 38: Hoare triple {2364#(<= ~counter~0 3)} ~cond := #in~cond; {2364#(<= ~counter~0 3)} is VALID [2022-04-15 09:06:25,832 INFO L290 TraceCheckUtils]: 39: Hoare triple {2364#(<= ~counter~0 3)} assume !(0 == ~cond); {2364#(<= ~counter~0 3)} is VALID [2022-04-15 09:06:25,832 INFO L290 TraceCheckUtils]: 40: Hoare triple {2364#(<= ~counter~0 3)} assume true; {2364#(<= ~counter~0 3)} is VALID [2022-04-15 09:06:25,833 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2364#(<= ~counter~0 3)} {2364#(<= ~counter~0 3)} #63#return; {2364#(<= ~counter~0 3)} is VALID [2022-04-15 09:06:25,833 INFO L290 TraceCheckUtils]: 42: Hoare triple {2364#(<= ~counter~0 3)} assume !!(0 != ~r~0); {2364#(<= ~counter~0 3)} is VALID [2022-04-15 09:06:25,834 INFO L290 TraceCheckUtils]: 43: Hoare triple {2364#(<= ~counter~0 3)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2364#(<= ~counter~0 3)} is VALID [2022-04-15 09:06:25,834 INFO L290 TraceCheckUtils]: 44: Hoare triple {2364#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2392#(<= |main_#t~post6| 3)} is VALID [2022-04-15 09:06:25,835 INFO L290 TraceCheckUtils]: 45: Hoare triple {2392#(<= |main_#t~post6| 3)} assume !(#t~post6 < 5);havoc #t~post6; {2252#false} is VALID [2022-04-15 09:06:25,835 INFO L272 TraceCheckUtils]: 46: Hoare triple {2252#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)); {2252#false} is VALID [2022-04-15 09:06:25,835 INFO L290 TraceCheckUtils]: 47: Hoare triple {2252#false} ~cond := #in~cond; {2252#false} is VALID [2022-04-15 09:06:25,835 INFO L290 TraceCheckUtils]: 48: Hoare triple {2252#false} assume 0 == ~cond; {2252#false} is VALID [2022-04-15 09:06:25,835 INFO L290 TraceCheckUtils]: 49: Hoare triple {2252#false} assume !false; {2252#false} is VALID [2022-04-15 09:06:25,836 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-15 09:06:25,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:06:26,152 INFO L290 TraceCheckUtils]: 49: Hoare triple {2252#false} assume !false; {2252#false} is VALID [2022-04-15 09:06:26,153 INFO L290 TraceCheckUtils]: 48: Hoare triple {2252#false} assume 0 == ~cond; {2252#false} is VALID [2022-04-15 09:06:26,153 INFO L290 TraceCheckUtils]: 47: Hoare triple {2252#false} ~cond := #in~cond; {2252#false} is VALID [2022-04-15 09:06:26,153 INFO L272 TraceCheckUtils]: 46: Hoare triple {2252#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)); {2252#false} is VALID [2022-04-15 09:06:26,153 INFO L290 TraceCheckUtils]: 45: Hoare triple {2420#(< |main_#t~post6| 5)} assume !(#t~post6 < 5);havoc #t~post6; {2252#false} is VALID [2022-04-15 09:06:26,153 INFO L290 TraceCheckUtils]: 44: Hoare triple {2424#(< ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2420#(< |main_#t~post6| 5)} is VALID [2022-04-15 09:06:26,154 INFO L290 TraceCheckUtils]: 43: Hoare triple {2424#(< ~counter~0 5)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2424#(< ~counter~0 5)} is VALID [2022-04-15 09:06:26,154 INFO L290 TraceCheckUtils]: 42: Hoare triple {2424#(< ~counter~0 5)} assume !!(0 != ~r~0); {2424#(< ~counter~0 5)} is VALID [2022-04-15 09:06:26,155 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2251#true} {2424#(< ~counter~0 5)} #63#return; {2424#(< ~counter~0 5)} is VALID [2022-04-15 09:06:26,156 INFO L290 TraceCheckUtils]: 40: Hoare triple {2251#true} assume true; {2251#true} is VALID [2022-04-15 09:06:26,156 INFO L290 TraceCheckUtils]: 39: Hoare triple {2251#true} assume !(0 == ~cond); {2251#true} is VALID [2022-04-15 09:06:26,156 INFO L290 TraceCheckUtils]: 38: Hoare triple {2251#true} ~cond := #in~cond; {2251#true} is VALID [2022-04-15 09:06:26,156 INFO L272 TraceCheckUtils]: 37: Hoare triple {2424#(< ~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)); {2251#true} is VALID [2022-04-15 09:06:26,157 INFO L290 TraceCheckUtils]: 36: Hoare triple {2424#(< ~counter~0 5)} assume !!(#t~post6 < 5);havoc #t~post6; {2424#(< ~counter~0 5)} is VALID [2022-04-15 09:06:26,158 INFO L290 TraceCheckUtils]: 35: Hoare triple {2364#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2424#(< ~counter~0 5)} is VALID [2022-04-15 09:06:26,158 INFO L290 TraceCheckUtils]: 34: Hoare triple {2364#(<= ~counter~0 3)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2364#(<= ~counter~0 3)} is VALID [2022-04-15 09:06:26,158 INFO L290 TraceCheckUtils]: 33: Hoare triple {2364#(<= ~counter~0 3)} assume !!(0 != ~r~0); {2364#(<= ~counter~0 3)} is VALID [2022-04-15 09:06:26,159 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2251#true} {2364#(<= ~counter~0 3)} #63#return; {2364#(<= ~counter~0 3)} is VALID [2022-04-15 09:06:26,159 INFO L290 TraceCheckUtils]: 31: Hoare triple {2251#true} assume true; {2251#true} is VALID [2022-04-15 09:06:26,159 INFO L290 TraceCheckUtils]: 30: Hoare triple {2251#true} assume !(0 == ~cond); {2251#true} is VALID [2022-04-15 09:06:26,159 INFO L290 TraceCheckUtils]: 29: Hoare triple {2251#true} ~cond := #in~cond; {2251#true} is VALID [2022-04-15 09:06:26,160 INFO L272 TraceCheckUtils]: 28: Hoare triple {2364#(<= ~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)); {2251#true} is VALID [2022-04-15 09:06:26,160 INFO L290 TraceCheckUtils]: 27: Hoare triple {2364#(<= ~counter~0 3)} assume !!(#t~post6 < 5);havoc #t~post6; {2364#(<= ~counter~0 3)} is VALID [2022-04-15 09:06:26,160 INFO L290 TraceCheckUtils]: 26: Hoare triple {2336#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2364#(<= ~counter~0 3)} is VALID [2022-04-15 09:06:26,161 INFO L290 TraceCheckUtils]: 25: Hoare triple {2336#(<= ~counter~0 2)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2336#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:26,161 INFO L290 TraceCheckUtils]: 24: Hoare triple {2336#(<= ~counter~0 2)} assume !!(0 != ~r~0); {2336#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:26,167 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2251#true} {2336#(<= ~counter~0 2)} #63#return; {2336#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:26,167 INFO L290 TraceCheckUtils]: 22: Hoare triple {2251#true} assume true; {2251#true} is VALID [2022-04-15 09:06:26,167 INFO L290 TraceCheckUtils]: 21: Hoare triple {2251#true} assume !(0 == ~cond); {2251#true} is VALID [2022-04-15 09:06:26,168 INFO L290 TraceCheckUtils]: 20: Hoare triple {2251#true} ~cond := #in~cond; {2251#true} is VALID [2022-04-15 09:06:26,168 INFO L272 TraceCheckUtils]: 19: Hoare triple {2336#(<= ~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)); {2251#true} is VALID [2022-04-15 09:06:26,168 INFO L290 TraceCheckUtils]: 18: Hoare triple {2336#(<= ~counter~0 2)} assume !!(#t~post6 < 5);havoc #t~post6; {2336#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:26,169 INFO L290 TraceCheckUtils]: 17: Hoare triple {2308#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2336#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:26,169 INFO L290 TraceCheckUtils]: 16: Hoare triple {2308#(<= ~counter~0 1)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2308#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:26,170 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2251#true} {2308#(<= ~counter~0 1)} #61#return; {2308#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:26,170 INFO L290 TraceCheckUtils]: 14: Hoare triple {2251#true} assume true; {2251#true} is VALID [2022-04-15 09:06:26,170 INFO L290 TraceCheckUtils]: 13: Hoare triple {2251#true} assume !(0 == ~cond); {2251#true} is VALID [2022-04-15 09:06:26,170 INFO L290 TraceCheckUtils]: 12: Hoare triple {2251#true} ~cond := #in~cond; {2251#true} is VALID [2022-04-15 09:06:26,170 INFO L272 TraceCheckUtils]: 11: Hoare triple {2308#(<= ~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)); {2251#true} is VALID [2022-04-15 09:06:26,171 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2251#true} {2308#(<= ~counter~0 1)} #59#return; {2308#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:26,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {2251#true} assume true; {2251#true} is VALID [2022-04-15 09:06:26,171 INFO L290 TraceCheckUtils]: 8: Hoare triple {2251#true} assume !(0 == ~cond); {2251#true} is VALID [2022-04-15 09:06:26,171 INFO L290 TraceCheckUtils]: 7: Hoare triple {2251#true} ~cond := #in~cond; {2251#true} is VALID [2022-04-15 09:06:26,171 INFO L272 TraceCheckUtils]: 6: Hoare triple {2308#(<= ~counter~0 1)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2251#true} is VALID [2022-04-15 09:06:26,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {2308#(<= ~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; {2308#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:26,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {2308#(<= ~counter~0 1)} call #t~ret7 := main(); {2308#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:26,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2308#(<= ~counter~0 1)} {2251#true} #67#return; {2308#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:26,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {2308#(<= ~counter~0 1)} assume true; {2308#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:26,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {2251#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; {2308#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:26,178 INFO L272 TraceCheckUtils]: 0: Hoare triple {2251#true} call ULTIMATE.init(); {2251#true} is VALID [2022-04-15 09:06:26,178 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-15 09:06:26,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:06:26,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660654817] [2022-04-15 09:06:26,179 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:06:26,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414020800] [2022-04-15 09:06:26,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414020800] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:06:26,179 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:06:26,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-15 09:06:26,179 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:06:26,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1363208348] [2022-04-15 09:06:26,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1363208348] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:06:26,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:06:26,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 09:06:26,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726129721] [2022-04-15 09:06:26,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:06:26,180 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-15 09:06:26,180 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:06:26,181 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-15 09:06:26,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:06:26,222 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 09:06:26,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:06:26,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 09:06:26,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-15 09:06:26,223 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-15 09:06:26,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:06:26,413 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2022-04-15 09:06:26,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 09:06:26,413 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-15 09:06:26,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:06:26,414 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-15 09:06:26,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 65 transitions. [2022-04-15 09:06:26,416 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-15 09:06:26,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 65 transitions. [2022-04-15 09:06:26,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 65 transitions. [2022-04-15 09:06:26,476 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-15 09:06:26,477 INFO L225 Difference]: With dead ends: 61 [2022-04-15 09:06:26,477 INFO L226 Difference]: Without dead ends: 56 [2022-04-15 09:06:26,478 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-15 09:06:26,478 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 16 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 09:06:26,479 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 94 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 09:06:26,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-15 09:06:26,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-15 09:06:26,531 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:06:26,532 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-15 09:06:26,532 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-15 09:06:26,532 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-15 09:06:26,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:06:26,534 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-15 09:06:26,534 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-15 09:06:26,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:06:26,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:06:26,535 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-15 09:06:26,535 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-15 09:06:26,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:06:26,537 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-15 09:06:26,537 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-15 09:06:26,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:06:26,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:06:26,537 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:06:26,537 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:06:26,538 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-15 09:06:26,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-04-15 09:06:26,539 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 50 [2022-04-15 09:06:26,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:06:26,540 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-04-15 09:06:26,540 INFO L479 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-15 09:06:26,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 61 transitions. [2022-04-15 09:06:28,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 60 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 09:06:28,617 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-15 09:06:28,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 09:06:28,618 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:06:28,618 INFO L499 BasicCegarLoop]: 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-15 09:06:28,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 09:06:28,819 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:06:28,819 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:06:28,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:06:28,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1632159894, now seen corresponding path program 7 times [2022-04-15 09:06:28,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:06:28,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [641431213] [2022-04-15 09:06:28,820 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:06:28,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1632159894, now seen corresponding path program 8 times [2022-04-15 09:06:28,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:06:28,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23385634] [2022-04-15 09:06:28,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:06:28,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:06:28,833 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:06:28,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [132204752] [2022-04-15 09:06:28,834 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:06:28,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:06:28,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:06:28,835 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:06:28,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 09:06:28,887 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:06:28,888 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:06:28,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 09:06:28,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:06:28,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:06:29,234 INFO L272 TraceCheckUtils]: 0: Hoare triple {2911#true} call ULTIMATE.init(); {2911#true} is VALID [2022-04-15 09:06:29,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {2911#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; {2919#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:29,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {2919#(<= ~counter~0 0)} assume true; {2919#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:29,235 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2919#(<= ~counter~0 0)} {2911#true} #67#return; {2919#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:29,236 INFO L272 TraceCheckUtils]: 4: Hoare triple {2919#(<= ~counter~0 0)} call #t~ret7 := main(); {2919#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:29,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {2919#(<= ~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; {2919#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:29,237 INFO L272 TraceCheckUtils]: 6: Hoare triple {2919#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2919#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:29,237 INFO L290 TraceCheckUtils]: 7: Hoare triple {2919#(<= ~counter~0 0)} ~cond := #in~cond; {2919#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:29,238 INFO L290 TraceCheckUtils]: 8: Hoare triple {2919#(<= ~counter~0 0)} assume !(0 == ~cond); {2919#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:29,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {2919#(<= ~counter~0 0)} assume true; {2919#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:29,239 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2919#(<= ~counter~0 0)} {2919#(<= ~counter~0 0)} #59#return; {2919#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:29,240 INFO L272 TraceCheckUtils]: 11: Hoare triple {2919#(<= ~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)); {2919#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:29,240 INFO L290 TraceCheckUtils]: 12: Hoare triple {2919#(<= ~counter~0 0)} ~cond := #in~cond; {2919#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:29,241 INFO L290 TraceCheckUtils]: 13: Hoare triple {2919#(<= ~counter~0 0)} assume !(0 == ~cond); {2919#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:29,241 INFO L290 TraceCheckUtils]: 14: Hoare triple {2919#(<= ~counter~0 0)} assume true; {2919#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:29,242 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2919#(<= ~counter~0 0)} {2919#(<= ~counter~0 0)} #61#return; {2919#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:29,242 INFO L290 TraceCheckUtils]: 16: Hoare triple {2919#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2919#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:29,243 INFO L290 TraceCheckUtils]: 17: Hoare triple {2919#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2968#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:29,243 INFO L290 TraceCheckUtils]: 18: Hoare triple {2968#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {2968#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:29,244 INFO L272 TraceCheckUtils]: 19: Hoare triple {2968#(<= ~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)); {2968#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:29,245 INFO L290 TraceCheckUtils]: 20: Hoare triple {2968#(<= ~counter~0 1)} ~cond := #in~cond; {2968#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:29,245 INFO L290 TraceCheckUtils]: 21: Hoare triple {2968#(<= ~counter~0 1)} assume !(0 == ~cond); {2968#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:29,245 INFO L290 TraceCheckUtils]: 22: Hoare triple {2968#(<= ~counter~0 1)} assume true; {2968#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:29,246 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2968#(<= ~counter~0 1)} {2968#(<= ~counter~0 1)} #63#return; {2968#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:29,247 INFO L290 TraceCheckUtils]: 24: Hoare triple {2968#(<= ~counter~0 1)} assume !!(0 != ~r~0); {2968#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:29,247 INFO L290 TraceCheckUtils]: 25: Hoare triple {2968#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2968#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:29,247 INFO L290 TraceCheckUtils]: 26: Hoare triple {2968#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2996#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:29,248 INFO L290 TraceCheckUtils]: 27: Hoare triple {2996#(<= ~counter~0 2)} assume !!(#t~post6 < 5);havoc #t~post6; {2996#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:29,248 INFO L272 TraceCheckUtils]: 28: Hoare triple {2996#(<= ~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)); {2996#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:29,249 INFO L290 TraceCheckUtils]: 29: Hoare triple {2996#(<= ~counter~0 2)} ~cond := #in~cond; {2996#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:29,249 INFO L290 TraceCheckUtils]: 30: Hoare triple {2996#(<= ~counter~0 2)} assume !(0 == ~cond); {2996#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:29,249 INFO L290 TraceCheckUtils]: 31: Hoare triple {2996#(<= ~counter~0 2)} assume true; {2996#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:29,250 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2996#(<= ~counter~0 2)} {2996#(<= ~counter~0 2)} #63#return; {2996#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:29,250 INFO L290 TraceCheckUtils]: 33: Hoare triple {2996#(<= ~counter~0 2)} assume !!(0 != ~r~0); {2996#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:29,250 INFO L290 TraceCheckUtils]: 34: Hoare triple {2996#(<= ~counter~0 2)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2996#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:29,251 INFO L290 TraceCheckUtils]: 35: Hoare triple {2996#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3024#(<= ~counter~0 3)} is VALID [2022-04-15 09:06:29,251 INFO L290 TraceCheckUtils]: 36: Hoare triple {3024#(<= ~counter~0 3)} assume !!(#t~post6 < 5);havoc #t~post6; {3024#(<= ~counter~0 3)} is VALID [2022-04-15 09:06:29,252 INFO L272 TraceCheckUtils]: 37: Hoare triple {3024#(<= ~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)); {3024#(<= ~counter~0 3)} is VALID [2022-04-15 09:06:29,252 INFO L290 TraceCheckUtils]: 38: Hoare triple {3024#(<= ~counter~0 3)} ~cond := #in~cond; {3024#(<= ~counter~0 3)} is VALID [2022-04-15 09:06:29,252 INFO L290 TraceCheckUtils]: 39: Hoare triple {3024#(<= ~counter~0 3)} assume !(0 == ~cond); {3024#(<= ~counter~0 3)} is VALID [2022-04-15 09:06:29,252 INFO L290 TraceCheckUtils]: 40: Hoare triple {3024#(<= ~counter~0 3)} assume true; {3024#(<= ~counter~0 3)} is VALID [2022-04-15 09:06:29,253 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3024#(<= ~counter~0 3)} {3024#(<= ~counter~0 3)} #63#return; {3024#(<= ~counter~0 3)} is VALID [2022-04-15 09:06:29,253 INFO L290 TraceCheckUtils]: 42: Hoare triple {3024#(<= ~counter~0 3)} assume !!(0 != ~r~0); {3024#(<= ~counter~0 3)} is VALID [2022-04-15 09:06:29,253 INFO L290 TraceCheckUtils]: 43: Hoare triple {3024#(<= ~counter~0 3)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {3024#(<= ~counter~0 3)} is VALID [2022-04-15 09:06:29,254 INFO L290 TraceCheckUtils]: 44: Hoare triple {3024#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3052#(<= ~counter~0 4)} is VALID [2022-04-15 09:06:29,254 INFO L290 TraceCheckUtils]: 45: Hoare triple {3052#(<= ~counter~0 4)} assume !!(#t~post6 < 5);havoc #t~post6; {3052#(<= ~counter~0 4)} is VALID [2022-04-15 09:06:29,255 INFO L272 TraceCheckUtils]: 46: Hoare triple {3052#(<= ~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)); {3052#(<= ~counter~0 4)} is VALID [2022-04-15 09:06:29,255 INFO L290 TraceCheckUtils]: 47: Hoare triple {3052#(<= ~counter~0 4)} ~cond := #in~cond; {3052#(<= ~counter~0 4)} is VALID [2022-04-15 09:06:29,255 INFO L290 TraceCheckUtils]: 48: Hoare triple {3052#(<= ~counter~0 4)} assume !(0 == ~cond); {3052#(<= ~counter~0 4)} is VALID [2022-04-15 09:06:29,256 INFO L290 TraceCheckUtils]: 49: Hoare triple {3052#(<= ~counter~0 4)} assume true; {3052#(<= ~counter~0 4)} is VALID [2022-04-15 09:06:29,256 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3052#(<= ~counter~0 4)} {3052#(<= ~counter~0 4)} #63#return; {3052#(<= ~counter~0 4)} is VALID [2022-04-15 09:06:29,256 INFO L290 TraceCheckUtils]: 51: Hoare triple {3052#(<= ~counter~0 4)} assume !!(0 != ~r~0); {3052#(<= ~counter~0 4)} is VALID [2022-04-15 09:06:29,257 INFO L290 TraceCheckUtils]: 52: Hoare triple {3052#(<= ~counter~0 4)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {3052#(<= ~counter~0 4)} is VALID [2022-04-15 09:06:29,257 INFO L290 TraceCheckUtils]: 53: Hoare triple {3052#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3080#(<= |main_#t~post6| 4)} is VALID [2022-04-15 09:06:29,257 INFO L290 TraceCheckUtils]: 54: Hoare triple {3080#(<= |main_#t~post6| 4)} assume !(#t~post6 < 5);havoc #t~post6; {2912#false} is VALID [2022-04-15 09:06:29,258 INFO L272 TraceCheckUtils]: 55: Hoare triple {2912#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)); {2912#false} is VALID [2022-04-15 09:06:29,258 INFO L290 TraceCheckUtils]: 56: Hoare triple {2912#false} ~cond := #in~cond; {2912#false} is VALID [2022-04-15 09:06:29,258 INFO L290 TraceCheckUtils]: 57: Hoare triple {2912#false} assume 0 == ~cond; {2912#false} is VALID [2022-04-15 09:06:29,258 INFO L290 TraceCheckUtils]: 58: Hoare triple {2912#false} assume !false; {2912#false} is VALID [2022-04-15 09:06:29,258 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-15 09:06:29,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:06:29,558 INFO L290 TraceCheckUtils]: 58: Hoare triple {2912#false} assume !false; {2912#false} is VALID [2022-04-15 09:06:29,558 INFO L290 TraceCheckUtils]: 57: Hoare triple {2912#false} assume 0 == ~cond; {2912#false} is VALID [2022-04-15 09:06:29,558 INFO L290 TraceCheckUtils]: 56: Hoare triple {2912#false} ~cond := #in~cond; {2912#false} is VALID [2022-04-15 09:06:29,558 INFO L272 TraceCheckUtils]: 55: Hoare triple {2912#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)); {2912#false} is VALID [2022-04-15 09:06:29,559 INFO L290 TraceCheckUtils]: 54: Hoare triple {3080#(<= |main_#t~post6| 4)} assume !(#t~post6 < 5);havoc #t~post6; {2912#false} is VALID [2022-04-15 09:06:29,559 INFO L290 TraceCheckUtils]: 53: Hoare triple {3052#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3080#(<= |main_#t~post6| 4)} is VALID [2022-04-15 09:06:29,560 INFO L290 TraceCheckUtils]: 52: Hoare triple {3052#(<= ~counter~0 4)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {3052#(<= ~counter~0 4)} is VALID [2022-04-15 09:06:29,560 INFO L290 TraceCheckUtils]: 51: Hoare triple {3052#(<= ~counter~0 4)} assume !!(0 != ~r~0); {3052#(<= ~counter~0 4)} is VALID [2022-04-15 09:06:29,561 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2911#true} {3052#(<= ~counter~0 4)} #63#return; {3052#(<= ~counter~0 4)} is VALID [2022-04-15 09:06:29,561 INFO L290 TraceCheckUtils]: 49: Hoare triple {2911#true} assume true; {2911#true} is VALID [2022-04-15 09:06:29,561 INFO L290 TraceCheckUtils]: 48: Hoare triple {2911#true} assume !(0 == ~cond); {2911#true} is VALID [2022-04-15 09:06:29,561 INFO L290 TraceCheckUtils]: 47: Hoare triple {2911#true} ~cond := #in~cond; {2911#true} is VALID [2022-04-15 09:06:29,561 INFO L272 TraceCheckUtils]: 46: Hoare triple {3052#(<= ~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)); {2911#true} is VALID [2022-04-15 09:06:29,561 INFO L290 TraceCheckUtils]: 45: Hoare triple {3052#(<= ~counter~0 4)} assume !!(#t~post6 < 5);havoc #t~post6; {3052#(<= ~counter~0 4)} is VALID [2022-04-15 09:06:29,562 INFO L290 TraceCheckUtils]: 44: Hoare triple {3024#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3052#(<= ~counter~0 4)} is VALID [2022-04-15 09:06:29,562 INFO L290 TraceCheckUtils]: 43: Hoare triple {3024#(<= ~counter~0 3)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {3024#(<= ~counter~0 3)} is VALID [2022-04-15 09:06:29,563 INFO L290 TraceCheckUtils]: 42: Hoare triple {3024#(<= ~counter~0 3)} assume !!(0 != ~r~0); {3024#(<= ~counter~0 3)} is VALID [2022-04-15 09:06:29,563 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2911#true} {3024#(<= ~counter~0 3)} #63#return; {3024#(<= ~counter~0 3)} is VALID [2022-04-15 09:06:29,564 INFO L290 TraceCheckUtils]: 40: Hoare triple {2911#true} assume true; {2911#true} is VALID [2022-04-15 09:06:29,564 INFO L290 TraceCheckUtils]: 39: Hoare triple {2911#true} assume !(0 == ~cond); {2911#true} is VALID [2022-04-15 09:06:29,564 INFO L290 TraceCheckUtils]: 38: Hoare triple {2911#true} ~cond := #in~cond; {2911#true} is VALID [2022-04-15 09:06:29,564 INFO L272 TraceCheckUtils]: 37: Hoare triple {3024#(<= ~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)); {2911#true} is VALID [2022-04-15 09:06:29,564 INFO L290 TraceCheckUtils]: 36: Hoare triple {3024#(<= ~counter~0 3)} assume !!(#t~post6 < 5);havoc #t~post6; {3024#(<= ~counter~0 3)} is VALID [2022-04-15 09:06:29,565 INFO L290 TraceCheckUtils]: 35: Hoare triple {2996#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3024#(<= ~counter~0 3)} is VALID [2022-04-15 09:06:29,565 INFO L290 TraceCheckUtils]: 34: Hoare triple {2996#(<= ~counter~0 2)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2996#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:29,566 INFO L290 TraceCheckUtils]: 33: Hoare triple {2996#(<= ~counter~0 2)} assume !!(0 != ~r~0); {2996#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:29,566 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2911#true} {2996#(<= ~counter~0 2)} #63#return; {2996#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:29,566 INFO L290 TraceCheckUtils]: 31: Hoare triple {2911#true} assume true; {2911#true} is VALID [2022-04-15 09:06:29,566 INFO L290 TraceCheckUtils]: 30: Hoare triple {2911#true} assume !(0 == ~cond); {2911#true} is VALID [2022-04-15 09:06:29,567 INFO L290 TraceCheckUtils]: 29: Hoare triple {2911#true} ~cond := #in~cond; {2911#true} is VALID [2022-04-15 09:06:29,567 INFO L272 TraceCheckUtils]: 28: Hoare triple {2996#(<= ~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)); {2911#true} is VALID [2022-04-15 09:06:29,567 INFO L290 TraceCheckUtils]: 27: Hoare triple {2996#(<= ~counter~0 2)} assume !!(#t~post6 < 5);havoc #t~post6; {2996#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:29,568 INFO L290 TraceCheckUtils]: 26: Hoare triple {2968#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2996#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:29,568 INFO L290 TraceCheckUtils]: 25: Hoare triple {2968#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2968#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:29,568 INFO L290 TraceCheckUtils]: 24: Hoare triple {2968#(<= ~counter~0 1)} assume !!(0 != ~r~0); {2968#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:29,569 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2911#true} {2968#(<= ~counter~0 1)} #63#return; {2968#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:29,569 INFO L290 TraceCheckUtils]: 22: Hoare triple {2911#true} assume true; {2911#true} is VALID [2022-04-15 09:06:29,569 INFO L290 TraceCheckUtils]: 21: Hoare triple {2911#true} assume !(0 == ~cond); {2911#true} is VALID [2022-04-15 09:06:29,569 INFO L290 TraceCheckUtils]: 20: Hoare triple {2911#true} ~cond := #in~cond; {2911#true} is VALID [2022-04-15 09:06:29,569 INFO L272 TraceCheckUtils]: 19: Hoare triple {2968#(<= ~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)); {2911#true} is VALID [2022-04-15 09:06:29,570 INFO L290 TraceCheckUtils]: 18: Hoare triple {2968#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {2968#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:29,570 INFO L290 TraceCheckUtils]: 17: Hoare triple {2919#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2968#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:29,571 INFO L290 TraceCheckUtils]: 16: Hoare triple {2919#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2919#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:29,571 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2911#true} {2919#(<= ~counter~0 0)} #61#return; {2919#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:29,572 INFO L290 TraceCheckUtils]: 14: Hoare triple {2911#true} assume true; {2911#true} is VALID [2022-04-15 09:06:29,572 INFO L290 TraceCheckUtils]: 13: Hoare triple {2911#true} assume !(0 == ~cond); {2911#true} is VALID [2022-04-15 09:06:29,572 INFO L290 TraceCheckUtils]: 12: Hoare triple {2911#true} ~cond := #in~cond; {2911#true} is VALID [2022-04-15 09:06:29,572 INFO L272 TraceCheckUtils]: 11: Hoare triple {2919#(<= ~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)); {2911#true} is VALID [2022-04-15 09:06:29,573 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2911#true} {2919#(<= ~counter~0 0)} #59#return; {2919#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:29,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {2911#true} assume true; {2911#true} is VALID [2022-04-15 09:06:29,573 INFO L290 TraceCheckUtils]: 8: Hoare triple {2911#true} assume !(0 == ~cond); {2911#true} is VALID [2022-04-15 09:06:29,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {2911#true} ~cond := #in~cond; {2911#true} is VALID [2022-04-15 09:06:29,573 INFO L272 TraceCheckUtils]: 6: Hoare triple {2919#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2911#true} is VALID [2022-04-15 09:06:29,573 INFO L290 TraceCheckUtils]: 5: Hoare triple {2919#(<= ~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; {2919#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:29,574 INFO L272 TraceCheckUtils]: 4: Hoare triple {2919#(<= ~counter~0 0)} call #t~ret7 := main(); {2919#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:29,574 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2919#(<= ~counter~0 0)} {2911#true} #67#return; {2919#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:29,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {2919#(<= ~counter~0 0)} assume true; {2919#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:29,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {2911#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; {2919#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:29,575 INFO L272 TraceCheckUtils]: 0: Hoare triple {2911#true} call ULTIMATE.init(); {2911#true} is VALID [2022-04-15 09:06:29,576 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-15 09:06:29,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:06:29,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23385634] [2022-04-15 09:06:29,576 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:06:29,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132204752] [2022-04-15 09:06:29,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132204752] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:06:29,576 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:06:29,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-15 09:06:29,577 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:06:29,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [641431213] [2022-04-15 09:06:29,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [641431213] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:06:29,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:06:29,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 09:06:29,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747563219] [2022-04-15 09:06:29,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:06:29,578 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-15 09:06:29,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:06:29,578 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 09:06:29,630 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:06:29,630 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 09:06:29,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:06:29,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 09:06:29,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-15 09:06:29,631 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-15 09:06:29,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:06:29,861 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2022-04-15 09:06:29,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 09:06:29,862 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-15 09:06:29,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:06:29,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 09:06:29,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 75 transitions. [2022-04-15 09:06:29,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 09:06:29,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 75 transitions. [2022-04-15 09:06:29,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 75 transitions. [2022-04-15 09:06:29,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:06:29,930 INFO L225 Difference]: With dead ends: 70 [2022-04-15 09:06:29,930 INFO L226 Difference]: Without dead ends: 65 [2022-04-15 09:06:29,930 INFO L912 BasicCegarLoop]: 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-15 09:06:29,931 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 18 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 09:06:29,931 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 102 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 09:06:29,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-15 09:06:29,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-15 09:06:29,993 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:06:29,994 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-15 09:06:29,994 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-15 09:06:29,995 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-15 09:06:29,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:06:29,997 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-04-15 09:06:29,997 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-04-15 09:06:29,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:06:29,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:06:29,999 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-15 09:06:30,005 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-15 09:06:30,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:06:30,008 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-04-15 09:06:30,008 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-04-15 09:06:30,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:06:30,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:06:30,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:06:30,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:06:30,009 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-15 09:06:30,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2022-04-15 09:06:30,012 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 59 [2022-04-15 09:06:30,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:06:30,012 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2022-04-15 09:06:30,014 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 09:06:30,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 71 transitions. [2022-04-15 09:06:31,308 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-15 09:06:31,309 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-04-15 09:06:31,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-15 09:06:31,309 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:06:31,309 INFO L499 BasicCegarLoop]: 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-15 09:06:31,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-15 09:06:31,519 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-04-15 09:06:31,520 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:06:31,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:06:31,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1512407140, now seen corresponding path program 9 times [2022-04-15 09:06:31,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:06:31,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [815309348] [2022-04-15 09:06:31,520 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:06:31,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1512407140, now seen corresponding path program 10 times [2022-04-15 09:06:31,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:06:31,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619957137] [2022-04-15 09:06:31,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:06:31,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:06:31,534 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:06:31,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1398412318] [2022-04-15 09:06:31,534 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 09:06:31,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:06:31,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:06:31,540 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:06:31,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-15 09:06:31,667 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 09:06:31,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-15 09:06:31,667 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 09:06:31,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 09:06:31,719 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 09:06:31,719 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-15 09:06:31,720 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-15 09:06:31,722 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 09:06:31,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-15 09:06:31,939 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:06:31,941 INFO L719 BasicCegarLoop]: Path program histogram: [10, 2, 2, 2, 2] [2022-04-15 09:06:31,943 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 09:06:31,954 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 09:06:31,955 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-15 09:06:31,955 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 09:06:31,955 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 09:06:31,955 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-15 09:06:31,955 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-15 09:06:31,955 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-15 09:06:31,955 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 09:06:31,955 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 09:06:31,955 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 09:06:31,955 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 09:06:31,955 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-15 09:06:31,955 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-15 09:06:31,955 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-15 09:06:31,955 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-15 09:06:31,955 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-15 09:06:31,955 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-15 09:06:31,955 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 09:06:31,955 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 09:06:31,956 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-15 09:06:31,956 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-04-15 09:06:31,956 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-04-15 09:06:31,956 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-15 09:06:31,956 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-15 09:06:31,956 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-15 09:06:31,956 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 09:06:31,956 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 09:06:31,956 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-15 09:06:31,956 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 09:06:31,956 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 09:06:31,956 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2022-04-15 09:06:31,956 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2022-04-15 09:06:31,956 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-15 09:06:31,956 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-15 09:06:31,956 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-15 09:06:31,956 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-15 09:06:31,956 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-15 09:06:31,956 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-15 09:06:31,956 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-15 09:06:31,956 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-15 09:06:31,956 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-15 09:06:31,957 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 09:06:31,957 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-15 09:06:31,957 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-15 09:06:31,957 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 09:06:31,957 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 09:06:31,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 09:06:31 BoogieIcfgContainer [2022-04-15 09:06:31,957 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 09:06:31,958 INFO L158 Benchmark]: Toolchain (without parser) took 34968.69ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 143.2MB in the beginning and 159.8MB in the end (delta: -16.6MB). Peak memory consumption was 24.7MB. Max. memory is 8.0GB. [2022-04-15 09:06:31,958 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 195.0MB. Free memory is still 159.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 09:06:31,959 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.02ms. Allocated memory is still 195.0MB. Free memory was 143.0MB in the beginning and 169.8MB in the end (delta: -26.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-15 09:06:31,959 INFO L158 Benchmark]: Boogie Preprocessor took 40.80ms. Allocated memory is still 195.0MB. Free memory was 169.8MB in the beginning and 168.4MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 09:06:31,959 INFO L158 Benchmark]: RCFGBuilder took 355.18ms. Allocated memory is still 195.0MB. Free memory was 168.2MB in the beginning and 156.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 09:06:31,959 INFO L158 Benchmark]: TraceAbstraction took 34317.02ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 156.1MB in the beginning and 159.8MB in the end (delta: -3.6MB). Peak memory consumption was 37.3MB. Max. memory is 8.0GB. [2022-04-15 09:06:31,960 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.10ms. Allocated memory is still 195.0MB. Free memory is still 159.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 250.02ms. Allocated memory is still 195.0MB. Free memory was 143.0MB in the beginning and 169.8MB in the end (delta: -26.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.80ms. Allocated memory is still 195.0MB. Free memory was 169.8MB in the beginning and 168.4MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 355.18ms. Allocated memory is still 195.0MB. Free memory was 168.2MB in the beginning and 156.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 34317.02ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 156.1MB in the beginning and 159.8MB in the end (delta: -3.6MB). Peak memory consumption was 37.3MB. 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: 34.3s, OverallIterations: 9, TraceHistogramMax: 6, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 11.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 75 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 74 mSDsluCounter, 655 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 435 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 169 IncrementalHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 220 mSDtfsCounter, 169 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 496 GetRequests, 439 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s 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.4s AutomataMinimizationTime, 8 MinimizatonAttempts, 10 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-15 09:06:31,975 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...