/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench/fermat1-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 11:51:25,158 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 11:51:25,160 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 11:51:25,192 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 11:51:25,192 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 11:51:25,193 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 11:51:25,194 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 11:51:25,195 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 11:51:25,196 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 11:51:25,198 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 11:51:25,199 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 11:51:25,199 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 11:51:25,200 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 11:51:25,201 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 11:51:25,202 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 11:51:25,202 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 11:51:25,203 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 11:51:25,204 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 11:51:25,205 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 11:51:25,207 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 11:51:25,208 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 11:51:25,214 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 11:51:25,215 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 11:51:25,216 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 11:51:25,219 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 11:51:25,221 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 11:51:25,221 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 11:51:25,221 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 11:51:25,222 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 11:51:25,223 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 11:51:25,223 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 11:51:25,223 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 11:51:25,224 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 11:51:25,224 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 11:51:25,225 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 11:51:25,225 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 11:51:25,226 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 11:51:25,226 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 11:51:25,226 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 11:51:25,226 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 11:51:25,227 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 11:51:25,227 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 11:51:25,228 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 11:51:25,255 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 11:51:25,255 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 11:51:25,255 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 11:51:25,255 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 11:51:25,256 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 11:51:25,256 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 11:51:25,256 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 11:51:25,256 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 11:51:25,256 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 11:51:25,257 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 11:51:25,257 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 11:51:25,257 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 11:51:25,257 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 11:51:25,257 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 11:51:25,257 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 11:51:25,257 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 11:51:25,257 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 11:51:25,258 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 11:51:25,258 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 11:51:25,258 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 11:51:25,258 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 11:51:25,258 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 11:51:25,258 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 11:51:25,258 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 11:51:25,258 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:51:25,259 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 11:51:25,259 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 11:51:25,259 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 11:51:25,261 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 11:51:25,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 11:51:25,261 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 11:51:25,261 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 11:51:25,262 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 11:51:25,262 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-27 11:51:25,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 11:51:25,498 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 11:51:25,501 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 11:51:25,502 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 11:51:25,503 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 11:51:25,504 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-27 11:51:25,565 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53b912582/0bf2108608e64d78bf2558bd3633a3ef/FLAG1cef07cc6 [2022-04-27 11:51:25,889 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 11:51:25,889 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/fermat1-ll.c [2022-04-27 11:51:25,899 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53b912582/0bf2108608e64d78bf2558bd3633a3ef/FLAG1cef07cc6 [2022-04-27 11:51:26,325 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53b912582/0bf2108608e64d78bf2558bd3633a3ef [2022-04-27 11:51:26,327 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 11:51:26,328 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 11:51:26,331 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 11:51:26,331 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 11:51:26,335 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 11:51:26,336 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:51:26" (1/1) ... [2022-04-27 11:51:26,337 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d7881d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:51:26, skipping insertion in model container [2022-04-27 11:51:26,337 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:51:26" (1/1) ... [2022-04-27 11:51:26,357 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 11:51:26,369 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 11:51:26,482 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-27 11:51:26,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:51:26,528 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 11:51:26,538 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-27 11:51:26,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:51:26,559 INFO L208 MainTranslator]: Completed translation [2022-04-27 11:51:26,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:51:26 WrapperNode [2022-04-27 11:51:26,559 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 11:51:26,560 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 11:51:26,560 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 11:51:26,560 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 11:51:26,574 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:51:26" (1/1) ... [2022-04-27 11:51:26,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:51:26" (1/1) ... [2022-04-27 11:51:26,583 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:51:26" (1/1) ... [2022-04-27 11:51:26,584 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:51:26" (1/1) ... [2022-04-27 11:51:26,589 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:51:26" (1/1) ... [2022-04-27 11:51:26,597 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:51:26" (1/1) ... [2022-04-27 11:51:26,598 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:51:26" (1/1) ... [2022-04-27 11:51:26,599 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 11:51:26,600 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 11:51:26,600 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 11:51:26,600 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 11:51:26,601 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:51:26" (1/1) ... [2022-04-27 11:51:26,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:51:26,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:51:26,645 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-27 11:51:26,663 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-27 11:51:26,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 11:51:26,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 11:51:26,682 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 11:51:26,682 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 11:51:26,683 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 11:51:26,683 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 11:51:26,683 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 11:51:26,683 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 11:51:26,684 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 11:51:26,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 11:51:26,684 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 11:51:26,684 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 11:51:26,684 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 11:51:26,685 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 11:51:26,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 11:51:26,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 11:51:26,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 11:51:26,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 11:51:26,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 11:51:26,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 11:51:26,743 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 11:51:26,744 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 11:51:26,885 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 11:51:26,891 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 11:51:26,891 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-27 11:51:26,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:51:26 BoogieIcfgContainer [2022-04-27 11:51:26,893 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 11:51:26,894 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 11:51:26,894 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 11:51:26,897 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 11:51:26,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:51:26" (1/3) ... [2022-04-27 11:51:26,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ba9910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:51:26, skipping insertion in model container [2022-04-27 11:51:26,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:51:26" (2/3) ... [2022-04-27 11:51:26,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ba9910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:51:26, skipping insertion in model container [2022-04-27 11:51:26,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:51:26" (3/3) ... [2022-04-27 11:51:26,899 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat1-ll.c [2022-04-27 11:51:26,911 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 11:51:26,912 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 11:51:26,954 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 11:51:26,960 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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@9c4296d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@23a2e960 [2022-04-27 11:51:26,960 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 11:51:26,970 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-27 11:51:27,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 11:51:27,012 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:51:27,012 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-27 11:51:27,013 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:51:27,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:51:27,018 INFO L85 PathProgramCache]: Analyzing trace with hash -150104916, now seen corresponding path program 1 times [2022-04-27 11:51:27,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:51:27,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500261901] [2022-04-27 11:51:27,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:51:27,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:51:27,156 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:51:27,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [61316243] [2022-04-27 11:51:27,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:51:27,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:51:27,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:51:27,175 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-27 11:51:27,221 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-27 11:51:27,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:51:27,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-27 11:51:27,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:51:27,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:51:27,415 INFO L272 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {37#true} is VALID [2022-04-27 11:51:27,415 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-27 11:51:27,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-27 11:51:27,416 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #99#return; {37#true} is VALID [2022-04-27 11:51:27,416 INFO L272 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret6 := main(); {37#true} is VALID [2022-04-27 11:51:27,417 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-27 11:51:27,417 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-27 11:51:27,417 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-27 11:51:27,418 INFO L290 TraceCheckUtils]: 8: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-27 11:51:27,418 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-27 11:51:27,418 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {38#false} {37#true} #87#return; {38#false} is VALID [2022-04-27 11:51:27,418 INFO L272 TraceCheckUtils]: 11: Hoare triple {38#false} 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)); {38#false} is VALID [2022-04-27 11:51:27,419 INFO L290 TraceCheckUtils]: 12: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2022-04-27 11:51:27,419 INFO L290 TraceCheckUtils]: 13: Hoare triple {38#false} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-27 11:51:27,419 INFO L290 TraceCheckUtils]: 14: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-27 11:51:27,419 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {38#false} {38#false} #89#return; {38#false} is VALID [2022-04-27 11:51:27,419 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-27 11:51:27,420 INFO L290 TraceCheckUtils]: 17: Hoare triple {38#false} assume !true; {38#false} is VALID [2022-04-27 11:51:27,420 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-27 11:51:27,420 INFO L290 TraceCheckUtils]: 19: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2022-04-27 11:51:27,420 INFO L290 TraceCheckUtils]: 20: Hoare triple {38#false} assume 0 == ~cond; {38#false} is VALID [2022-04-27 11:51:27,420 INFO L290 TraceCheckUtils]: 21: Hoare triple {38#false} assume !false; {38#false} is VALID [2022-04-27 11:51:27,421 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-27 11:51:27,422 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 11:51:27,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:51:27,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500261901] [2022-04-27 11:51:27,423 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:51:27,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61316243] [2022-04-27 11:51:27,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61316243] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:51:27,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:51:27,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-27 11:51:27,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321177550] [2022-04-27 11:51:27,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:51:27,433 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), 2 states have call successors, (3) Word has length 22 [2022-04-27 11:51:27,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:51:27,438 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), 2 states have call successors, (3) [2022-04-27 11:51:27,471 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-27 11:51:27,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-27 11:51:27,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:51:27,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-27 11:51:27,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-27 11:51:27,509 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), 2 states have call successors, (3) [2022-04-27 11:51:27,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:51:27,592 INFO L93 Difference]: Finished difference Result 61 states and 94 transitions. [2022-04-27 11:51:27,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-27 11:51:27,592 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), 2 states have call successors, (3) Word has length 22 [2022-04-27 11:51:27,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:51:27,594 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), 2 states have call successors, (3) [2022-04-27 11:51:27,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 94 transitions. [2022-04-27 11:51:27,607 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), 2 states have call successors, (3) [2022-04-27 11:51:27,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 94 transitions. [2022-04-27 11:51:27,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 94 transitions. [2022-04-27 11:51:27,729 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-27 11:51:27,741 INFO L225 Difference]: With dead ends: 61 [2022-04-27 11:51:27,741 INFO L226 Difference]: Without dead ends: 29 [2022-04-27 11:51:27,745 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-27 11:51:27,750 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-27 11:51:27,752 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-27 11:51:27,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-27 11:51:27,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-27 11:51:27,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:51:27,794 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-27 11:51:27,794 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-27 11:51:27,795 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-27 11:51:27,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:51:27,799 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-27 11:51:27,799 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-27 11:51:27,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:51:27,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:51:27,801 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-27 11:51:27,801 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-27 11:51:27,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:51:27,811 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-27 11:51:27,811 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-27 11:51:27,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:51:27,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:51:27,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:51:27,813 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:51:27,813 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-27 11:51:27,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-04-27 11:51:27,822 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 22 [2022-04-27 11:51:27,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:51:27,823 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-04-27 11:51:27,823 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), 2 states have call successors, (3) [2022-04-27 11:51:27,823 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-27 11:51:27,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 11:51:27,834 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:51:27,834 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-27 11:51:27,855 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-27 11:51:28,035 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-27 11:51:28,035 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:51:28,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:51:28,036 INFO L85 PathProgramCache]: Analyzing trace with hash -521053945, now seen corresponding path program 1 times [2022-04-27 11:51:28,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:51:28,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281436251] [2022-04-27 11:51:28,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:51:28,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:51:28,065 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:51:28,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [562463390] [2022-04-27 11:51:28,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:51:28,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:51:28,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:51:28,067 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-27 11:51:28,083 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-27 11:51:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:51:28,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 11:51:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:51:28,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:51:30,630 INFO L272 TraceCheckUtils]: 0: Hoare triple {289#true} call ULTIMATE.init(); {289#true} is VALID [2022-04-27 11:51:30,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {289#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); {289#true} is VALID [2022-04-27 11:51:30,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {289#true} assume true; {289#true} is VALID [2022-04-27 11:51:30,631 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {289#true} {289#true} #99#return; {289#true} is VALID [2022-04-27 11:51:30,631 INFO L272 TraceCheckUtils]: 4: Hoare triple {289#true} call #t~ret6 := main(); {289#true} is VALID [2022-04-27 11:51:30,631 INFO L290 TraceCheckUtils]: 5: Hoare triple {289#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; {289#true} is VALID [2022-04-27 11:51:30,631 INFO L272 TraceCheckUtils]: 6: Hoare triple {289#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {289#true} is VALID [2022-04-27 11:51:30,632 INFO L290 TraceCheckUtils]: 7: Hoare triple {289#true} ~cond := #in~cond; {289#true} is VALID [2022-04-27 11:51:30,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {289#true} assume !(0 == ~cond); {289#true} is VALID [2022-04-27 11:51:30,632 INFO L290 TraceCheckUtils]: 9: Hoare triple {289#true} assume true; {289#true} is VALID [2022-04-27 11:51:30,632 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {289#true} {289#true} #87#return; {289#true} is VALID [2022-04-27 11:51:30,632 INFO L272 TraceCheckUtils]: 11: Hoare triple {289#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)); {289#true} is VALID [2022-04-27 11:51:30,633 INFO L290 TraceCheckUtils]: 12: Hoare triple {289#true} ~cond := #in~cond; {289#true} is VALID [2022-04-27 11:51:30,633 INFO L290 TraceCheckUtils]: 13: Hoare triple {289#true} assume !(0 == ~cond); {289#true} is VALID [2022-04-27 11:51:30,633 INFO L290 TraceCheckUtils]: 14: Hoare triple {289#true} assume true; {289#true} is VALID [2022-04-27 11:51:30,633 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {289#true} {289#true} #89#return; {289#true} is VALID [2022-04-27 11:51:31,496 INFO L290 TraceCheckUtils]: 16: Hoare triple {289#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {342#(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-27 11:51:31,498 INFO L290 TraceCheckUtils]: 17: Hoare triple {342#(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; {342#(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-27 11:51:33,092 INFO L272 TraceCheckUtils]: 18: Hoare triple {342#(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)); {349#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:51:33,092 INFO L290 TraceCheckUtils]: 19: Hoare triple {349#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {353#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:51:33,093 INFO L290 TraceCheckUtils]: 20: Hoare triple {353#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {290#false} is VALID [2022-04-27 11:51:33,093 INFO L290 TraceCheckUtils]: 21: Hoare triple {290#false} assume !false; {290#false} is VALID [2022-04-27 11:51:33,093 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-27 11:51:33,093 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 11:51:33,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:51:33,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281436251] [2022-04-27 11:51:33,094 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:51:33,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562463390] [2022-04-27 11:51:33,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562463390] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:51:33,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:51:33,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 11:51:33,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308870056] [2022-04-27 11:51:33,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:51:33,096 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-27 11:51:33,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:51:33,096 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-27 11:51:36,243 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-27 11:51:36,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 11:51:36,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:51:36,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 11:51:36,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:51:36,245 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-27 11:51:38,332 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 11:51:39,504 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 11:51:42,332 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 11:51:44,334 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 11:51:45,414 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 11:51:53,190 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 11:51:56,006 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 11:51:58,892 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 11:51:58,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:51:58,962 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-27 11:51:58,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 11:51:58,962 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-27 11:51:58,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:51:58,963 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-27 11:51:58,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-04-27 11:51:58,966 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-27 11:51:58,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-04-27 11:51:58,972 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 56 transitions. [2022-04-27 11:52:02,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:52:02,877 INFO L225 Difference]: With dead ends: 45 [2022-04-27 11:52:02,878 INFO L226 Difference]: Without dead ends: 43 [2022-04-27 11:52:02,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 11:52:02,879 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 11 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.7s IncrementalHoareTripleChecker+Time [2022-04-27 11:52:02,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 95 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 3 Unknown, 0 Unchecked, 13.7s Time] [2022-04-27 11:52:02,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-27 11:52:02,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2022-04-27 11:52:02,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:52:02,887 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-27 11:52:02,888 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-27 11:52:02,888 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-27 11:52:02,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:52:02,892 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-27 11:52:02,892 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-27 11:52:02,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:52:02,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:52:02,894 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-27 11:52:02,894 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-27 11:52:02,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:52:02,897 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-27 11:52:02,897 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-27 11:52:02,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:52:02,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:52:02,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:52:02,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:52:02,899 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-27 11:52:02,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2022-04-27 11:52:02,902 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 22 [2022-04-27 11:52:02,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:52:02,902 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2022-04-27 11:52:02,903 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-27 11:52:02,903 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2022-04-27 11:52:02,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 11:52:02,904 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:52:02,904 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-27 11:52:02,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 11:52:03,104 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-27 11:52:03,105 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:52:03,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:52:03,105 INFO L85 PathProgramCache]: Analyzing trace with hash -773887245, now seen corresponding path program 1 times [2022-04-27 11:52:03,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:52:03,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680960853] [2022-04-27 11:52:03,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:52:03,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:52:03,124 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:52:03,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [572531905] [2022-04-27 11:52:03,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:52:03,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:52:03,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:52:03,127 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-27 11:52:03,129 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-27 11:52:03,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:52:03,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 11:52:03,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:52:03,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:52:03,401 INFO L272 TraceCheckUtils]: 0: Hoare triple {575#true} call ULTIMATE.init(); {575#true} is VALID [2022-04-27 11:52:03,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {575#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); {575#true} is VALID [2022-04-27 11:52:03,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {575#true} assume true; {575#true} is VALID [2022-04-27 11:52:03,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {575#true} {575#true} #99#return; {575#true} is VALID [2022-04-27 11:52:03,406 INFO L272 TraceCheckUtils]: 4: Hoare triple {575#true} call #t~ret6 := main(); {575#true} is VALID [2022-04-27 11:52:03,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {575#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; {575#true} is VALID [2022-04-27 11:52:03,407 INFO L272 TraceCheckUtils]: 6: Hoare triple {575#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {575#true} is VALID [2022-04-27 11:52:03,407 INFO L290 TraceCheckUtils]: 7: Hoare triple {575#true} ~cond := #in~cond; {575#true} is VALID [2022-04-27 11:52:03,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {575#true} assume !(0 == ~cond); {575#true} is VALID [2022-04-27 11:52:03,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {575#true} assume true; {575#true} is VALID [2022-04-27 11:52:03,410 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {575#true} {575#true} #87#return; {575#true} is VALID [2022-04-27 11:52:03,411 INFO L272 TraceCheckUtils]: 11: Hoare triple {575#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)); {575#true} is VALID [2022-04-27 11:52:03,411 INFO L290 TraceCheckUtils]: 12: Hoare triple {575#true} ~cond := #in~cond; {575#true} is VALID [2022-04-27 11:52:03,411 INFO L290 TraceCheckUtils]: 13: Hoare triple {575#true} assume !(0 == ~cond); {575#true} is VALID [2022-04-27 11:52:03,411 INFO L290 TraceCheckUtils]: 14: Hoare triple {575#true} assume true; {575#true} is VALID [2022-04-27 11:52:03,412 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {575#true} {575#true} #89#return; {575#true} is VALID [2022-04-27 11:52:03,412 INFO L290 TraceCheckUtils]: 16: Hoare triple {575#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {575#true} is VALID [2022-04-27 11:52:03,412 INFO L290 TraceCheckUtils]: 17: Hoare triple {575#true} assume !false; {575#true} is VALID [2022-04-27 11:52:03,412 INFO L272 TraceCheckUtils]: 18: Hoare triple {575#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)); {575#true} is VALID [2022-04-27 11:52:03,413 INFO L290 TraceCheckUtils]: 19: Hoare triple {575#true} ~cond := #in~cond; {637#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:52:03,413 INFO L290 TraceCheckUtils]: 20: Hoare triple {637#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {641#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:52:03,414 INFO L290 TraceCheckUtils]: 21: Hoare triple {641#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {641#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:52:03,415 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {641#(not (= |__VERIFIER_assert_#in~cond| 0))} {575#true} #91#return; {648#(= (+ (* 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-27 11:52:03,416 INFO L290 TraceCheckUtils]: 23: Hoare triple {648#(= (+ (* 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); {652#(= (+ (* 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-27 11:52:03,417 INFO L272 TraceCheckUtils]: 24: Hoare triple {652#(= (+ (* 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)); {656#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:52:03,417 INFO L290 TraceCheckUtils]: 25: Hoare triple {656#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {660#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:52:03,418 INFO L290 TraceCheckUtils]: 26: Hoare triple {660#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {576#false} is VALID [2022-04-27 11:52:03,418 INFO L290 TraceCheckUtils]: 27: Hoare triple {576#false} assume !false; {576#false} is VALID [2022-04-27 11:52:03,418 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-27 11:52:03,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:52:03,927 INFO L290 TraceCheckUtils]: 27: Hoare triple {576#false} assume !false; {576#false} is VALID [2022-04-27 11:52:03,928 INFO L290 TraceCheckUtils]: 26: Hoare triple {660#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {576#false} is VALID [2022-04-27 11:52:03,928 INFO L290 TraceCheckUtils]: 25: Hoare triple {656#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {660#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:52:03,929 INFO L272 TraceCheckUtils]: 24: Hoare triple {652#(= (+ (* 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)); {656#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:52:03,930 INFO L290 TraceCheckUtils]: 23: Hoare triple {679#(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); {652#(= (+ (* 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-27 11:52:03,931 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {641#(not (= |__VERIFIER_assert_#in~cond| 0))} {575#true} #91#return; {679#(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-27 11:52:03,931 INFO L290 TraceCheckUtils]: 21: Hoare triple {641#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {641#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:52:03,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {692#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {641#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:52:03,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {575#true} ~cond := #in~cond; {692#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:52:03,933 INFO L272 TraceCheckUtils]: 18: Hoare triple {575#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)); {575#true} is VALID [2022-04-27 11:52:03,933 INFO L290 TraceCheckUtils]: 17: Hoare triple {575#true} assume !false; {575#true} is VALID [2022-04-27 11:52:03,933 INFO L290 TraceCheckUtils]: 16: Hoare triple {575#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {575#true} is VALID [2022-04-27 11:52:03,933 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {575#true} {575#true} #89#return; {575#true} is VALID [2022-04-27 11:52:03,933 INFO L290 TraceCheckUtils]: 14: Hoare triple {575#true} assume true; {575#true} is VALID [2022-04-27 11:52:03,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {575#true} assume !(0 == ~cond); {575#true} is VALID [2022-04-27 11:52:03,934 INFO L290 TraceCheckUtils]: 12: Hoare triple {575#true} ~cond := #in~cond; {575#true} is VALID [2022-04-27 11:52:03,934 INFO L272 TraceCheckUtils]: 11: Hoare triple {575#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)); {575#true} is VALID [2022-04-27 11:52:03,934 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {575#true} {575#true} #87#return; {575#true} is VALID [2022-04-27 11:52:03,934 INFO L290 TraceCheckUtils]: 9: Hoare triple {575#true} assume true; {575#true} is VALID [2022-04-27 11:52:03,934 INFO L290 TraceCheckUtils]: 8: Hoare triple {575#true} assume !(0 == ~cond); {575#true} is VALID [2022-04-27 11:52:03,935 INFO L290 TraceCheckUtils]: 7: Hoare triple {575#true} ~cond := #in~cond; {575#true} is VALID [2022-04-27 11:52:03,935 INFO L272 TraceCheckUtils]: 6: Hoare triple {575#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {575#true} is VALID [2022-04-27 11:52:03,935 INFO L290 TraceCheckUtils]: 5: Hoare triple {575#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; {575#true} is VALID [2022-04-27 11:52:03,935 INFO L272 TraceCheckUtils]: 4: Hoare triple {575#true} call #t~ret6 := main(); {575#true} is VALID [2022-04-27 11:52:03,935 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {575#true} {575#true} #99#return; {575#true} is VALID [2022-04-27 11:52:03,935 INFO L290 TraceCheckUtils]: 2: Hoare triple {575#true} assume true; {575#true} is VALID [2022-04-27 11:52:03,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {575#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); {575#true} is VALID [2022-04-27 11:52:03,936 INFO L272 TraceCheckUtils]: 0: Hoare triple {575#true} call ULTIMATE.init(); {575#true} is VALID [2022-04-27 11:52:03,936 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-27 11:52:03,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:52:03,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680960853] [2022-04-27 11:52:03,936 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:52:03,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572531905] [2022-04-27 11:52:03,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572531905] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:52:03,937 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 11:52:03,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-27 11:52:03,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656424886] [2022-04-27 11:52:03,937 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 11:52:03,938 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 28 [2022-04-27 11:52:03,938 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:52:03,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 11:52:03,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:52:03,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 11:52:03,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:52:03,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 11:52:03,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-27 11:52:03,962 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 11:52:04,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:52:04,284 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2022-04-27 11:52:04,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 11:52:04,285 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 28 [2022-04-27 11:52:04,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:52:04,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 11:52:04,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-04-27 11:52:04,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 11:52:04,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-04-27 11:52:04,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 35 transitions. [2022-04-27 11:52:04,336 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-27 11:52:04,336 INFO L225 Difference]: With dead ends: 42 [2022-04-27 11:52:04,336 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 11:52:04,337 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-27 11:52:04,338 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 21 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:52:04,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 87 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:52:04,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 11:52:04,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 11:52:04,339 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:52:04,339 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-27 11:52:04,339 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-27 11:52:04,339 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-27 11:52:04,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:52:04,340 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 11:52:04,340 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:52:04,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:52:04,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:52:04,340 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-27 11:52:04,341 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-27 11:52:04,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:52:04,341 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 11:52:04,341 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:52:04,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:52:04,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:52:04,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:52:04,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:52:04,341 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-27 11:52:04,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 11:52:04,342 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2022-04-27 11:52:04,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:52:04,342 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 11:52:04,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 11:52:04,343 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:52:04,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:52:04,345 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 11:52:04,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-27 11:52:04,546 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-27 11:52:04,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 11:52:04,598 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2022-04-27 11:52:04,599 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2022-04-27 11:52:04,599 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2022-04-27 11:52:04,599 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 8 10) the Hoare annotation is: true [2022-04-27 11:52:04,599 INFO L899 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2022-04-27 11:52:04,599 INFO L899 garLoopResultBuilder]: For program point L9-2(lines 8 10) no Hoare annotation was computed. [2022-04-27 11:52:04,600 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 8 10) no Hoare annotation was computed. [2022-04-27 11:52:04,600 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 19 57) no Hoare annotation was computed. [2022-04-27 11:52:04,600 INFO L902 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: true [2022-04-27 11:52:04,600 INFO L902 garLoopResultBuilder]: At program point L24-1(line 24) the Hoare annotation is: true [2022-04-27 11:52:04,600 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-27 11:52:04,600 INFO L899 garLoopResultBuilder]: For program point L46-1(lines 33 53) no Hoare annotation was computed. [2022-04-27 11:52:04,600 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 19 57) no Hoare annotation was computed. [2022-04-27 11:52:04,600 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-27 11:52:04,601 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-27 11:52:04,601 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-27 11:52:04,601 INFO L899 garLoopResultBuilder]: For program point L34-1(lines 33 53) no Hoare annotation was computed. [2022-04-27 11:52:04,601 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 19 57) the Hoare annotation is: true [2022-04-27 11:52:04,601 INFO L899 garLoopResultBuilder]: For program point L26(line 26) no Hoare annotation was computed. [2022-04-27 11:52:04,601 INFO L899 garLoopResultBuilder]: For program point L55(line 55) no Hoare annotation was computed. [2022-04-27 11:52:04,601 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-27 11:52:04,601 INFO L899 garLoopResultBuilder]: For program point L47-1(lines 46 52) no Hoare annotation was computed. [2022-04-27 11:52:04,601 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-27 11:52:04,602 INFO L899 garLoopResultBuilder]: For program point L39-1(lines 38 44) no Hoare annotation was computed. [2022-04-27 11:52:04,602 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 11:52:04,602 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2022-04-27 11:52:04,602 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 11:52:04,602 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 11:52:04,602 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 11:52:04,602 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 11:52:04,602 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 11:52:04,603 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-27 11:52:04,603 INFO L899 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2022-04-27 11:52:04,603 INFO L899 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2022-04-27 11:52:04,603 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2022-04-27 11:52:04,603 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2022-04-27 11:52:04,604 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-04-27 11:52:04,606 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-27 11:52:04,608 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 11:52:04,611 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 11:52:04,611 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 11:52:04,612 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 11:52:04,612 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 11:52:04,612 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 11:52:04,612 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 11:52:04,612 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 11:52:04,612 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 11:52:04,612 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 11:52:04,612 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 11:52:04,612 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 11:52:04,612 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 11:52:04,612 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 11:52:04,612 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-27 11:52:04,613 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-27 11:52:04,613 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 11:52:04,613 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 11:52:04,613 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-27 11:52:04,613 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 11:52:04,613 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 11:52:04,613 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-27 11:52:04,613 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 11:52:04,613 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 11:52:04,613 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 11:52:04,613 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 11:52:04,615 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 11:52:04,615 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 11:52:04,615 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-04-27 11:52:04,615 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-04-27 11:52:04,615 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2022-04-27 11:52:04,615 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2022-04-27 11:52:04,615 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-04-27 11:52:04,615 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-04-27 11:52:04,615 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 11:52:04,615 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-04-27 11:52:04,615 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-04-27 11:52:04,616 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-04-27 11:52:04,616 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-04-27 11:52:04,616 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-04-27 11:52:04,616 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 11:52:04,616 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-04-27 11:52:04,616 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2022-04-27 11:52:04,616 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 11:52:04,617 INFO L163 areAnnotationChecker]: CFG has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 11:52:04,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 11:52:04 BoogieIcfgContainer [2022-04-27 11:52:04,627 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 11:52:04,629 INFO L158 Benchmark]: Toolchain (without parser) took 38300.70ms. Allocated memory was 182.5MB in the beginning and 219.2MB in the end (delta: 36.7MB). Free memory was 128.1MB in the beginning and 139.3MB in the end (delta: -11.2MB). Peak memory consumption was 25.8MB. Max. memory is 8.0GB. [2022-04-27 11:52:04,629 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 182.5MB. Free memory is still 144.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 11:52:04,631 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.30ms. Allocated memory is still 182.5MB. Free memory was 127.8MB in the beginning and 156.6MB in the end (delta: -28.8MB). Peak memory consumption was 8.9MB. Max. memory is 8.0GB. [2022-04-27 11:52:04,631 INFO L158 Benchmark]: Boogie Preprocessor took 39.38ms. Allocated memory is still 182.5MB. Free memory was 156.6MB in the beginning and 154.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 11:52:04,633 INFO L158 Benchmark]: RCFGBuilder took 292.54ms. Allocated memory is still 182.5MB. Free memory was 154.9MB in the beginning and 143.1MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 11:52:04,633 INFO L158 Benchmark]: TraceAbstraction took 37733.49ms. Allocated memory was 182.5MB in the beginning and 219.2MB in the end (delta: 36.7MB). Free memory was 142.6MB in the beginning and 139.3MB in the end (delta: 3.4MB). Peak memory consumption was 41.1MB. Max. memory is 8.0GB. [2022-04-27 11:52:04,635 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.11ms. Allocated memory is still 182.5MB. Free memory is still 144.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 228.30ms. Allocated memory is still 182.5MB. Free memory was 127.8MB in the beginning and 156.6MB in the end (delta: -28.8MB). Peak memory consumption was 8.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.38ms. Allocated memory is still 182.5MB. Free memory was 156.6MB in the beginning and 154.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 292.54ms. Allocated memory is still 182.5MB. Free memory was 154.9MB in the beginning and 143.1MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 37733.49ms. Allocated memory was 182.5MB in the beginning and 219.2MB in the end (delta: 36.7MB). Free memory was 142.6MB in the beginning and 139.3MB in the end (delta: 3.4MB). Peak memory consumption was 41.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 37.7s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 27.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 37 SdHoareTripleChecker+Valid, 13.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32 mSDsluCounter, 222 SdHoareTripleChecker+Invalid, 13.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 132 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 114 IncrementalHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 90 mSDtfsCounter, 114 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 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, 14 LocationsWithAnnotation, 26 PreInvPairs, 38 NumberOfFragments, 153 HoareAnnotationTreeSize, 26 FomulaSimplifications, 270 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 14 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 72 NumberOfCodeBlocks, 72 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 267 SizeOfPredicates, 9 NumberOfNonLiveVariables, 254 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 18/20 InterpolantCoveringCapability, 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 RESULT: Ultimate proved your program to be correct! [2022-04-27 11:52:04,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...