/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-scaling/fermat2-ll_valuebound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 13:18:17,220 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 13:18:17,242 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 13:18:17,270 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 13:18:17,270 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 13:18:17,271 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 13:18:17,275 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 13:18:17,278 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 13:18:17,279 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 13:18:17,283 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 13:18:17,283 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 13:18:17,284 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 13:18:17,284 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 13:18:17,285 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 13:18:17,286 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 13:18:17,287 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 13:18:17,287 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 13:18:17,288 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 13:18:17,291 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 13:18:17,295 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 13:18:17,296 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 13:18:17,297 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 13:18:17,298 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 13:18:17,298 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 13:18:17,299 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 13:18:17,303 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 13:18:17,303 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 13:18:17,303 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 13:18:17,304 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 13:18:17,304 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 13:18:17,304 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 13:18:17,305 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 13:18:17,305 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 13:18:17,305 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 13:18:17,306 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 13:18:17,306 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 13:18:17,306 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 13:18:17,307 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 13:18:17,307 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 13:18:17,307 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 13:18:17,307 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 13:18:17,311 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 13:18:17,312 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 13:18:17,333 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 13:18:17,333 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 13:18:17,333 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 13:18:17,333 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 13:18:17,334 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 13:18:17,334 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 13:18:17,334 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 13:18:17,334 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 13:18:17,334 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 13:18:17,335 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 13:18:17,335 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 13:18:17,335 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 13:18:17,335 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 13:18:17,336 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 13:18:17,336 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 13:18:17,336 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 13:18:17,336 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 13:18:17,337 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 13:18:17,337 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 13:18:17,337 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 13:18:17,337 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 13:18:17,337 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 13:18:17,338 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 13:18:17,338 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 13:18:17,338 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:18:17,338 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 13:18:17,338 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 13:18:17,338 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 13:18:17,338 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 13:18:17,338 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 13:18:17,338 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 13:18:17,339 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 13:18:17,339 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 13:18:17,339 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 13:18:17,516 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 13:18:17,528 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 13:18:17,530 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 13:18:17,530 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 13:18:17,534 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 13:18:17,535 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_valuebound1.c [2022-04-27 13:18:17,573 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6596f198d/3d2d80d56f71442e83931198833e9281/FLAGaa3355bb6 [2022-04-27 13:18:17,944 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 13:18:17,945 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_valuebound1.c [2022-04-27 13:18:17,949 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6596f198d/3d2d80d56f71442e83931198833e9281/FLAGaa3355bb6 [2022-04-27 13:18:18,375 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6596f198d/3d2d80d56f71442e83931198833e9281 [2022-04-27 13:18:18,377 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 13:18:18,378 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 13:18:18,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 13:18:18,388 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 13:18:18,390 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 13:18:18,391 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:18:18" (1/1) ... [2022-04-27 13:18:18,392 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64898783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:18:18, skipping insertion in model container [2022-04-27 13:18:18,392 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:18:18" (1/1) ... [2022-04-27 13:18:18,396 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 13:18:18,414 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 13:18:18,553 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_valuebound1.c[524,537] [2022-04-27 13:18:18,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:18:18,589 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 13:18:18,599 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_valuebound1.c[524,537] [2022-04-27 13:18:18,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:18:18,629 INFO L208 MainTranslator]: Completed translation [2022-04-27 13:18:18,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:18:18 WrapperNode [2022-04-27 13:18:18,629 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 13:18:18,630 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 13:18:18,630 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 13:18:18,630 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 13:18:18,637 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:18:18" (1/1) ... [2022-04-27 13:18:18,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:18:18" (1/1) ... [2022-04-27 13:18:18,641 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:18:18" (1/1) ... [2022-04-27 13:18:18,642 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:18:18" (1/1) ... [2022-04-27 13:18:18,651 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:18:18" (1/1) ... [2022-04-27 13:18:18,655 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:18:18" (1/1) ... [2022-04-27 13:18:18,658 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:18:18" (1/1) ... [2022-04-27 13:18:18,660 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 13:18:18,660 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 13:18:18,660 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 13:18:18,660 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 13:18:18,661 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:18:18" (1/1) ... [2022-04-27 13:18:18,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:18:18,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:18:18,684 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 13:18:18,690 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 13:18:18,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 13:18:18,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 13:18:18,715 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 13:18:18,715 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 13:18:18,716 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 13:18:18,716 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 13:18:18,716 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 13:18:18,716 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 13:18:18,716 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 13:18:18,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 13:18:18,716 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 13:18:18,716 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 13:18:18,716 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 13:18:18,716 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 13:18:18,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 13:18:18,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 13:18:18,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 13:18:18,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 13:18:18,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 13:18:18,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 13:18:18,764 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 13:18:18,765 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 13:18:18,876 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 13:18:18,880 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 13:18:18,880 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 13:18:18,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:18:18 BoogieIcfgContainer [2022-04-27 13:18:18,881 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 13:18:18,882 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 13:18:18,882 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 13:18:18,884 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 13:18:18,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 01:18:18" (1/3) ... [2022-04-27 13:18:18,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2415cab1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:18:18, skipping insertion in model container [2022-04-27 13:18:18,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:18:18" (2/3) ... [2022-04-27 13:18:18,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2415cab1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:18:18, skipping insertion in model container [2022-04-27 13:18:18,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:18:18" (3/3) ... [2022-04-27 13:18:18,886 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat2-ll_valuebound1.c [2022-04-27 13:18:18,894 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 13:18:18,894 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 13:18:18,942 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 13:18:18,946 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@6b795807, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7210b75c [2022-04-27 13:18:18,946 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 13:18:18,951 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 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 13:18:18,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 13:18:18,956 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:18:18,956 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:18:18,957 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:18:18,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:18:18,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1790211013, now seen corresponding path program 1 times [2022-04-27 13:18:18,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:18:18,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487413421] [2022-04-27 13:18:18,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:18:18,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:18:19,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:19,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:18:19,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:19,105 INFO L290 TraceCheckUtils]: 0: Hoare triple {56#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {35#true} is VALID [2022-04-27 13:18:19,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-27 13:18:19,106 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #73#return; {35#true} is VALID [2022-04-27 13:18:19,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:18:19,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:19,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 13:18:19,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 13:18:19,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 13:18:19,134 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-27 13:18:19,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 13:18:19,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:19,144 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 13:18:19,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 13:18:19,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 13:18:19,147 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-27 13:18:19,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 13:18:19,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:19,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 13:18:19,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 13:18:19,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 13:18:19,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #65#return; {36#false} is VALID [2022-04-27 13:18:19,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-27 13:18:19,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:19,161 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 13:18:19,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 13:18:19,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 13:18:19,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #67#return; {36#false} is VALID [2022-04-27 13:18:19,163 INFO L272 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {56#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:18:19,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {56#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {35#true} is VALID [2022-04-27 13:18:19,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-27 13:18:19,163 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #73#return; {35#true} is VALID [2022-04-27 13:18:19,163 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret6 := main(); {35#true} is VALID [2022-04-27 13:18:19,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#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; {35#true} is VALID [2022-04-27 13:18:19,164 INFO L272 TraceCheckUtils]: 6: Hoare triple {35#true} call assume_abort_if_not((if ~A~0 >= 0 && ~A~0 <= 1 then 1 else 0)); {35#true} is VALID [2022-04-27 13:18:19,164 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 13:18:19,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 13:18:19,165 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 13:18:19,165 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-27 13:18:19,165 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {36#false} is VALID [2022-04-27 13:18:19,165 INFO L272 TraceCheckUtils]: 12: Hoare triple {36#false} call assume_abort_if_not((if ~R~0 >= 0 && ~R~0 <= 1 then 1 else 0)); {35#true} is VALID [2022-04-27 13:18:19,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 13:18:19,169 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 13:18:19,169 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 13:18:19,169 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-27 13:18:19,170 INFO L272 TraceCheckUtils]: 17: Hoare triple {36#false} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {35#true} is VALID [2022-04-27 13:18:19,170 INFO L290 TraceCheckUtils]: 18: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 13:18:19,170 INFO L290 TraceCheckUtils]: 19: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 13:18:19,170 INFO L290 TraceCheckUtils]: 20: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 13:18:19,170 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {36#false} {36#false} #65#return; {36#false} is VALID [2022-04-27 13:18:19,170 INFO L272 TraceCheckUtils]: 22: Hoare triple {36#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)); {35#true} is VALID [2022-04-27 13:18:19,171 INFO L290 TraceCheckUtils]: 23: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 13:18:19,171 INFO L290 TraceCheckUtils]: 24: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 13:18:19,171 INFO L290 TraceCheckUtils]: 25: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 13:18:19,171 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {36#false} {36#false} #67#return; {36#false} is VALID [2022-04-27 13:18:19,171 INFO L290 TraceCheckUtils]: 27: Hoare triple {36#false} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {36#false} is VALID [2022-04-27 13:18:19,172 INFO L290 TraceCheckUtils]: 28: Hoare triple {36#false} assume !true; {36#false} is VALID [2022-04-27 13:18:19,172 INFO L272 TraceCheckUtils]: 29: Hoare triple {36#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)); {36#false} is VALID [2022-04-27 13:18:19,172 INFO L290 TraceCheckUtils]: 30: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-04-27 13:18:19,172 INFO L290 TraceCheckUtils]: 31: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2022-04-27 13:18:19,172 INFO L290 TraceCheckUtils]: 32: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-27 13:18:19,172 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 13:18:19,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:18:19,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487413421] [2022-04-27 13:18:19,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487413421] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:18:19,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:18:19,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 13:18:19,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805929430] [2022-04-27 13:18:19,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:18:19,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-27 13:18:19,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:18:19,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:18:19,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:18:19,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 13:18:19,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:18:19,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 13:18:19,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:18:19,243 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 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 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:18:19,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:19,363 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2022-04-27 13:18:19,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 13:18:19,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-27 13:18:19,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:18:19,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:18:19,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2022-04-27 13:18:19,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:18:19,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2022-04-27 13:18:19,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 80 transitions. [2022-04-27 13:18:19,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:18:19,498 INFO L225 Difference]: With dead ends: 57 [2022-04-27 13:18:19,498 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 13:18:19,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:18:19,505 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:18:19,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 34 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:18:19,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 13:18:19,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-27 13:18:19,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:18:19,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 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 13:18:19,545 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 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 13:18:19,546 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 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 13:18:19,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:19,552 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-04-27 13:18:19,552 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-04-27 13:18:19,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:18:19,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:18:19,554 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 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 27 states. [2022-04-27 13:18:19,554 INFO L87 Difference]: Start difference. First operand has 27 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 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 27 states. [2022-04-27 13:18:19,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:19,559 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-04-27 13:18:19,559 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-04-27 13:18:19,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:18:19,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:18:19,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:18:19,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:18:19,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 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 13:18:19,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2022-04-27 13:18:19,568 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 33 [2022-04-27 13:18:19,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:18:19,568 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2022-04-27 13:18:19,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:18:19,569 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-04-27 13:18:19,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 13:18:19,571 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:18:19,571 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:18:19,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 13:18:19,572 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:18:19,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:18:19,574 INFO L85 PathProgramCache]: Analyzing trace with hash -102231875, now seen corresponding path program 1 times [2022-04-27 13:18:19,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:18:19,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673253193] [2022-04-27 13:18:19,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:18:19,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:18:19,597 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:18:19,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1248927908] [2022-04-27 13:18:19,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:18:19,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:18:19,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:18:19,611 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 13:18:19,612 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 13:18:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:19,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-27 13:18:19,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:19,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:18:25,787 INFO L272 TraceCheckUtils]: 0: Hoare triple {231#true} call ULTIMATE.init(); {231#true} is VALID [2022-04-27 13:18:25,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {231#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); {231#true} is VALID [2022-04-27 13:18:25,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {231#true} assume true; {231#true} is VALID [2022-04-27 13:18:25,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {231#true} {231#true} #73#return; {231#true} is VALID [2022-04-27 13:18:25,790 INFO L272 TraceCheckUtils]: 4: Hoare triple {231#true} call #t~ret6 := main(); {231#true} is VALID [2022-04-27 13:18:25,790 INFO L290 TraceCheckUtils]: 5: Hoare triple {231#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; {231#true} is VALID [2022-04-27 13:18:25,790 INFO L272 TraceCheckUtils]: 6: Hoare triple {231#true} call assume_abort_if_not((if ~A~0 >= 0 && ~A~0 <= 1 then 1 else 0)); {231#true} is VALID [2022-04-27 13:18:25,790 INFO L290 TraceCheckUtils]: 7: Hoare triple {231#true} ~cond := #in~cond; {257#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:18:25,791 INFO L290 TraceCheckUtils]: 8: Hoare triple {257#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {261#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:18:25,791 INFO L290 TraceCheckUtils]: 9: Hoare triple {261#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {261#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:18:25,792 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {261#(not (= |assume_abort_if_not_#in~cond| 0))} {231#true} #61#return; {268#(and (<= 0 main_~A~0) (<= main_~A~0 1))} is VALID [2022-04-27 13:18:25,792 INFO L290 TraceCheckUtils]: 11: Hoare triple {268#(and (<= 0 main_~A~0) (<= main_~A~0 1))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {268#(and (<= 0 main_~A~0) (<= main_~A~0 1))} is VALID [2022-04-27 13:18:25,792 INFO L272 TraceCheckUtils]: 12: Hoare triple {268#(and (<= 0 main_~A~0) (<= main_~A~0 1))} call assume_abort_if_not((if ~R~0 >= 0 && ~R~0 <= 1 then 1 else 0)); {231#true} is VALID [2022-04-27 13:18:25,793 INFO L290 TraceCheckUtils]: 13: Hoare triple {231#true} ~cond := #in~cond; {257#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:18:25,793 INFO L290 TraceCheckUtils]: 14: Hoare triple {257#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {261#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:18:25,793 INFO L290 TraceCheckUtils]: 15: Hoare triple {261#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {261#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:18:25,795 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {261#(not (= |assume_abort_if_not_#in~cond| 0))} {268#(and (<= 0 main_~A~0) (<= main_~A~0 1))} #63#return; {287#(and (<= 0 main_~A~0) (<= main_~A~0 1) (<= 0 main_~R~0) (<= main_~R~0 1))} is VALID [2022-04-27 13:18:25,795 INFO L272 TraceCheckUtils]: 17: Hoare triple {287#(and (<= 0 main_~A~0) (<= main_~A~0 1) (<= 0 main_~R~0) (<= main_~R~0 1))} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {231#true} is VALID [2022-04-27 13:18:25,795 INFO L290 TraceCheckUtils]: 18: Hoare triple {231#true} ~cond := #in~cond; {257#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:18:25,796 INFO L290 TraceCheckUtils]: 19: Hoare triple {257#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {261#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:18:25,799 INFO L290 TraceCheckUtils]: 20: Hoare triple {261#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {261#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:18:25,799 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {261#(not (= |assume_abort_if_not_#in~cond| 0))} {287#(and (<= 0 main_~A~0) (<= main_~A~0 1) (<= 0 main_~R~0) (<= main_~R~0 1))} #65#return; {303#(and (<= main_~A~0 1) (< (+ (* main_~R~0 main_~R~0) 1) (+ main_~A~0 (* main_~R~0 2))))} is VALID [2022-04-27 13:18:25,800 INFO L272 TraceCheckUtils]: 22: Hoare triple {303#(and (<= main_~A~0 1) (< (+ (* main_~R~0 main_~R~0) 1) (+ main_~A~0 (* main_~R~0 2))))} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {231#true} is VALID [2022-04-27 13:18:25,800 INFO L290 TraceCheckUtils]: 23: Hoare triple {231#true} ~cond := #in~cond; {231#true} is VALID [2022-04-27 13:18:25,800 INFO L290 TraceCheckUtils]: 24: Hoare triple {231#true} assume !(0 == ~cond); {231#true} is VALID [2022-04-27 13:18:25,800 INFO L290 TraceCheckUtils]: 25: Hoare triple {231#true} assume true; {231#true} is VALID [2022-04-27 13:18:25,801 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {231#true} {303#(and (<= main_~A~0 1) (< (+ (* main_~R~0 main_~R~0) 1) (+ main_~A~0 (* main_~R~0 2))))} #67#return; {303#(and (<= main_~A~0 1) (< (+ (* main_~R~0 main_~R~0) 1) (+ main_~A~0 (* main_~R~0 2))))} is VALID [2022-04-27 13:18:25,803 INFO L290 TraceCheckUtils]: 27: Hoare triple {303#(and (<= main_~A~0 1) (< (+ (* main_~R~0 main_~R~0) 1) (+ main_~A~0 (* main_~R~0 2))))} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {322#(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) (< (+ (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2))) 1) (+ main_~A~0 (* 2 (div (+ (* (- 1) main_~u~0) 1) (- 2))))) (= main_~v~0 1) (<= main_~A~0 1))} is VALID [2022-04-27 13:18:25,804 INFO L290 TraceCheckUtils]: 28: Hoare triple {322#(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) (< (+ (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2))) 1) (+ main_~A~0 (* 2 (div (+ (* (- 1) main_~u~0) 1) (- 2))))) (= main_~v~0 1) (<= main_~A~0 1))} assume !false; {322#(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) (< (+ (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2))) 1) (+ main_~A~0 (* 2 (div (+ (* (- 1) main_~u~0) 1) (- 2))))) (= main_~v~0 1) (<= main_~A~0 1))} is VALID [2022-04-27 13:18:25,806 INFO L272 TraceCheckUtils]: 29: Hoare triple {322#(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) (< (+ (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2))) 1) (+ main_~A~0 (* 2 (div (+ (* (- 1) main_~u~0) 1) (- 2))))) (= main_~v~0 1) (<= main_~A~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)); {329#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:18:25,806 INFO L290 TraceCheckUtils]: 30: Hoare triple {329#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {333#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:18:25,807 INFO L290 TraceCheckUtils]: 31: Hoare triple {333#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {232#false} is VALID [2022-04-27 13:18:25,807 INFO L290 TraceCheckUtils]: 32: Hoare triple {232#false} assume !false; {232#false} is VALID [2022-04-27 13:18:25,808 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 13:18:25,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:18:26,071 INFO L290 TraceCheckUtils]: 32: Hoare triple {232#false} assume !false; {232#false} is VALID [2022-04-27 13:18:26,071 INFO L290 TraceCheckUtils]: 31: Hoare triple {333#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {232#false} is VALID [2022-04-27 13:18:26,072 INFO L290 TraceCheckUtils]: 30: Hoare triple {329#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {333#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:18:26,073 INFO L272 TraceCheckUtils]: 29: Hoare triple {349#(= (+ (* 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)))} 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)); {329#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:18:26,073 INFO L290 TraceCheckUtils]: 28: Hoare triple {349#(= (+ (* 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 !false; {349#(= (+ (* 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 13:18:26,075 INFO L290 TraceCheckUtils]: 27: Hoare triple {231#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {349#(= (+ (* 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 13:18:26,075 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {231#true} {231#true} #67#return; {231#true} is VALID [2022-04-27 13:18:26,075 INFO L290 TraceCheckUtils]: 25: Hoare triple {231#true} assume true; {231#true} is VALID [2022-04-27 13:18:26,075 INFO L290 TraceCheckUtils]: 24: Hoare triple {231#true} assume !(0 == ~cond); {231#true} is VALID [2022-04-27 13:18:26,075 INFO L290 TraceCheckUtils]: 23: Hoare triple {231#true} ~cond := #in~cond; {231#true} is VALID [2022-04-27 13:18:26,075 INFO L272 TraceCheckUtils]: 22: Hoare triple {231#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)); {231#true} is VALID [2022-04-27 13:18:26,076 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {231#true} {231#true} #65#return; {231#true} is VALID [2022-04-27 13:18:26,076 INFO L290 TraceCheckUtils]: 20: Hoare triple {231#true} assume true; {231#true} is VALID [2022-04-27 13:18:26,076 INFO L290 TraceCheckUtils]: 19: Hoare triple {231#true} assume !(0 == ~cond); {231#true} is VALID [2022-04-27 13:18:26,076 INFO L290 TraceCheckUtils]: 18: Hoare triple {231#true} ~cond := #in~cond; {231#true} is VALID [2022-04-27 13:18:26,076 INFO L272 TraceCheckUtils]: 17: Hoare triple {231#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {231#true} is VALID [2022-04-27 13:18:26,076 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {231#true} {231#true} #63#return; {231#true} is VALID [2022-04-27 13:18:26,076 INFO L290 TraceCheckUtils]: 15: Hoare triple {231#true} assume true; {231#true} is VALID [2022-04-27 13:18:26,077 INFO L290 TraceCheckUtils]: 14: Hoare triple {231#true} assume !(0 == ~cond); {231#true} is VALID [2022-04-27 13:18:26,077 INFO L290 TraceCheckUtils]: 13: Hoare triple {231#true} ~cond := #in~cond; {231#true} is VALID [2022-04-27 13:18:26,077 INFO L272 TraceCheckUtils]: 12: Hoare triple {231#true} call assume_abort_if_not((if ~R~0 >= 0 && ~R~0 <= 1 then 1 else 0)); {231#true} is VALID [2022-04-27 13:18:26,077 INFO L290 TraceCheckUtils]: 11: Hoare triple {231#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {231#true} is VALID [2022-04-27 13:18:26,077 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {231#true} {231#true} #61#return; {231#true} is VALID [2022-04-27 13:18:26,077 INFO L290 TraceCheckUtils]: 9: Hoare triple {231#true} assume true; {231#true} is VALID [2022-04-27 13:18:26,078 INFO L290 TraceCheckUtils]: 8: Hoare triple {231#true} assume !(0 == ~cond); {231#true} is VALID [2022-04-27 13:18:26,078 INFO L290 TraceCheckUtils]: 7: Hoare triple {231#true} ~cond := #in~cond; {231#true} is VALID [2022-04-27 13:18:26,078 INFO L272 TraceCheckUtils]: 6: Hoare triple {231#true} call assume_abort_if_not((if ~A~0 >= 0 && ~A~0 <= 1 then 1 else 0)); {231#true} is VALID [2022-04-27 13:18:26,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {231#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; {231#true} is VALID [2022-04-27 13:18:26,078 INFO L272 TraceCheckUtils]: 4: Hoare triple {231#true} call #t~ret6 := main(); {231#true} is VALID [2022-04-27 13:18:26,078 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {231#true} {231#true} #73#return; {231#true} is VALID [2022-04-27 13:18:26,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {231#true} assume true; {231#true} is VALID [2022-04-27 13:18:26,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {231#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); {231#true} is VALID [2022-04-27 13:18:26,079 INFO L272 TraceCheckUtils]: 0: Hoare triple {231#true} call ULTIMATE.init(); {231#true} is VALID [2022-04-27 13:18:26,079 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 13:18:26,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:18:26,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673253193] [2022-04-27 13:18:26,079 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:18:26,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248927908] [2022-04-27 13:18:26,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248927908] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 13:18:26,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:18:26,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2022-04-27 13:18:26,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235596051] [2022-04-27 13:18:26,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:18:26,081 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33 [2022-04-27 13:18:26,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:18:26,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:18:26,099 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:18:26,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:18:26,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:18:26,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:18:26,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:18:26,100 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:18:26,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:26,276 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-27 13:18:26,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:18:26,277 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33 [2022-04-27 13:18:26,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:18:26,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:18:26,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-04-27 13:18:26,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:18:26,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-04-27 13:18:26,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 37 transitions. [2022-04-27 13:18:26,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:18:26,334 INFO L225 Difference]: With dead ends: 33 [2022-04-27 13:18:26,334 INFO L226 Difference]: Without dead ends: 29 [2022-04-27 13:18:26,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-04-27 13:18:26,335 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 7 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:18:26,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 88 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:18:26,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-27 13:18:26,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-27 13:18:26,341 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:18:26,341 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 8 states have call successors, (8), 5 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 13:18:26,341 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 8 states have call successors, (8), 5 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 13:18:26,342 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 8 states have call successors, (8), 5 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 13:18:26,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:26,344 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-27 13:18:26,344 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-27 13:18:26,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:18:26,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:18:26,345 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 8 states have call successors, (8), 5 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 13:18:26,347 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 8 states have call successors, (8), 5 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 13:18:26,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:26,350 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-27 13:18:26,350 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-27 13:18:26,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:18:26,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:18:26,356 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:18:26,356 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:18:26,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 8 states have call successors, (8), 5 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 13:18:26,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-04-27 13:18:26,358 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 33 [2022-04-27 13:18:26,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:18:26,358 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-04-27 13:18:26,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:18:26,359 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-27 13:18:26,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-27 13:18:26,359 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:18:26,360 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:18:26,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 13:18:26,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:18:26,561 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:18:26,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:18:26,561 INFO L85 PathProgramCache]: Analyzing trace with hash -453872510, now seen corresponding path program 1 times [2022-04-27 13:18:26,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:18:26,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125764691] [2022-04-27 13:18:26,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:18:26,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:18:26,573 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:18:26,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [484316180] [2022-04-27 13:18:26,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:18:26,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:18:26,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:18:26,587 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 13:18:26,603 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 13:18:26,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:26,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 13:18:26,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:26,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:18:26,810 INFO L272 TraceCheckUtils]: 0: Hoare triple {589#true} call ULTIMATE.init(); {589#true} is VALID [2022-04-27 13:18:26,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {589#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); {589#true} is VALID [2022-04-27 13:18:26,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {589#true} assume true; {589#true} is VALID [2022-04-27 13:18:26,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {589#true} {589#true} #73#return; {589#true} is VALID [2022-04-27 13:18:26,811 INFO L272 TraceCheckUtils]: 4: Hoare triple {589#true} call #t~ret6 := main(); {589#true} is VALID [2022-04-27 13:18:26,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {589#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; {589#true} is VALID [2022-04-27 13:18:26,811 INFO L272 TraceCheckUtils]: 6: Hoare triple {589#true} call assume_abort_if_not((if ~A~0 >= 0 && ~A~0 <= 1 then 1 else 0)); {589#true} is VALID [2022-04-27 13:18:26,811 INFO L290 TraceCheckUtils]: 7: Hoare triple {589#true} ~cond := #in~cond; {589#true} is VALID [2022-04-27 13:18:26,811 INFO L290 TraceCheckUtils]: 8: Hoare triple {589#true} assume !(0 == ~cond); {589#true} is VALID [2022-04-27 13:18:26,812 INFO L290 TraceCheckUtils]: 9: Hoare triple {589#true} assume true; {589#true} is VALID [2022-04-27 13:18:26,812 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {589#true} {589#true} #61#return; {589#true} is VALID [2022-04-27 13:18:26,812 INFO L290 TraceCheckUtils]: 11: Hoare triple {589#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {589#true} is VALID [2022-04-27 13:18:26,812 INFO L272 TraceCheckUtils]: 12: Hoare triple {589#true} call assume_abort_if_not((if ~R~0 >= 0 && ~R~0 <= 1 then 1 else 0)); {589#true} is VALID [2022-04-27 13:18:26,812 INFO L290 TraceCheckUtils]: 13: Hoare triple {589#true} ~cond := #in~cond; {589#true} is VALID [2022-04-27 13:18:26,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {589#true} assume !(0 == ~cond); {589#true} is VALID [2022-04-27 13:18:26,812 INFO L290 TraceCheckUtils]: 15: Hoare triple {589#true} assume true; {589#true} is VALID [2022-04-27 13:18:26,812 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {589#true} {589#true} #63#return; {589#true} is VALID [2022-04-27 13:18:26,812 INFO L272 TraceCheckUtils]: 17: Hoare triple {589#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {589#true} is VALID [2022-04-27 13:18:26,812 INFO L290 TraceCheckUtils]: 18: Hoare triple {589#true} ~cond := #in~cond; {589#true} is VALID [2022-04-27 13:18:26,813 INFO L290 TraceCheckUtils]: 19: Hoare triple {589#true} assume !(0 == ~cond); {589#true} is VALID [2022-04-27 13:18:26,813 INFO L290 TraceCheckUtils]: 20: Hoare triple {589#true} assume true; {589#true} is VALID [2022-04-27 13:18:26,813 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {589#true} {589#true} #65#return; {589#true} is VALID [2022-04-27 13:18:26,813 INFO L272 TraceCheckUtils]: 22: Hoare triple {589#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)); {589#true} is VALID [2022-04-27 13:18:26,813 INFO L290 TraceCheckUtils]: 23: Hoare triple {589#true} ~cond := #in~cond; {589#true} is VALID [2022-04-27 13:18:26,813 INFO L290 TraceCheckUtils]: 24: Hoare triple {589#true} assume !(0 == ~cond); {589#true} is VALID [2022-04-27 13:18:26,813 INFO L290 TraceCheckUtils]: 25: Hoare triple {589#true} assume true; {589#true} is VALID [2022-04-27 13:18:26,813 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {589#true} {589#true} #67#return; {589#true} is VALID [2022-04-27 13:18:26,813 INFO L290 TraceCheckUtils]: 27: Hoare triple {589#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {589#true} is VALID [2022-04-27 13:18:26,814 INFO L290 TraceCheckUtils]: 28: Hoare triple {589#true} assume !false; {589#true} is VALID [2022-04-27 13:18:26,814 INFO L272 TraceCheckUtils]: 29: Hoare triple {589#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)); {589#true} is VALID [2022-04-27 13:18:26,818 INFO L290 TraceCheckUtils]: 30: Hoare triple {589#true} ~cond := #in~cond; {684#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:18:26,818 INFO L290 TraceCheckUtils]: 31: Hoare triple {684#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {688#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:18:26,819 INFO L290 TraceCheckUtils]: 32: Hoare triple {688#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {688#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:18:26,820 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {688#(not (= |__VERIFIER_assert_#in~cond| 0))} {589#true} #69#return; {695#(= (+ (* 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 13:18:26,820 INFO L290 TraceCheckUtils]: 34: Hoare triple {695#(= (+ (* 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); {699#(= (+ (* 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 13:18:26,821 INFO L272 TraceCheckUtils]: 35: Hoare triple {699#(= (+ (* 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)); {703#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:18:26,821 INFO L290 TraceCheckUtils]: 36: Hoare triple {703#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {707#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:18:26,821 INFO L290 TraceCheckUtils]: 37: Hoare triple {707#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {590#false} is VALID [2022-04-27 13:18:26,821 INFO L290 TraceCheckUtils]: 38: Hoare triple {590#false} assume !false; {590#false} is VALID [2022-04-27 13:18:26,822 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 13:18:26,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:18:27,155 INFO L290 TraceCheckUtils]: 38: Hoare triple {590#false} assume !false; {590#false} is VALID [2022-04-27 13:18:27,155 INFO L290 TraceCheckUtils]: 37: Hoare triple {707#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {590#false} is VALID [2022-04-27 13:18:27,156 INFO L290 TraceCheckUtils]: 36: Hoare triple {703#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {707#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:18:27,157 INFO L272 TraceCheckUtils]: 35: Hoare triple {699#(= (+ (* 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)); {703#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:18:27,157 INFO L290 TraceCheckUtils]: 34: Hoare triple {726#(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); {699#(= (+ (* 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 13:18:27,158 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {688#(not (= |__VERIFIER_assert_#in~cond| 0))} {589#true} #69#return; {726#(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 13:18:27,158 INFO L290 TraceCheckUtils]: 32: Hoare triple {688#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {688#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:18:27,159 INFO L290 TraceCheckUtils]: 31: Hoare triple {739#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {688#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:18:27,159 INFO L290 TraceCheckUtils]: 30: Hoare triple {589#true} ~cond := #in~cond; {739#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:18:27,159 INFO L272 TraceCheckUtils]: 29: Hoare triple {589#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)); {589#true} is VALID [2022-04-27 13:18:27,159 INFO L290 TraceCheckUtils]: 28: Hoare triple {589#true} assume !false; {589#true} is VALID [2022-04-27 13:18:27,159 INFO L290 TraceCheckUtils]: 27: Hoare triple {589#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {589#true} is VALID [2022-04-27 13:18:27,159 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {589#true} {589#true} #67#return; {589#true} is VALID [2022-04-27 13:18:27,160 INFO L290 TraceCheckUtils]: 25: Hoare triple {589#true} assume true; {589#true} is VALID [2022-04-27 13:18:27,160 INFO L290 TraceCheckUtils]: 24: Hoare triple {589#true} assume !(0 == ~cond); {589#true} is VALID [2022-04-27 13:18:27,160 INFO L290 TraceCheckUtils]: 23: Hoare triple {589#true} ~cond := #in~cond; {589#true} is VALID [2022-04-27 13:18:27,160 INFO L272 TraceCheckUtils]: 22: Hoare triple {589#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)); {589#true} is VALID [2022-04-27 13:18:27,160 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {589#true} {589#true} #65#return; {589#true} is VALID [2022-04-27 13:18:27,160 INFO L290 TraceCheckUtils]: 20: Hoare triple {589#true} assume true; {589#true} is VALID [2022-04-27 13:18:27,160 INFO L290 TraceCheckUtils]: 19: Hoare triple {589#true} assume !(0 == ~cond); {589#true} is VALID [2022-04-27 13:18:27,160 INFO L290 TraceCheckUtils]: 18: Hoare triple {589#true} ~cond := #in~cond; {589#true} is VALID [2022-04-27 13:18:27,160 INFO L272 TraceCheckUtils]: 17: Hoare triple {589#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {589#true} is VALID [2022-04-27 13:18:27,160 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {589#true} {589#true} #63#return; {589#true} is VALID [2022-04-27 13:18:27,160 INFO L290 TraceCheckUtils]: 15: Hoare triple {589#true} assume true; {589#true} is VALID [2022-04-27 13:18:27,161 INFO L290 TraceCheckUtils]: 14: Hoare triple {589#true} assume !(0 == ~cond); {589#true} is VALID [2022-04-27 13:18:27,161 INFO L290 TraceCheckUtils]: 13: Hoare triple {589#true} ~cond := #in~cond; {589#true} is VALID [2022-04-27 13:18:27,161 INFO L272 TraceCheckUtils]: 12: Hoare triple {589#true} call assume_abort_if_not((if ~R~0 >= 0 && ~R~0 <= 1 then 1 else 0)); {589#true} is VALID [2022-04-27 13:18:27,161 INFO L290 TraceCheckUtils]: 11: Hoare triple {589#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {589#true} is VALID [2022-04-27 13:18:27,161 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {589#true} {589#true} #61#return; {589#true} is VALID [2022-04-27 13:18:27,161 INFO L290 TraceCheckUtils]: 9: Hoare triple {589#true} assume true; {589#true} is VALID [2022-04-27 13:18:27,161 INFO L290 TraceCheckUtils]: 8: Hoare triple {589#true} assume !(0 == ~cond); {589#true} is VALID [2022-04-27 13:18:27,161 INFO L290 TraceCheckUtils]: 7: Hoare triple {589#true} ~cond := #in~cond; {589#true} is VALID [2022-04-27 13:18:27,161 INFO L272 TraceCheckUtils]: 6: Hoare triple {589#true} call assume_abort_if_not((if ~A~0 >= 0 && ~A~0 <= 1 then 1 else 0)); {589#true} is VALID [2022-04-27 13:18:27,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {589#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; {589#true} is VALID [2022-04-27 13:18:27,162 INFO L272 TraceCheckUtils]: 4: Hoare triple {589#true} call #t~ret6 := main(); {589#true} is VALID [2022-04-27 13:18:27,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {589#true} {589#true} #73#return; {589#true} is VALID [2022-04-27 13:18:27,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {589#true} assume true; {589#true} is VALID [2022-04-27 13:18:27,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {589#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); {589#true} is VALID [2022-04-27 13:18:27,162 INFO L272 TraceCheckUtils]: 0: Hoare triple {589#true} call ULTIMATE.init(); {589#true} is VALID [2022-04-27 13:18:27,162 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 13:18:27,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:18:27,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125764691] [2022-04-27 13:18:27,163 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:18:27,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484316180] [2022-04-27 13:18:27,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484316180] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:18:27,163 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:18:27,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-27 13:18:27,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312922408] [2022-04-27 13:18:27,164 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:18:27,164 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) Word has length 39 [2022-04-27 13:18:27,164 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:18:27,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 13:18:27,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:18:27,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 13:18:27,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:18:27,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 13:18:27,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:18:27,188 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 13:18:27,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:27,494 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-27 13:18:27,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 13:18:27,494 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) Word has length 39 [2022-04-27 13:18:27,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:18:27,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 13:18:27,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-27 13:18:27,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 13:18:27,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-27 13:18:27,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 32 transitions. [2022-04-27 13:18:27,524 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:18:27,524 INFO L225 Difference]: With dead ends: 29 [2022-04-27 13:18:27,524 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 13:18:27,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 68 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 13:18:27,525 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 13 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:18:27,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 109 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:18:27,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 13:18:27,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 13:18:27,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:18:27,526 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 13:18:27,526 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 13:18:27,526 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 13:18:27,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:27,527 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 13:18:27,527 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 13:18:27,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:18:27,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:18:27,527 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 13:18:27,527 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 13:18:27,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:27,527 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 13:18:27,527 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 13:18:27,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:18:27,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:18:27,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:18:27,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:18:27,528 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 13:18:27,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 13:18:27,528 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2022-04-27 13:18:27,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:18:27,528 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 13:18:27,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 13:18:27,528 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 13:18:27,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:18:27,530 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 13:18:27,548 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 13:18:27,739 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,SelfDestructingSolverStorable2 [2022-04-27 13:18:27,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 13:18:27,780 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2022-04-27 13:18:27,780 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2022-04-27 13:18:27,780 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2022-04-27 13:18:27,780 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 8 10) the Hoare annotation is: true [2022-04-27 13:18:27,780 INFO L899 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2022-04-27 13:18:27,780 INFO L899 garLoopResultBuilder]: For program point L9-2(lines 8 10) no Hoare annotation was computed. [2022-04-27 13:18:27,780 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 8 10) no Hoare annotation was computed. [2022-04-27 13:18:27,781 INFO L895 garLoopResultBuilder]: At program point L35-2(lines 35 46) 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 13:18:27,781 INFO L899 garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed. [2022-04-27 13:18:27,781 INFO L902 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: true [2022-04-27 13:18:27,781 INFO L902 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: true [2022-04-27 13:18:27,781 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 19 51) no Hoare annotation was computed. [2022-04-27 13:18:27,781 INFO L902 garLoopResultBuilder]: At program point L25-1(line 25) the Hoare annotation is: true [2022-04-27 13:18:27,781 INFO L902 garLoopResultBuilder]: At program point L23(line 23) the Hoare annotation is: true [2022-04-27 13:18:27,781 INFO L899 garLoopResultBuilder]: For program point L23-1(line 23) no Hoare annotation was computed. [2022-04-27 13:18:27,781 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 19 51) no Hoare annotation was computed. [2022-04-27 13:18:27,781 INFO L895 garLoopResultBuilder]: At program point L36(line 36) 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 13:18:27,781 INFO L899 garLoopResultBuilder]: For program point L36-1(lines 35 46) no Hoare annotation was computed. [2022-04-27 13:18:27,781 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 19 51) the Hoare annotation is: true [2022-04-27 13:18:27,782 INFO L899 garLoopResultBuilder]: For program point L49(line 49) no Hoare annotation was computed. [2022-04-27 13:18:27,782 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 45) no Hoare annotation was computed. [2022-04-27 13:18:27,782 INFO L895 garLoopResultBuilder]: At program point L39-2(lines 35 46) 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 13:18:27,782 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 13:18:27,782 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 13:18:27,782 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 13:18:27,782 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 13:18:27,782 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 13:18:27,782 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 13:18:27,782 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 13:18:27,782 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-27 13:18:27,782 INFO L899 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2022-04-27 13:18:27,782 INFO L899 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2022-04-27 13:18:27,783 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2022-04-27 13:18:27,783 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2022-04-27 13:18:27,783 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-04-27 13:18:27,785 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-27 13:18:27,786 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 13:18:27,788 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 13:18:27,788 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 13:18:27,789 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 13:18:27,789 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:18:27,789 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 13:18:27,789 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 13:18:27,789 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 13:18:27,789 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 13:18:27,789 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 13:18:27,789 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2022-04-27 13:18:27,789 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:18:27,789 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:18:27,789 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 13:18:27,789 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 13:18:27,789 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-27 13:18:27,789 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2022-04-27 13:18:27,789 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 13:18:27,789 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 13:18:27,789 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-27 13:18:27,789 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:18:27,790 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:18:27,790 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:18:27,790 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:18:27,790 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:18:27,790 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:18:27,790 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 13:18:27,790 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 13:18:27,790 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-27 13:18:27,790 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-27 13:18:27,790 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-27 13:18:27,791 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-27 13:18:27,791 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-27 13:18:27,791 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-27 13:18:27,791 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 13:18:27,791 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-27 13:18:27,791 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 13:18:27,791 INFO L163 areAnnotationChecker]: CFG has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 13:18:27,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 01:18:27 BoogieIcfgContainer [2022-04-27 13:18:27,796 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 13:18:27,797 INFO L158 Benchmark]: Toolchain (without parser) took 9418.40ms. Allocated memory was 163.6MB in the beginning and 197.1MB in the end (delta: 33.6MB). Free memory was 112.2MB in the beginning and 170.1MB in the end (delta: -57.9MB). Peak memory consumption was 87.3MB. Max. memory is 8.0GB. [2022-04-27 13:18:27,797 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 163.6MB. Free memory is still 128.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 13:18:27,797 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.30ms. Allocated memory is still 163.6MB. Free memory was 112.0MB in the beginning and 136.9MB in the end (delta: -24.9MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. [2022-04-27 13:18:27,797 INFO L158 Benchmark]: Boogie Preprocessor took 29.65ms. Allocated memory is still 163.6MB. Free memory was 136.9MB in the beginning and 135.6MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 13:18:27,798 INFO L158 Benchmark]: RCFGBuilder took 220.62ms. Allocated memory is still 163.6MB. Free memory was 135.2MB in the beginning and 124.1MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 13:18:27,798 INFO L158 Benchmark]: TraceAbstraction took 8913.96ms. Allocated memory was 163.6MB in the beginning and 197.1MB in the end (delta: 33.6MB). Free memory was 123.3MB in the beginning and 170.1MB in the end (delta: -46.8MB). Peak memory consumption was 98.2MB. Max. memory is 8.0GB. [2022-04-27 13:18:27,799 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 163.6MB. Free memory is still 128.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 248.30ms. Allocated memory is still 163.6MB. Free memory was 112.0MB in the beginning and 136.9MB in the end (delta: -24.9MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.65ms. Allocated memory is still 163.6MB. Free memory was 136.9MB in the beginning and 135.6MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 220.62ms. Allocated memory is still 163.6MB. Free memory was 135.2MB in the beginning and 124.1MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 8913.96ms. Allocated memory was 163.6MB in the beginning and 197.1MB in the end (delta: 33.6MB). Free memory was 123.3MB in the beginning and 170.1MB in the end (delta: -46.8MB). Peak memory consumption was 98.2MB. 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, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.9s, OverallIterations: 3, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 45 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 38 mSDsluCounter, 231 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 152 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 90 IncrementalHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 79 mSDtfsCounter, 90 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 138 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, InterpolantAutomatonStates: 14, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 22 PreInvPairs, 28 NumberOfFragments, 98 HoareAnnotationTreeSize, 22 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 105 NumberOfCodeBlocks, 105 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 172 ConstructedInterpolants, 0 QuantifiedInterpolants, 533 SizeOfPredicates, 12 NumberOfNonLiveVariables, 209 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 113/124 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: 35]: 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 13:18:27,812 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...