/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/fermat1-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 10:46:53,016 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 10:46:53,017 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 10:46:53,053 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 10:46:53,053 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 10:46:53,054 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 10:46:53,058 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 10:46:53,062 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 10:46:53,064 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 10:46:53,067 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 10:46:53,068 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 10:46:53,069 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 10:46:53,069 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 10:46:53,071 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 10:46:53,072 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 10:46:53,073 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 10:46:53,073 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 10:46:53,074 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 10:46:53,077 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 10:46:53,081 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 10:46:53,082 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 10:46:53,083 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 10:46:53,083 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 10:46:53,084 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 10:46:53,085 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 10:46:53,090 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 10:46:53,090 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 10:46:53,091 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 10:46:53,092 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 10:46:53,092 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 10:46:53,093 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 10:46:53,093 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 10:46:53,094 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 10:46:53,094 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 10:46:53,095 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 10:46:53,095 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 10:46:53,095 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 10:46:53,096 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 10:46:53,096 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 10:46:53,096 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 10:46:53,097 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 10:46:53,098 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 10:46:53,099 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 10:46:53,108 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 10:46:53,109 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 10:46:53,110 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 10:46:53,110 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 10:46:53,110 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 10:46:53,110 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 10:46:53,110 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 10:46:53,110 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 10:46:53,110 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 10:46:53,111 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 10:46:53,111 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 10:46:53,111 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 10:46:53,111 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 10:46:53,112 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 10:46:53,112 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 10:46:53,112 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:46:53,112 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 10:46:53,112 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 10:46:53,112 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 10:46:53,112 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 10:46:53,112 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 10:46:53,112 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 10:46:53,113 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 10:46:53,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 10:46:53,330 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 10:46:53,332 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 10:46:53,333 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 10:46:53,333 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 10:46:53,334 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/fermat1-ll.c [2022-04-28 10:46:53,376 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8623c284/a456c4d4ee4d437183350105ea92c093/FLAG73d232d1f [2022-04-28 10:46:53,759 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 10:46:53,759 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/fermat1-ll.c [2022-04-28 10:46:53,765 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8623c284/a456c4d4ee4d437183350105ea92c093/FLAG73d232d1f [2022-04-28 10:46:53,776 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8623c284/a456c4d4ee4d437183350105ea92c093 [2022-04-28 10:46:53,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 10:46:53,780 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 10:46:53,783 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 10:46:53,783 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 10:46:53,786 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 10:46:53,790 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:46:53" (1/1) ... [2022-04-28 10:46:53,791 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72f64f6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:46:53, skipping insertion in model container [2022-04-28 10:46:53,791 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:46:53" (1/1) ... [2022-04-28 10:46:53,796 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 10:46:53,806 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 10:46:53,943 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/fermat1-ll.c[535,548] [2022-04-28 10:46:53,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:46:53,980 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 10:46:53,993 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/fermat1-ll.c[535,548] [2022-04-28 10:46:54,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:46:54,039 INFO L208 MainTranslator]: Completed translation [2022-04-28 10:46:54,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:46:54 WrapperNode [2022-04-28 10:46:54,039 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 10:46:54,040 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 10:46:54,040 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 10:46:54,041 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 10:46:54,062 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:46:54" (1/1) ... [2022-04-28 10:46:54,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:46:54" (1/1) ... [2022-04-28 10:46:54,072 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:46:54" (1/1) ... [2022-04-28 10:46:54,072 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:46:54" (1/1) ... [2022-04-28 10:46:54,086 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:46:54" (1/1) ... [2022-04-28 10:46:54,092 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:46:54" (1/1) ... [2022-04-28 10:46:54,108 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:46:54" (1/1) ... [2022-04-28 10:46:54,110 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 10:46:54,110 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 10:46:54,110 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 10:46:54,110 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 10:46:54,112 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:46:54" (1/1) ... [2022-04-28 10:46:54,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:46:54,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:46:54,152 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 10:46:54,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 10:46:54,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 10:46:54,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 10:46:54,185 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 10:46:54,185 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 10:46:54,185 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 10:46:54,185 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 10:46:54,185 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 10:46:54,185 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 10:46:54,185 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 10:46:54,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 10:46:54,186 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 10:46:54,186 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 10:46:54,186 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 10:46:54,186 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 10:46:54,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 10:46:54,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 10:46:54,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 10:46:54,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 10:46:54,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 10:46:54,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 10:46:54,243 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 10:46:54,245 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 10:46:54,406 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 10:46:54,410 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 10:46:54,410 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-28 10:46:54,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:46:54 BoogieIcfgContainer [2022-04-28 10:46:54,411 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 10:46:54,412 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 10:46:54,413 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 10:46:54,425 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 10:46:54,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 10:46:53" (1/3) ... [2022-04-28 10:46:54,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b1ec01d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:46:54, skipping insertion in model container [2022-04-28 10:46:54,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:46:54" (2/3) ... [2022-04-28 10:46:54,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b1ec01d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:46:54, skipping insertion in model container [2022-04-28 10:46:54,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:46:54" (3/3) ... [2022-04-28 10:46:54,427 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat1-ll.c [2022-04-28 10:46:54,443 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 10:46:54,444 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 10:46:54,493 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 10:46:54,498 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@491542b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@76fd63a3 [2022-04-28 10:46:54,498 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 10:46:54,506 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 10:46:54,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 10:46:54,512 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:46:54,512 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:46:54,513 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:46:54,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:46:54,519 INFO L85 PathProgramCache]: Analyzing trace with hash -150104916, now seen corresponding path program 1 times [2022-04-28 10:46:54,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:46:54,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [493596724] [2022-04-28 10:46:54,535 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:46:54,536 INFO L85 PathProgramCache]: Analyzing trace with hash -150104916, now seen corresponding path program 2 times [2022-04-28 10:46:54,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:46:54,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926950202] [2022-04-28 10:46:54,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:46:54,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:46:54,624 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:46:54,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2142348222] [2022-04-28 10:46:54,625 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:46:54,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:46:54,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:46:54,671 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:46:54,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 10:46:54,739 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 10:46:54,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:46:54,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-28 10:46:54,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:46:54,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:46:54,844 INFO L272 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {37#true} is VALID [2022-04-28 10:46:54,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#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); {37#true} is VALID [2022-04-28 10:46:54,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-28 10:46:54,846 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #99#return; {37#true} is VALID [2022-04-28 10:46:54,846 INFO L272 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret6 := main(); {37#true} is VALID [2022-04-28 10:46:54,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#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; {37#true} is VALID [2022-04-28 10:46:54,846 INFO L272 TraceCheckUtils]: 6: Hoare triple {37#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {37#true} is VALID [2022-04-28 10:46:54,847 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-28 10:46:54,847 INFO L290 TraceCheckUtils]: 8: Hoare triple {37#true} assume 0 == ~cond;assume false; {37#true} is VALID [2022-04-28 10:46:54,847 INFO L290 TraceCheckUtils]: 9: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-28 10:46:54,847 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37#true} {37#true} #87#return; {37#true} is VALID [2022-04-28 10:46:54,848 INFO L272 TraceCheckUtils]: 11: Hoare triple {37#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)); {37#true} is VALID [2022-04-28 10:46:54,848 INFO L290 TraceCheckUtils]: 12: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-28 10:46:54,848 INFO L290 TraceCheckUtils]: 13: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-28 10:46:54,849 INFO L290 TraceCheckUtils]: 14: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-28 10:46:54,849 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {38#false} {37#true} #89#return; {38#false} is VALID [2022-04-28 10:46:54,849 INFO L290 TraceCheckUtils]: 16: Hoare triple {38#false} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {38#false} is VALID [2022-04-28 10:46:54,849 INFO L290 TraceCheckUtils]: 17: Hoare triple {38#false} assume !true; {38#false} is VALID [2022-04-28 10:46:54,850 INFO L272 TraceCheckUtils]: 18: Hoare triple {38#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)); {38#false} is VALID [2022-04-28 10:46:54,851 INFO L290 TraceCheckUtils]: 19: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2022-04-28 10:46:54,851 INFO L290 TraceCheckUtils]: 20: Hoare triple {38#false} assume 0 == ~cond; {38#false} is VALID [2022-04-28 10:46:54,851 INFO L290 TraceCheckUtils]: 21: Hoare triple {38#false} assume !false; {38#false} is VALID [2022-04-28 10:46:54,852 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:46:54,852 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 10:46:54,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:46:54,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926950202] [2022-04-28 10:46:54,853 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:46:54,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142348222] [2022-04-28 10:46:54,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142348222] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:46:54,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:46:54,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-28 10:46:54,856 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:46:54,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [493596724] [2022-04-28 10:46:54,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [493596724] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:46:54,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:46:54,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-28 10:46:54,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078810098] [2022-04-28 10:46:54,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:46:54,862 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-28 10:46:54,863 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:46:54,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 10:46:54,891 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:46:54,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-28 10:46:54,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:46:54,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-28 10:46:54,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-28 10:46:54,912 INFO L87 Difference]: Start difference. First operand has 34 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 10:46:54,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:46:54,978 INFO L93 Difference]: Finished difference Result 61 states and 94 transitions. [2022-04-28 10:46:54,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-28 10:46:54,979 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-28 10:46:54,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:46:54,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 10:46:54,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 94 transitions. [2022-04-28 10:46:54,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 10:46:55,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 94 transitions. [2022-04-28 10:46:55,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 94 transitions. [2022-04-28 10:46:55,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:46:55,109 INFO L225 Difference]: With dead ends: 61 [2022-04-28 10:46:55,110 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 10:46:55,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-28 10:46:55,116 INFO L413 NwaCegarLoop]: 40 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, 40 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:46:55,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:46:55,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 10:46:55,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-28 10:46:55,143 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:46:55,143 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 10:46:55,144 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 10:46:55,145 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 10:46:55,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:46:55,150 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-28 10:46:55,150 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-28 10:46:55,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:46:55,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:46:55,154 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states. [2022-04-28 10:46:55,159 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states. [2022-04-28 10:46:55,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:46:55,162 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-28 10:46:55,162 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-28 10:46:55,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:46:55,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:46:55,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:46:55,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:46:55,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 10:46:55,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-04-28 10:46:55,169 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 22 [2022-04-28 10:46:55,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:46:55,169 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-04-28 10:46:55,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 10:46:55,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 35 transitions. [2022-04-28 10:46:55,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:46:55,200 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-28 10:46:55,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 10:46:55,201 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:46:55,202 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:46:55,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 10:46:55,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-28 10:46:55,419 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:46:55,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:46:55,424 INFO L85 PathProgramCache]: Analyzing trace with hash -521053945, now seen corresponding path program 1 times [2022-04-28 10:46:55,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:46:55,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [955734144] [2022-04-28 10:46:55,429 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:46:55,431 INFO L85 PathProgramCache]: Analyzing trace with hash -521053945, now seen corresponding path program 2 times [2022-04-28 10:46:55,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:46:55,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539598063] [2022-04-28 10:46:55,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:46:55,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:46:55,442 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:46:55,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1457546912] [2022-04-28 10:46:55,443 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:46:55,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:46:55,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:46:55,444 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:46:55,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 10:46:55,479 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 10:46:55,479 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:46:55,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 10:46:55,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:46:55,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:46:58,919 INFO L272 TraceCheckUtils]: 0: Hoare triple {342#true} call ULTIMATE.init(); {342#true} is VALID [2022-04-28 10:46:58,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {342#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); {342#true} is VALID [2022-04-28 10:46:58,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {342#true} assume true; {342#true} is VALID [2022-04-28 10:46:58,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {342#true} {342#true} #99#return; {342#true} is VALID [2022-04-28 10:46:58,920 INFO L272 TraceCheckUtils]: 4: Hoare triple {342#true} call #t~ret6 := main(); {342#true} is VALID [2022-04-28 10:46:58,920 INFO L290 TraceCheckUtils]: 5: Hoare triple {342#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; {342#true} is VALID [2022-04-28 10:46:58,921 INFO L272 TraceCheckUtils]: 6: Hoare triple {342#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {342#true} is VALID [2022-04-28 10:46:58,921 INFO L290 TraceCheckUtils]: 7: Hoare triple {342#true} ~cond := #in~cond; {342#true} is VALID [2022-04-28 10:46:58,921 INFO L290 TraceCheckUtils]: 8: Hoare triple {342#true} assume !(0 == ~cond); {342#true} is VALID [2022-04-28 10:46:58,921 INFO L290 TraceCheckUtils]: 9: Hoare triple {342#true} assume true; {342#true} is VALID [2022-04-28 10:46:58,921 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {342#true} {342#true} #87#return; {342#true} is VALID [2022-04-28 10:46:58,921 INFO L272 TraceCheckUtils]: 11: Hoare triple {342#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)); {342#true} is VALID [2022-04-28 10:46:58,921 INFO L290 TraceCheckUtils]: 12: Hoare triple {342#true} ~cond := #in~cond; {342#true} is VALID [2022-04-28 10:46:58,921 INFO L290 TraceCheckUtils]: 13: Hoare triple {342#true} assume !(0 == ~cond); {342#true} is VALID [2022-04-28 10:46:58,922 INFO L290 TraceCheckUtils]: 14: Hoare triple {342#true} assume true; {342#true} is VALID [2022-04-28 10:46:58,922 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {342#true} {342#true} #89#return; {342#true} is VALID [2022-04-28 10:47:00,923 WARN L290 TraceCheckUtils]: 16: Hoare triple {342#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {395#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is UNKNOWN [2022-04-28 10:47:00,924 INFO L290 TraceCheckUtils]: 17: Hoare triple {395#(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; {395#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-28 10:47:01,018 INFO L272 TraceCheckUtils]: 18: Hoare triple {395#(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)); {402#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:47:01,019 INFO L290 TraceCheckUtils]: 19: Hoare triple {402#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {406#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:47:01,019 INFO L290 TraceCheckUtils]: 20: Hoare triple {406#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {343#false} is VALID [2022-04-28 10:47:01,019 INFO L290 TraceCheckUtils]: 21: Hoare triple {343#false} assume !false; {343#false} is VALID [2022-04-28 10:47:01,020 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 10:47:01,020 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 10:47:01,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:47:01,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539598063] [2022-04-28 10:47:01,020 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:47:01,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457546912] [2022-04-28 10:47:01,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457546912] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:47:01,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:47:01,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:47:01,021 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:47:01,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [955734144] [2022-04-28 10:47:01,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [955734144] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:47:01,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:47:01,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:47:01,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615338963] [2022-04-28 10:47:01,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:47:01,022 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-28 10:47:01,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:47:01,022 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-28 10:47:03,544 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-28 10:47:03,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:47:03,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:47:03,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:47:03,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 10:47:03,545 INFO L87 Difference]: Start difference. First operand 29 states and 35 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-28 10:47:05,845 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 10:47:08,083 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 10:47:09,978 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 10:47:14,324 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 10:47:16,419 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 10:47:18,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:47:18,502 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-28 10:47:18,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:47:18,502 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-28 10:47:18,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:47:18,503 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-28 10:47:18,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-04-28 10:47:18,504 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-28 10:47:18,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-04-28 10:47:18,505 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 56 transitions. [2022-04-28 10:47:24,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 54 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 10:47:24,182 INFO L225 Difference]: With dead ends: 45 [2022-04-28 10:47:24,182 INFO L226 Difference]: Without dead ends: 43 [2022-04-28 10:47:24,182 INFO L412 NwaCegarLoop]: 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-28 10:47:24,183 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:47:24,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 92 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 9.3s Time] [2022-04-28 10:47:24,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-28 10:47:24,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2022-04-28 10:47:24,193 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:47:24,194 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 42 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 10:47:24,195 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 42 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 10:47:24,195 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 42 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 10:47:24,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:47:24,197 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-28 10:47:24,197 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-28 10:47:24,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:47:24,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:47:24,198 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 43 states. [2022-04-28 10:47:24,199 INFO L87 Difference]: Start difference. First operand has 42 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 43 states. [2022-04-28 10:47:24,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:47:24,201 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-28 10:47:24,201 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-28 10:47:24,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:47:24,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:47:24,201 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:47:24,201 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:47:24,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 10:47:24,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2022-04-28 10:47:24,203 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 22 [2022-04-28 10:47:24,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:47:24,204 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2022-04-28 10:47:24,204 INFO L496 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-28 10:47:24,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 53 transitions. [2022-04-28 10:47:31,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 50 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 10:47:31,689 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2022-04-28 10:47:31,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 10:47:31,689 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:47:31,690 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:47:31,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 10:47:31,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-28 10:47:31,890 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:47:31,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:47:31,891 INFO L85 PathProgramCache]: Analyzing trace with hash -773887245, now seen corresponding path program 1 times [2022-04-28 10:47:31,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:47:31,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [790274705] [2022-04-28 10:47:31,891 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:47:31,892 INFO L85 PathProgramCache]: Analyzing trace with hash -773887245, now seen corresponding path program 2 times [2022-04-28 10:47:31,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:47:31,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046445251] [2022-04-28 10:47:31,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:47:31,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:47:31,903 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:47:31,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1459068039] [2022-04-28 10:47:31,904 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:47:31,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:47:31,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:47:31,906 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:47:31,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 10:47:31,942 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:47:31,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:47:31,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 10:47:31,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:47:31,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:47:32,080 INFO L272 TraceCheckUtils]: 0: Hoare triple {674#true} call ULTIMATE.init(); {674#true} is VALID [2022-04-28 10:47:32,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {674#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); {674#true} is VALID [2022-04-28 10:47:32,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {674#true} assume true; {674#true} is VALID [2022-04-28 10:47:32,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {674#true} {674#true} #99#return; {674#true} is VALID [2022-04-28 10:47:32,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {674#true} call #t~ret6 := main(); {674#true} is VALID [2022-04-28 10:47:32,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {674#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; {674#true} is VALID [2022-04-28 10:47:32,081 INFO L272 TraceCheckUtils]: 6: Hoare triple {674#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {674#true} is VALID [2022-04-28 10:47:32,081 INFO L290 TraceCheckUtils]: 7: Hoare triple {674#true} ~cond := #in~cond; {674#true} is VALID [2022-04-28 10:47:32,082 INFO L290 TraceCheckUtils]: 8: Hoare triple {674#true} assume !(0 == ~cond); {674#true} is VALID [2022-04-28 10:47:32,082 INFO L290 TraceCheckUtils]: 9: Hoare triple {674#true} assume true; {674#true} is VALID [2022-04-28 10:47:32,082 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {674#true} {674#true} #87#return; {674#true} is VALID [2022-04-28 10:47:32,082 INFO L272 TraceCheckUtils]: 11: Hoare triple {674#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)); {674#true} is VALID [2022-04-28 10:47:32,082 INFO L290 TraceCheckUtils]: 12: Hoare triple {674#true} ~cond := #in~cond; {674#true} is VALID [2022-04-28 10:47:32,082 INFO L290 TraceCheckUtils]: 13: Hoare triple {674#true} assume !(0 == ~cond); {674#true} is VALID [2022-04-28 10:47:32,082 INFO L290 TraceCheckUtils]: 14: Hoare triple {674#true} assume true; {674#true} is VALID [2022-04-28 10:47:32,082 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {674#true} {674#true} #89#return; {674#true} is VALID [2022-04-28 10:47:32,083 INFO L290 TraceCheckUtils]: 16: Hoare triple {674#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {674#true} is VALID [2022-04-28 10:47:32,083 INFO L290 TraceCheckUtils]: 17: Hoare triple {674#true} assume !false; {674#true} is VALID [2022-04-28 10:47:32,083 INFO L272 TraceCheckUtils]: 18: Hoare triple {674#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)); {674#true} is VALID [2022-04-28 10:47:32,083 INFO L290 TraceCheckUtils]: 19: Hoare triple {674#true} ~cond := #in~cond; {736#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:47:32,084 INFO L290 TraceCheckUtils]: 20: Hoare triple {736#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {740#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:47:32,084 INFO L290 TraceCheckUtils]: 21: Hoare triple {740#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {740#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:47:32,085 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {740#(not (= |__VERIFIER_assert_#in~cond| 0))} {674#true} #91#return; {747#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4)))} is VALID [2022-04-28 10:47:32,085 INFO L290 TraceCheckUtils]: 23: Hoare triple {747#(= (+ (* 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); {751#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} is VALID [2022-04-28 10:47:32,086 INFO L272 TraceCheckUtils]: 24: Hoare triple {751#(= (+ (* 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)); {755#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:47:32,087 INFO L290 TraceCheckUtils]: 25: Hoare triple {755#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {759#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:47:32,087 INFO L290 TraceCheckUtils]: 26: Hoare triple {759#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {675#false} is VALID [2022-04-28 10:47:32,087 INFO L290 TraceCheckUtils]: 27: Hoare triple {675#false} assume !false; {675#false} is VALID [2022-04-28 10:47:32,088 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 10:47:32,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:47:32,531 INFO L290 TraceCheckUtils]: 27: Hoare triple {675#false} assume !false; {675#false} is VALID [2022-04-28 10:47:32,532 INFO L290 TraceCheckUtils]: 26: Hoare triple {759#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {675#false} is VALID [2022-04-28 10:47:32,532 INFO L290 TraceCheckUtils]: 25: Hoare triple {755#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {759#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:47:32,533 INFO L272 TraceCheckUtils]: 24: Hoare triple {751#(= (+ (* 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)); {755#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:47:32,533 INFO L290 TraceCheckUtils]: 23: Hoare triple {778#(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); {751#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} is VALID [2022-04-28 10:47:32,534 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {740#(not (= |__VERIFIER_assert_#in~cond| 0))} {674#true} #91#return; {778#(or (not (= main_~r~0 0)) (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4))))} is VALID [2022-04-28 10:47:32,535 INFO L290 TraceCheckUtils]: 21: Hoare triple {740#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {740#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:47:32,535 INFO L290 TraceCheckUtils]: 20: Hoare triple {791#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {740#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:47:32,536 INFO L290 TraceCheckUtils]: 19: Hoare triple {674#true} ~cond := #in~cond; {791#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:47:32,536 INFO L272 TraceCheckUtils]: 18: Hoare triple {674#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)); {674#true} is VALID [2022-04-28 10:47:32,536 INFO L290 TraceCheckUtils]: 17: Hoare triple {674#true} assume !false; {674#true} is VALID [2022-04-28 10:47:32,536 INFO L290 TraceCheckUtils]: 16: Hoare triple {674#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {674#true} is VALID [2022-04-28 10:47:32,536 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {674#true} {674#true} #89#return; {674#true} is VALID [2022-04-28 10:47:32,536 INFO L290 TraceCheckUtils]: 14: Hoare triple {674#true} assume true; {674#true} is VALID [2022-04-28 10:47:32,536 INFO L290 TraceCheckUtils]: 13: Hoare triple {674#true} assume !(0 == ~cond); {674#true} is VALID [2022-04-28 10:47:32,536 INFO L290 TraceCheckUtils]: 12: Hoare triple {674#true} ~cond := #in~cond; {674#true} is VALID [2022-04-28 10:47:32,537 INFO L272 TraceCheckUtils]: 11: Hoare triple {674#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)); {674#true} is VALID [2022-04-28 10:47:32,537 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {674#true} {674#true} #87#return; {674#true} is VALID [2022-04-28 10:47:32,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {674#true} assume true; {674#true} is VALID [2022-04-28 10:47:32,537 INFO L290 TraceCheckUtils]: 8: Hoare triple {674#true} assume !(0 == ~cond); {674#true} is VALID [2022-04-28 10:47:32,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {674#true} ~cond := #in~cond; {674#true} is VALID [2022-04-28 10:47:32,537 INFO L272 TraceCheckUtils]: 6: Hoare triple {674#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {674#true} is VALID [2022-04-28 10:47:32,537 INFO L290 TraceCheckUtils]: 5: Hoare triple {674#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; {674#true} is VALID [2022-04-28 10:47:32,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {674#true} call #t~ret6 := main(); {674#true} is VALID [2022-04-28 10:47:32,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {674#true} {674#true} #99#return; {674#true} is VALID [2022-04-28 10:47:32,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {674#true} assume true; {674#true} is VALID [2022-04-28 10:47:32,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {674#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); {674#true} is VALID [2022-04-28 10:47:32,538 INFO L272 TraceCheckUtils]: 0: Hoare triple {674#true} call ULTIMATE.init(); {674#true} is VALID [2022-04-28 10:47:32,538 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 10:47:32,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:47:32,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046445251] [2022-04-28 10:47:32,538 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:47:32,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459068039] [2022-04-28 10:47:32,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459068039] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:47:32,539 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:47:32,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-28 10:47:32,539 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:47:32,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [790274705] [2022-04-28 10:47:32,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [790274705] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:47:32,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:47:32,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:47:32,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227340217] [2022-04-28 10:47:32,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:47:32,540 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-28 10:47:32,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:47:32,540 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-28 10:47:32,557 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-28 10:47:32,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:47:32,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:47:32,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:47:32,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:47:32,558 INFO L87 Difference]: Start difference. First operand 42 states and 53 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-28 10:47:32,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:47:32,884 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2022-04-28 10:47:32,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:47:32,885 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-28 10:47:32,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:47:32,885 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-28 10:47:32,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-04-28 10:47:32,886 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-28 10:47:32,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-04-28 10:47:32,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 35 transitions. [2022-04-28 10:47:32,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:47:32,919 INFO L225 Difference]: With dead ends: 42 [2022-04-28 10:47:32,919 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 10:47:32,919 INFO L412 NwaCegarLoop]: 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-28 10:47:32,920 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 15 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:47:32,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 98 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:47:32,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 10:47:32,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 10:47:32,921 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:47:32,921 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-28 10:47:32,921 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-28 10:47:32,921 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-28 10:47:32,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:47:32,921 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 10:47:32,921 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:47:32,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:47:32,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:47:32,921 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-28 10:47:32,921 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-28 10:47:32,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:47:32,922 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 10:47:32,922 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:47:32,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:47:32,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:47:32,922 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:47:32,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:47:32,922 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-28 10:47:32,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 10:47:32,922 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2022-04-28 10:47:32,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:47:32,922 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 10:47:32,922 INFO L496 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-28 10:47:32,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 10:47:32,923 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-28 10:47:32,923 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:47:32,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:47:32,925 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 10:47:32,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 10:47:33,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:47:33,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 10:47:33,236 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2022-04-28 10:47:33,236 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2022-04-28 10:47:33,237 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2022-04-28 10:47:33,237 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 8 10) the Hoare annotation is: true [2022-04-28 10:47:33,237 INFO L902 garLoopResultBuilder]: At program point L9(line 9) the Hoare annotation is: true [2022-04-28 10:47:33,237 INFO L902 garLoopResultBuilder]: At program point L9-2(lines 8 10) the Hoare annotation is: true [2022-04-28 10:47:33,237 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 8 10) the Hoare annotation is: true [2022-04-28 10:47:33,237 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 19 57) the Hoare annotation is: true [2022-04-28 10:47:33,237 INFO L902 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: true [2022-04-28 10:47:33,237 INFO L902 garLoopResultBuilder]: At program point L24-1(line 24) the Hoare annotation is: true [2022-04-28 10:47:33,237 INFO L895 garLoopResultBuilder]: At program point L33-2(lines 33 53) 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-28 10:47:33,237 INFO L895 garLoopResultBuilder]: At program point L46-1(lines 33 53) 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-28 10:47:33,237 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 19 57) the Hoare annotation is: true [2022-04-28 10:47:33,238 INFO L895 garLoopResultBuilder]: At program point L46-2(lines 33 53) 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-28 10:47:33,238 INFO L895 garLoopResultBuilder]: At program point L38-2(lines 38 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-28 10:47:33,238 INFO L895 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-28 10:47:33,238 INFO L895 garLoopResultBuilder]: At program point L34-1(lines 33 53) 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-28 10:47:33,238 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 19 57) the Hoare annotation is: true [2022-04-28 10:47:33,238 INFO L902 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: true [2022-04-28 10:47:33,238 INFO L902 garLoopResultBuilder]: At program point L55(line 55) the Hoare annotation is: true [2022-04-28 10:47:33,238 INFO L895 garLoopResultBuilder]: At program point L47(line 47) 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-28 10:47:33,238 INFO L895 garLoopResultBuilder]: At program point L47-1(lines 46 52) 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-28 10:47:33,238 INFO L895 garLoopResultBuilder]: At program point L39(line 39) 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-28 10:47:33,238 INFO L895 garLoopResultBuilder]: At program point L39-1(lines 38 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-28 10:47:33,238 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 10:47:33,238 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2022-04-28 10:47:33,238 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 10:47:33,239 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 10:47:33,239 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 10:47:33,239 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 10:47:33,239 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 10:47:33,239 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-28 10:47:33,239 INFO L895 garLoopResultBuilder]: At program point L13(lines 13 14) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 10:47:33,239 INFO L895 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-28 10:47:33,239 INFO L895 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-28 10:47:33,239 INFO L895 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-28 10:47:33,239 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 10:47:33,241 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2] [2022-04-28 10:47:33,243 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 10:47:33,245 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 10:47:33,246 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 10:47:33,263 INFO L163 areAnnotationChecker]: CFG has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 10:47:33,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 10:47:33 BoogieIcfgContainer [2022-04-28 10:47:33,270 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 10:47:33,271 INFO L158 Benchmark]: Toolchain (without parser) took 39490.50ms. Allocated memory was 182.5MB in the beginning and 219.2MB in the end (delta: 36.7MB). Free memory was 136.4MB in the beginning and 112.7MB in the end (delta: 23.7MB). Peak memory consumption was 61.8MB. Max. memory is 8.0GB. [2022-04-28 10:47:33,271 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 182.5MB. Free memory was 152.5MB in the beginning and 152.5MB in the end (delta: 83.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 10:47:33,272 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.03ms. Allocated memory is still 182.5MB. Free memory was 136.2MB in the beginning and 160.3MB in the end (delta: -24.1MB). Peak memory consumption was 11.8MB. Max. memory is 8.0GB. [2022-04-28 10:47:33,272 INFO L158 Benchmark]: Boogie Preprocessor took 69.60ms. Allocated memory is still 182.5MB. Free memory was 160.3MB in the beginning and 158.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 10:47:33,272 INFO L158 Benchmark]: RCFGBuilder took 301.22ms. Allocated memory is still 182.5MB. Free memory was 158.8MB in the beginning and 147.0MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 10:47:33,272 INFO L158 Benchmark]: TraceAbstraction took 38857.72ms. Allocated memory was 182.5MB in the beginning and 219.2MB in the end (delta: 36.7MB). Free memory was 146.5MB in the beginning and 113.2MB in the end (delta: 33.2MB). Peak memory consumption was 71.0MB. Max. memory is 8.0GB. [2022-04-28 10:47:33,274 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 182.5MB. Free memory was 152.5MB in the beginning and 152.5MB in the end (delta: 83.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 257.03ms. Allocated memory is still 182.5MB. Free memory was 136.2MB in the beginning and 160.3MB in the end (delta: -24.1MB). Peak memory consumption was 11.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 69.60ms. Allocated memory is still 182.5MB. Free memory was 160.3MB in the beginning and 158.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 301.22ms. Allocated memory is still 182.5MB. Free memory was 158.8MB in the beginning and 147.0MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 38857.72ms. Allocated memory was 182.5MB in the beginning and 219.2MB in the end (delta: 36.7MB). Free memory was 146.5MB in the beginning and 113.2MB in the end (delta: 33.2MB). Peak memory consumption was 71.0MB. 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, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 38.8s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 21.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 9.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 26 mSDsluCounter, 230 SdHoareTripleChecker+Invalid, 9.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 141 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 129 IncrementalHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 89 mSDtfsCounter, 129 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=42occurred 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, 34 LocationsWithAnnotation, 102 PreInvPairs, 148 NumberOfFragments, 280 HoareAnnotationTreeSize, 102 FomulaSimplifications, 486 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 34 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 - InvariantResult [Line: 38]: 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-28 10:47:33,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...