/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench/fermat2-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 10:45:08,309 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 10:45:08,311 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 10:45:08,357 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 10:45:08,358 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 10:45:08,359 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 10:45:08,361 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 10:45:08,364 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 10:45:08,366 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 10:45:08,370 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 10:45:08,371 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 10:45:08,372 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 10:45:08,372 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 10:45:08,374 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 10:45:08,375 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 10:45:08,378 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 10:45:08,378 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 10:45:08,379 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 10:45:08,380 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 10:45:08,392 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 10:45:08,393 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 10:45:08,395 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 10:45:08,395 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 10:45:08,396 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 10:45:08,396 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 10:45:08,397 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 10:45:08,398 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 10:45:08,398 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 10:45:08,398 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 10:45:08,398 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 10:45:08,399 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 10:45:08,399 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 10:45:08,399 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 10:45:08,400 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 10:45:08,400 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 10:45:08,401 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 10:45:08,401 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 10:45:08,401 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 10:45:08,401 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 10:45:08,402 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 10:45:08,402 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 10:45:08,407 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 10:45:08,407 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 10:45:08,414 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 10:45:08,415 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 10:45:08,416 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 10:45:08,416 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 10:45:08,416 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 10:45:08,416 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 10:45:08,416 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 10:45:08,416 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 10:45:08,416 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 10:45:08,417 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 10:45:08,417 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 10:45:08,417 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 10:45:08,417 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 10:45:08,417 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 10:45:08,417 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 10:45:08,417 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:45:08,417 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 10:45:08,418 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 10:45:08,418 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 10:45:08,418 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 10:45:08,418 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 10:45:08,418 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 10:45:08,418 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-08 10:45:08,629 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 10:45:08,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 10:45:08,660 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 10:45:08,661 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 10:45:08,662 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 10:45:08,663 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/fermat2-ll.c [2022-04-08 10:45:08,718 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca21e9aaf/42f99c89782f4b8abebfeaaf95c08fe8/FLAG9e98e40a1 [2022-04-08 10:45:09,137 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 10:45:09,137 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/fermat2-ll.c [2022-04-08 10:45:09,146 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca21e9aaf/42f99c89782f4b8abebfeaaf95c08fe8/FLAG9e98e40a1 [2022-04-08 10:45:09,159 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca21e9aaf/42f99c89782f4b8abebfeaaf95c08fe8 [2022-04-08 10:45:09,161 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 10:45:09,163 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 10:45:09,165 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 10:45:09,165 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 10:45:09,168 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 10:45:09,169 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:45:09" (1/1) ... [2022-04-08 10:45:09,170 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@736d96bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:45:09, skipping insertion in model container [2022-04-08 10:45:09,170 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:45:09" (1/1) ... [2022-04-08 10:45:09,175 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 10:45:09,189 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 10:45:09,339 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/fermat2-ll.c[524,537] [2022-04-08 10:45:09,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:45:09,372 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 10:45:09,383 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/fermat2-ll.c[524,537] [2022-04-08 10:45:09,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:45:09,416 INFO L208 MainTranslator]: Completed translation [2022-04-08 10:45:09,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:45:09 WrapperNode [2022-04-08 10:45:09,416 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 10:45:09,417 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 10:45:09,417 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 10:45:09,417 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 10:45:09,426 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:45:09" (1/1) ... [2022-04-08 10:45:09,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:45:09" (1/1) ... [2022-04-08 10:45:09,431 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:45:09" (1/1) ... [2022-04-08 10:45:09,432 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:45:09" (1/1) ... [2022-04-08 10:45:09,442 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:45:09" (1/1) ... [2022-04-08 10:45:09,446 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:45:09" (1/1) ... [2022-04-08 10:45:09,448 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:45:09" (1/1) ... [2022-04-08 10:45:09,453 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 10:45:09,454 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 10:45:09,454 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 10:45:09,454 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 10:45:09,455 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:45:09" (1/1) ... [2022-04-08 10:45:09,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:45:09,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:45:09,476 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-08 10:45:09,504 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-08 10:45:09,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 10:45:09,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 10:45:09,527 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 10:45:09,527 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 10:45:09,527 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 10:45:09,528 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 10:45:09,528 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 10:45:09,528 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 10:45:09,528 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 10:45:09,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 10:45:09,528 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 10:45:09,529 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 10:45:09,529 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 10:45:09,529 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 10:45:09,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 10:45:09,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 10:45:09,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 10:45:09,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 10:45:09,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 10:45:09,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 10:45:09,572 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 10:45:09,574 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 10:45:09,724 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 10:45:09,730 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 10:45:09,730 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 10:45:09,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:45:09 BoogieIcfgContainer [2022-04-08 10:45:09,732 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 10:45:09,734 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 10:45:09,734 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 10:45:09,741 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 10:45:09,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 10:45:09" (1/3) ... [2022-04-08 10:45:09,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f5f0f03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:45:09, skipping insertion in model container [2022-04-08 10:45:09,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:45:09" (2/3) ... [2022-04-08 10:45:09,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f5f0f03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:45:09, skipping insertion in model container [2022-04-08 10:45:09,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:45:09" (3/3) ... [2022-04-08 10:45:09,743 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat2-ll.c [2022-04-08 10:45:09,747 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 10:45:09,747 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 10:45:09,793 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 10:45:09,800 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-08 10:45:09,800 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 10:45:09,817 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 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-08 10:45:09,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 10:45:09,822 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:45:09,822 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-08 10:45:09,823 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:45:09,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:45:09,827 INFO L85 PathProgramCache]: Analyzing trace with hash -786972844, now seen corresponding path program 1 times [2022-04-08 10:45:09,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:45:09,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1996791357] [2022-04-08 10:45:09,841 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:45:09,842 INFO L85 PathProgramCache]: Analyzing trace with hash -786972844, now seen corresponding path program 2 times [2022-04-08 10:45:09,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:45:09,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513145641] [2022-04-08 10:45:09,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:45:09,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:45:09,939 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:45:09,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1357366459] [2022-04-08 10:45:09,939 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:45:09,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:45:09,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:45:09,956 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-08 10:45:09,957 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-08 10:45:10,030 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 10:45:10,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:45:10,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-08 10:45:10,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:45:10,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:45:10,169 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2022-04-08 10:45:10,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#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); {32#true} is VALID [2022-04-08 10:45:10,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-08 10:45:10,169 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #66#return; {32#true} is VALID [2022-04-08 10:45:10,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2022-04-08 10:45:10,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#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; {32#true} is VALID [2022-04-08 10:45:10,170 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {32#true} is VALID [2022-04-08 10:45:10,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-08 10:45:10,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {32#true} is VALID [2022-04-08 10:45:10,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-08 10:45:10,171 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32#true} {32#true} #58#return; {32#true} is VALID [2022-04-08 10:45:10,171 INFO L272 TraceCheckUtils]: 11: Hoare triple {32#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)); {32#true} is VALID [2022-04-08 10:45:10,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-08 10:45:10,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-08 10:45:10,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-08 10:45:10,172 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {33#false} {32#true} #60#return; {33#false} is VALID [2022-04-08 10:45:10,172 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {33#false} is VALID [2022-04-08 10:45:10,173 INFO L290 TraceCheckUtils]: 17: Hoare triple {33#false} assume !true; {33#false} is VALID [2022-04-08 10:45:10,173 INFO L272 TraceCheckUtils]: 18: Hoare triple {33#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)); {33#false} is VALID [2022-04-08 10:45:10,173 INFO L290 TraceCheckUtils]: 19: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-08 10:45:10,173 INFO L290 TraceCheckUtils]: 20: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-08 10:45:10,174 INFO L290 TraceCheckUtils]: 21: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-08 10:45:10,175 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-08 10:45:10,175 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 10:45:10,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:45:10,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513145641] [2022-04-08 10:45:10,175 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:45:10,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357366459] [2022-04-08 10:45:10,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357366459] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:45:10,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:45:10,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-08 10:45:10,179 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:45:10,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1996791357] [2022-04-08 10:45:10,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1996791357] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:45:10,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:45:10,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-08 10:45:10,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290890828] [2022-04-08 10:45:10,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:45:10,185 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-08 10:45:10,186 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:45:10,192 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-08 10:45:10,224 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-08 10:45:10,224 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-08 10:45:10,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:45:10,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-08 10:45:10,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-08 10:45:10,246 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 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-08 10:45:10,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:45:10,291 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-08 10:45:10,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-08 10:45:10,292 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-08 10:45:10,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:45:10,293 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-08 10:45:10,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 68 transitions. [2022-04-08 10:45:10,313 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-08 10:45:10,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 68 transitions. [2022-04-08 10:45:10,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 68 transitions. [2022-04-08 10:45:10,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:45:10,408 INFO L225 Difference]: With dead ends: 51 [2022-04-08 10:45:10,408 INFO L226 Difference]: Without dead ends: 24 [2022-04-08 10:45:10,411 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-08 10:45:10,415 INFO L913 BasicCegarLoop]: 32 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, 32 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-08 10:45:10,416 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:45:10,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-08 10:45:10,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-08 10:45:10,440 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:45:10,441 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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-08 10:45:10,442 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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-08 10:45:10,442 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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-08 10:45:10,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:45:10,446 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-08 10:45:10,447 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-08 10:45:10,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:45:10,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:45:10,450 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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 24 states. [2022-04-08 10:45:10,455 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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 24 states. [2022-04-08 10:45:10,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:45:10,458 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-08 10:45:10,458 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-08 10:45:10,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:45:10,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:45:10,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:45:10,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:45:10,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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-08 10:45:10,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-08 10:45:10,464 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 22 [2022-04-08 10:45:10,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:45:10,465 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-08 10:45:10,465 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-08 10:45:10,465 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 27 transitions. [2022-04-08 10:45:10,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:45:10,488 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-08 10:45:10,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 10:45:10,488 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:45:10,488 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-08 10:45:10,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 10:45:10,695 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-08 10:45:10,696 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:45:10,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:45:10,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1131020600, now seen corresponding path program 1 times [2022-04-08 10:45:10,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:45:10,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2076508033] [2022-04-08 10:45:10,697 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:45:10,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1131020600, now seen corresponding path program 2 times [2022-04-08 10:45:10,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:45:10,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430957205] [2022-04-08 10:45:10,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:45:10,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:45:10,719 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:45:10,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1758582110] [2022-04-08 10:45:10,719 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:45:10,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:45:10,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:45:10,722 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-08 10:45:10,723 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-08 10:45:10,778 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 10:45:10,778 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:45:10,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 10:45:10,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:45:10,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:45:11,917 INFO L272 TraceCheckUtils]: 0: Hoare triple {297#true} call ULTIMATE.init(); {297#true} is VALID [2022-04-08 10:45:11,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {297#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); {297#true} is VALID [2022-04-08 10:45:11,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {297#true} assume true; {297#true} is VALID [2022-04-08 10:45:11,918 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {297#true} {297#true} #66#return; {297#true} is VALID [2022-04-08 10:45:11,918 INFO L272 TraceCheckUtils]: 4: Hoare triple {297#true} call #t~ret6 := main(); {297#true} is VALID [2022-04-08 10:45:11,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {297#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; {297#true} is VALID [2022-04-08 10:45:11,918 INFO L272 TraceCheckUtils]: 6: Hoare triple {297#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {297#true} is VALID [2022-04-08 10:45:11,919 INFO L290 TraceCheckUtils]: 7: Hoare triple {297#true} ~cond := #in~cond; {297#true} is VALID [2022-04-08 10:45:11,919 INFO L290 TraceCheckUtils]: 8: Hoare triple {297#true} assume !(0 == ~cond); {297#true} is VALID [2022-04-08 10:45:11,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {297#true} assume true; {297#true} is VALID [2022-04-08 10:45:11,919 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {297#true} {297#true} #58#return; {297#true} is VALID [2022-04-08 10:45:11,919 INFO L272 TraceCheckUtils]: 11: Hoare triple {297#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)); {297#true} is VALID [2022-04-08 10:45:11,919 INFO L290 TraceCheckUtils]: 12: Hoare triple {297#true} ~cond := #in~cond; {297#true} is VALID [2022-04-08 10:45:11,920 INFO L290 TraceCheckUtils]: 13: Hoare triple {297#true} assume !(0 == ~cond); {297#true} is VALID [2022-04-08 10:45:11,920 INFO L290 TraceCheckUtils]: 14: Hoare triple {297#true} assume true; {297#true} is VALID [2022-04-08 10:45:11,920 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {297#true} {297#true} #60#return; {297#true} is VALID [2022-04-08 10:45:12,536 INFO L290 TraceCheckUtils]: 16: Hoare triple {297#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {350#(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-08 10:45:12,537 INFO L290 TraceCheckUtils]: 17: Hoare triple {350#(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 !false; {350#(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-08 10:45:14,556 WARN L272 TraceCheckUtils]: 18: Hoare triple {350#(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)); {357#(<= 1 |__VERIFIER_assert_#in~cond|)} is UNKNOWN [2022-04-08 10:45:14,558 INFO L290 TraceCheckUtils]: 19: Hoare triple {357#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {361#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:45:14,558 INFO L290 TraceCheckUtils]: 20: Hoare triple {361#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {298#false} is VALID [2022-04-08 10:45:14,559 INFO L290 TraceCheckUtils]: 21: Hoare triple {298#false} assume !false; {298#false} is VALID [2022-04-08 10:45:14,559 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-08 10:45:14,559 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 10:45:14,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:45:14,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430957205] [2022-04-08 10:45:14,560 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:45:14,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758582110] [2022-04-08 10:45:14,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758582110] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:45:14,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:45:14,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:45:14,561 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:45:14,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2076508033] [2022-04-08 10:45:14,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2076508033] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:45:14,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:45:14,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:45:14,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324616810] [2022-04-08 10:45:14,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:45:14,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 22 [2022-04-08 10:45:14,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:45:14,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-08 10:45:18,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 18 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 10:45:18,315 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 10:45:18,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:45:18,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 10:45:18,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 10:45:18,316 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-08 10:45:19,823 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 10:45:23,369 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 10:45:23,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:45:23,409 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-08 10:45:23,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 10:45:23,410 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 22 [2022-04-08 10:45:23,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:45:23,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-08 10:45:23,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-08 10:45:23,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-08 10:45:23,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-08 10:45:23,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-08 10:45:28,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 38 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 10:45:28,332 INFO L225 Difference]: With dead ends: 35 [2022-04-08 10:45:28,332 INFO L226 Difference]: Without dead ends: 33 [2022-04-08 10:45:28,332 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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-08 10:45:28,333 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 7 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 74 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.9s IncrementalHoareTripleChecker+Time [2022-04-08 10:45:28,333 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 74 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-04-08 10:45:28,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-08 10:45:28,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-04-08 10:45:28,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:45:28,361 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 32 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 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-08 10:45:28,362 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 32 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 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-08 10:45:28,363 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 32 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 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-08 10:45:28,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:45:28,369 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-04-08 10:45:28,369 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-04-08 10:45:28,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:45:28,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:45:28,371 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 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 33 states. [2022-04-08 10:45:28,371 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 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 33 states. [2022-04-08 10:45:28,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:45:28,374 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-04-08 10:45:28,374 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-04-08 10:45:28,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:45:28,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:45:28,374 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:45:28,375 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:45:28,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 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-08 10:45:28,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-04-08 10:45:28,377 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 22 [2022-04-08 10:45:28,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:45:28,377 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-04-08 10:45:28,378 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-08 10:45:28,378 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 37 transitions. [2022-04-08 10:45:32,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 36 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 10:45:32,865 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-08 10:45:32,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 10:45:32,866 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:45:32,866 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] [2022-04-08 10:45:32,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-08 10:45:33,066 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-08 10:45:33,067 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:45:33,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:45:33,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1991967029, now seen corresponding path program 1 times [2022-04-08 10:45:33,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:45:33,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [105065002] [2022-04-08 10:45:33,069 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:45:33,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1991967029, now seen corresponding path program 2 times [2022-04-08 10:45:33,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:45:33,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247026172] [2022-04-08 10:45:33,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:45:33,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:45:33,088 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:45:33,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1087602314] [2022-04-08 10:45:33,089 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:45:33,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:45:33,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:45:33,093 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-08 10:45:33,094 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-08 10:45:33,144 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:45:33,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:45:33,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 10:45:33,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:45:33,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:45:33,361 INFO L272 TraceCheckUtils]: 0: Hoare triple {569#true} call ULTIMATE.init(); {569#true} is VALID [2022-04-08 10:45:33,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {569#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); {569#true} is VALID [2022-04-08 10:45:33,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {569#true} assume true; {569#true} is VALID [2022-04-08 10:45:33,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {569#true} {569#true} #66#return; {569#true} is VALID [2022-04-08 10:45:33,361 INFO L272 TraceCheckUtils]: 4: Hoare triple {569#true} call #t~ret6 := main(); {569#true} is VALID [2022-04-08 10:45:33,364 INFO L290 TraceCheckUtils]: 5: Hoare triple {569#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; {569#true} is VALID [2022-04-08 10:45:33,365 INFO L272 TraceCheckUtils]: 6: Hoare triple {569#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {569#true} is VALID [2022-04-08 10:45:33,365 INFO L290 TraceCheckUtils]: 7: Hoare triple {569#true} ~cond := #in~cond; {569#true} is VALID [2022-04-08 10:45:33,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {569#true} assume !(0 == ~cond); {569#true} is VALID [2022-04-08 10:45:33,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {569#true} assume true; {569#true} is VALID [2022-04-08 10:45:33,365 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {569#true} {569#true} #58#return; {569#true} is VALID [2022-04-08 10:45:33,367 INFO L272 TraceCheckUtils]: 11: Hoare triple {569#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)); {569#true} is VALID [2022-04-08 10:45:33,367 INFO L290 TraceCheckUtils]: 12: Hoare triple {569#true} ~cond := #in~cond; {569#true} is VALID [2022-04-08 10:45:33,367 INFO L290 TraceCheckUtils]: 13: Hoare triple {569#true} assume !(0 == ~cond); {569#true} is VALID [2022-04-08 10:45:33,367 INFO L290 TraceCheckUtils]: 14: Hoare triple {569#true} assume true; {569#true} is VALID [2022-04-08 10:45:33,367 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {569#true} {569#true} #60#return; {569#true} is VALID [2022-04-08 10:45:33,367 INFO L290 TraceCheckUtils]: 16: Hoare triple {569#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {569#true} is VALID [2022-04-08 10:45:33,368 INFO L290 TraceCheckUtils]: 17: Hoare triple {569#true} assume !false; {569#true} is VALID [2022-04-08 10:45:33,368 INFO L272 TraceCheckUtils]: 18: Hoare triple {569#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)); {569#true} is VALID [2022-04-08 10:45:33,368 INFO L290 TraceCheckUtils]: 19: Hoare triple {569#true} ~cond := #in~cond; {631#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:45:33,369 INFO L290 TraceCheckUtils]: 20: Hoare triple {631#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {635#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:45:33,369 INFO L290 TraceCheckUtils]: 21: Hoare triple {635#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {635#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:45:33,370 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {635#(not (= |__VERIFIER_assert_#in~cond| 0))} {569#true} #62#return; {642#(= (+ (* 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-08 10:45:33,370 INFO L290 TraceCheckUtils]: 23: Hoare triple {642#(= (+ (* 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); {646#(= (+ (* 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-08 10:45:33,371 INFO L272 TraceCheckUtils]: 24: Hoare triple {646#(= (+ (* 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)); {650#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:45:33,372 INFO L290 TraceCheckUtils]: 25: Hoare triple {650#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {654#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:45:33,373 INFO L290 TraceCheckUtils]: 26: Hoare triple {654#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {570#false} is VALID [2022-04-08 10:45:33,373 INFO L290 TraceCheckUtils]: 27: Hoare triple {570#false} assume !false; {570#false} is VALID [2022-04-08 10:45:33,373 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-08 10:45:33,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:45:33,804 INFO L290 TraceCheckUtils]: 27: Hoare triple {570#false} assume !false; {570#false} is VALID [2022-04-08 10:45:33,805 INFO L290 TraceCheckUtils]: 26: Hoare triple {654#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {570#false} is VALID [2022-04-08 10:45:33,805 INFO L290 TraceCheckUtils]: 25: Hoare triple {650#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {654#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:45:33,807 INFO L272 TraceCheckUtils]: 24: Hoare triple {646#(= (+ (* 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)); {650#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:45:33,808 INFO L290 TraceCheckUtils]: 23: Hoare triple {673#(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); {646#(= (+ (* 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-08 10:45:33,809 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {635#(not (= |__VERIFIER_assert_#in~cond| 0))} {569#true} #62#return; {673#(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-08 10:45:33,809 INFO L290 TraceCheckUtils]: 21: Hoare triple {635#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {635#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:45:33,810 INFO L290 TraceCheckUtils]: 20: Hoare triple {686#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {635#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:45:33,810 INFO L290 TraceCheckUtils]: 19: Hoare triple {569#true} ~cond := #in~cond; {686#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:45:33,811 INFO L272 TraceCheckUtils]: 18: Hoare triple {569#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)); {569#true} is VALID [2022-04-08 10:45:33,811 INFO L290 TraceCheckUtils]: 17: Hoare triple {569#true} assume !false; {569#true} is VALID [2022-04-08 10:45:33,811 INFO L290 TraceCheckUtils]: 16: Hoare triple {569#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {569#true} is VALID [2022-04-08 10:45:33,811 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {569#true} {569#true} #60#return; {569#true} is VALID [2022-04-08 10:45:33,811 INFO L290 TraceCheckUtils]: 14: Hoare triple {569#true} assume true; {569#true} is VALID [2022-04-08 10:45:33,811 INFO L290 TraceCheckUtils]: 13: Hoare triple {569#true} assume !(0 == ~cond); {569#true} is VALID [2022-04-08 10:45:33,812 INFO L290 TraceCheckUtils]: 12: Hoare triple {569#true} ~cond := #in~cond; {569#true} is VALID [2022-04-08 10:45:33,812 INFO L272 TraceCheckUtils]: 11: Hoare triple {569#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)); {569#true} is VALID [2022-04-08 10:45:33,812 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {569#true} {569#true} #58#return; {569#true} is VALID [2022-04-08 10:45:33,812 INFO L290 TraceCheckUtils]: 9: Hoare triple {569#true} assume true; {569#true} is VALID [2022-04-08 10:45:33,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {569#true} assume !(0 == ~cond); {569#true} is VALID [2022-04-08 10:45:33,812 INFO L290 TraceCheckUtils]: 7: Hoare triple {569#true} ~cond := #in~cond; {569#true} is VALID [2022-04-08 10:45:33,813 INFO L272 TraceCheckUtils]: 6: Hoare triple {569#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {569#true} is VALID [2022-04-08 10:45:33,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {569#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; {569#true} is VALID [2022-04-08 10:45:33,813 INFO L272 TraceCheckUtils]: 4: Hoare triple {569#true} call #t~ret6 := main(); {569#true} is VALID [2022-04-08 10:45:33,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {569#true} {569#true} #66#return; {569#true} is VALID [2022-04-08 10:45:33,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {569#true} assume true; {569#true} is VALID [2022-04-08 10:45:33,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {569#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); {569#true} is VALID [2022-04-08 10:45:33,813 INFO L272 TraceCheckUtils]: 0: Hoare triple {569#true} call ULTIMATE.init(); {569#true} is VALID [2022-04-08 10:45:33,814 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-08 10:45:33,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:45:33,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247026172] [2022-04-08 10:45:33,814 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:45:33,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087602314] [2022-04-08 10:45:33,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087602314] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:45:33,815 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:45:33,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-08 10:45:33,815 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:45:33,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [105065002] [2022-04-08 10:45:33,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [105065002] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:45:33,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:45:33,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 10:45:33,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814945892] [2022-04-08 10:45:33,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:45:33,816 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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 28 [2022-04-08 10:45:33,816 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:45:33,817 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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-08 10:45:33,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:45:33,838 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 10:45:33,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:45:33,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 10:45:33,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-08 10:45:33,839 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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-08 10:45:34,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:45:34,135 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-08 10:45:34,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 10:45:34,135 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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 28 [2022-04-08 10:45:34,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:45:34,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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-08 10:45:34,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-04-08 10:45:34,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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-08 10:45:34,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-04-08 10:45:34,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 27 transitions. [2022-04-08 10:45:34,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:45:34,164 INFO L225 Difference]: With dead ends: 32 [2022-04-08 10:45:34,165 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 10:45:34,165 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-04-08 10:45:34,166 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 10 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:45:34,166 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 101 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:45:34,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 10:45:34,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 10:45:34,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:45:34,167 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 10:45:34,167 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 10:45:34,167 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 10:45:34,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:45:34,167 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 10:45:34,167 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 10:45:34,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:45:34,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:45:34,167 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 10:45:34,167 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 10:45:34,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:45:34,167 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 10:45:34,167 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 10:45:34,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:45:34,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:45:34,168 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:45:34,168 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:45:34,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 10:45:34,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 10:45:34,168 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2022-04-08 10:45:34,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:45:34,168 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 10:45:34,168 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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-08 10:45:34,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 10:45:34,169 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:45:34,169 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 10:45:34,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:45:34,171 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 10:45:34,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-08 10:45:34,371 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-08 10:45:34,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 10:45:34,488 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2022-04-08 10:45:34,488 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2022-04-08 10:45:34,488 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2022-04-08 10:45:34,488 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 8 10) the Hoare annotation is: true [2022-04-08 10:45:34,488 INFO L885 garLoopResultBuilder]: At program point L9(line 9) the Hoare annotation is: true [2022-04-08 10:45:34,489 INFO L885 garLoopResultBuilder]: At program point L9-2(lines 8 10) the Hoare annotation is: true [2022-04-08 10:45:34,489 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 8 10) the Hoare annotation is: true [2022-04-08 10:45:34,489 INFO L878 garLoopResultBuilder]: At program point L33-2(lines 33 44) the Hoare annotation is: (let ((.cse0 (+ (* main_~v~0 2) (* main_~u~0 main_~u~0))) (.cse1 (* main_~v~0 main_~v~0)) (.cse2 (* main_~u~0 2)) (.cse3 (* main_~A~0 4))) (and (= .cse0 (+ .cse1 .cse2 .cse3 (* main_~r~0 4))) (= .cse0 (+ .cse1 .cse2 .cse3)))) [2022-04-08 10:45:34,489 INFO L885 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: true [2022-04-08 10:45:34,489 INFO L885 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: true [2022-04-08 10:45:34,489 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 19 49) the Hoare annotation is: true [2022-04-08 10:45:34,489 INFO L885 garLoopResultBuilder]: At program point L25-1(line 25) the Hoare annotation is: true [2022-04-08 10:45:34,489 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 19 49) the Hoare annotation is: true [2022-04-08 10:45:34,489 INFO L878 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: (= (+ (* 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))) [2022-04-08 10:45:34,489 INFO L878 garLoopResultBuilder]: At program point L34-1(lines 33 44) the Hoare annotation is: (= (+ (* 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))) [2022-04-08 10:45:34,489 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 19 49) the Hoare annotation is: true [2022-04-08 10:45:34,489 INFO L885 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: true [2022-04-08 10:45:34,490 INFO L878 garLoopResultBuilder]: At program point L37(lines 37 43) the Hoare annotation is: (= (+ (* 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))) [2022-04-08 10:45:34,490 INFO L878 garLoopResultBuilder]: At program point L37-2(lines 33 44) the Hoare annotation is: (= (+ (* 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))) [2022-04-08 10:45:34,490 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 10:45:34,490 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2022-04-08 10:45:34,490 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 10:45:34,490 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 10:45:34,490 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 10:45:34,490 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 10:45:34,490 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 10:45:34,490 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-08 10:45:34,490 INFO L878 garLoopResultBuilder]: At program point L13(lines 13 14) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-08 10:45:34,490 INFO L878 garLoopResultBuilder]: At program point L12(lines 12 15) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-08 10:45:34,490 INFO L878 garLoopResultBuilder]: At program point L12-2(lines 11 17) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-08 10:45:34,490 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 11 17) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-08 10:45:34,491 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-08 10:45:34,493 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2] [2022-04-08 10:45:34,494 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 10:45:34,496 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 10:45:34,497 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 10:45:34,510 INFO L163 areAnnotationChecker]: CFG has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 10:45:34,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 10:45:34 BoogieIcfgContainer [2022-04-08 10:45:34,517 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 10:45:34,518 INFO L158 Benchmark]: Toolchain (without parser) took 25355.22ms. Allocated memory was 183.5MB in the beginning and 229.6MB in the end (delta: 46.1MB). Free memory was 134.8MB in the beginning and 94.7MB in the end (delta: 40.1MB). Peak memory consumption was 86.7MB. Max. memory is 8.0GB. [2022-04-08 10:45:34,518 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 183.5MB. Free memory is still 151.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 10:45:34,518 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.28ms. Allocated memory is still 183.5MB. Free memory was 134.6MB in the beginning and 160.4MB in the end (delta: -25.7MB). Peak memory consumption was 12.7MB. Max. memory is 8.0GB. [2022-04-08 10:45:34,519 INFO L158 Benchmark]: Boogie Preprocessor took 36.31ms. Allocated memory is still 183.5MB. Free memory was 160.4MB in the beginning and 158.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 10:45:34,519 INFO L158 Benchmark]: RCFGBuilder took 277.85ms. Allocated memory is still 183.5MB. Free memory was 158.8MB in the beginning and 147.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 10:45:34,519 INFO L158 Benchmark]: TraceAbstraction took 24782.88ms. Allocated memory was 183.5MB in the beginning and 229.6MB in the end (delta: 46.1MB). Free memory was 146.7MB in the beginning and 94.7MB in the end (delta: 52.0MB). Peak memory consumption was 98.1MB. Max. memory is 8.0GB. [2022-04-08 10:45:34,520 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 183.5MB. Free memory is still 151.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 251.28ms. Allocated memory is still 183.5MB. Free memory was 134.6MB in the beginning and 160.4MB in the end (delta: -25.7MB). Peak memory consumption was 12.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.31ms. Allocated memory is still 183.5MB. Free memory was 160.4MB in the beginning and 158.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 277.85ms. Allocated memory is still 183.5MB. Free memory was 158.8MB in the beginning and 147.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 24782.88ms. Allocated memory was 183.5MB in the beginning and 229.6MB in the end (delta: 46.1MB). Free memory was 146.7MB in the beginning and 94.7MB in the end (delta: 52.0MB). Peak memory consumption was 98.1MB. 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 - PositiveResult [Line: 14]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.7s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17 mSDsluCounter, 207 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 136 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 86 IncrementalHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 71 mSDtfsCounter, 86 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=2, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 61 PreInvPairs, 89 NumberOfFragments, 175 HoareAnnotationTreeSize, 61 FomulaSimplifications, 216 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 29 FomulaSimplificationsInter, 60 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: v * 2 + u * u == v * v + u * 2 + A * 4 + r * 4 - ProcedureContractResult [Line: 8]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: 1 - ProcedureContractResult [Line: 19]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 11]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == cond || !(1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2022-04-08 10:45:34,549 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...