/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/sqrt1-ll_valuebound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 14:56:04,292 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 14:56:04,293 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 14:56:04,315 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 14:56:04,315 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 14:56:04,316 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 14:56:04,319 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 14:56:04,322 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 14:56:04,323 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 14:56:04,327 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 14:56:04,327 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 14:56:04,328 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 14:56:04,328 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 14:56:04,330 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 14:56:04,331 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 14:56:04,332 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 14:56:04,333 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 14:56:04,334 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 14:56:04,338 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 14:56:04,341 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 14:56:04,342 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 14:56:04,345 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 14:56:04,345 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 14:56:04,346 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 14:56:04,347 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 14:56:04,350 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 14:56:04,350 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 14:56:04,350 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 14:56:04,351 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 14:56:04,351 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 14:56:04,352 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 14:56:04,352 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 14:56:04,352 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 14:56:04,353 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 14:56:04,353 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 14:56:04,353 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 14:56:04,354 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 14:56:04,354 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 14:56:04,354 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 14:56:04,354 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 14:56:04,355 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 14:56:04,359 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 14:56:04,360 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 14:56:04,380 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 14:56:04,380 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 14:56:04,380 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 14:56:04,380 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 14:56:04,381 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 14:56:04,381 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 14:56:04,381 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 14:56:04,381 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 14:56:04,381 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 14:56:04,382 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 14:56:04,382 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 14:56:04,382 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 14:56:04,382 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 14:56:04,382 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 14:56:04,382 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 14:56:04,382 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 14:56:04,382 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 14:56:04,382 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 14:56:04,382 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 14:56:04,382 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 14:56:04,383 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 14:56:04,383 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 14:56:04,383 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 14:56:04,383 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 14:56:04,383 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:56:04,383 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 14:56:04,383 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 14:56:04,383 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 14:56:04,383 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 14:56:04,383 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 14:56:04,383 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 14:56:04,384 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 14:56:04,384 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 14:56:04,384 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 14:56:04,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 14:56:04,537 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 14:56:04,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 14:56:04,539 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 14:56:04,539 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 14:56:04,540 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound5.c [2022-04-27 14:56:04,588 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3e0d6fe5/8bd1d753379d4217aca7603583649bf1/FLAG6462b1d67 [2022-04-27 14:56:04,923 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 14:56:04,924 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound5.c [2022-04-27 14:56:04,928 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3e0d6fe5/8bd1d753379d4217aca7603583649bf1/FLAG6462b1d67 [2022-04-27 14:56:05,380 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3e0d6fe5/8bd1d753379d4217aca7603583649bf1 [2022-04-27 14:56:05,382 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 14:56:05,383 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 14:56:05,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 14:56:05,389 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 14:56:05,391 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 14:56:05,391 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:56:05" (1/1) ... [2022-04-27 14:56:05,392 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74335dd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:56:05, skipping insertion in model container [2022-04-27 14:56:05,392 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:56:05" (1/1) ... [2022-04-27 14:56:05,398 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 14:56:05,421 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 14:56:05,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/sqrt1-ll_valuebound5.c[520,533] [2022-04-27 14:56:05,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:56:05,581 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 14:56:05,596 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/sqrt1-ll_valuebound5.c[520,533] [2022-04-27 14:56:05,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:56:05,615 INFO L208 MainTranslator]: Completed translation [2022-04-27 14:56:05,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:56:05 WrapperNode [2022-04-27 14:56:05,616 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 14:56:05,616 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 14:56:05,616 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 14:56:05,617 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 14:56:05,623 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:56:05" (1/1) ... [2022-04-27 14:56:05,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:56:05" (1/1) ... [2022-04-27 14:56:05,629 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:56:05" (1/1) ... [2022-04-27 14:56:05,629 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:56:05" (1/1) ... [2022-04-27 14:56:05,640 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:56:05" (1/1) ... [2022-04-27 14:56:05,643 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:56:05" (1/1) ... [2022-04-27 14:56:05,643 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:56:05" (1/1) ... [2022-04-27 14:56:05,644 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 14:56:05,645 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 14:56:05,645 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 14:56:05,645 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 14:56:05,645 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:56:05" (1/1) ... [2022-04-27 14:56:05,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:56:05,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:56:05,672 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 14:56:05,680 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 14:56:05,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 14:56:05,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 14:56:05,696 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 14:56:05,696 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 14:56:05,696 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 14:56:05,696 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 14:56:05,696 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 14:56:05,696 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 14:56:05,696 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 14:56:05,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 14:56:05,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 14:56:05,697 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 14:56:05,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 14:56:05,697 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 14:56:05,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 14:56:05,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 14:56:05,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 14:56:05,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 14:56:05,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 14:56:05,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 14:56:05,735 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 14:56:05,736 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 14:56:05,822 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 14:56:05,826 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 14:56:05,826 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 14:56:05,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:56:05 BoogieIcfgContainer [2022-04-27 14:56:05,827 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 14:56:05,828 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 14:56:05,828 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 14:56:05,849 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 14:56:05,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 02:56:05" (1/3) ... [2022-04-27 14:56:05,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d063255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:56:05, skipping insertion in model container [2022-04-27 14:56:05,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:56:05" (2/3) ... [2022-04-27 14:56:05,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d063255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:56:05, skipping insertion in model container [2022-04-27 14:56:05,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:56:05" (3/3) ... [2022-04-27 14:56:05,851 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_valuebound5.c [2022-04-27 14:56:05,860 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 14:56:05,861 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 14:56:05,920 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 14:56:05,925 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@41840aa1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@722e289e [2022-04-27 14:56:05,925 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 14:56:05,932 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:56:05,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 14:56:05,936 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:56:05,937 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:56:05,937 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:56:05,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:56:05,960 INFO L85 PathProgramCache]: Analyzing trace with hash 326851384, now seen corresponding path program 1 times [2022-04-27 14:56:05,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:56:05,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080742300] [2022-04-27 14:56:05,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:56:05,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:56:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:56:06,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:56:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:56:06,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#(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(11, 2);call #Ultimate.allocInit(12, 3); {34#true} is VALID [2022-04-27 14:56:06,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-27 14:56:06,083 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #69#return; {34#true} is VALID [2022-04-27 14:56:06,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 14:56:06,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:56:06,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-27 14:56:06,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-27 14:56:06,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-27 14:56:06,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {34#true} #55#return; {35#false} is VALID [2022-04-27 14:56:06,099 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 14:56:06,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#(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(11, 2);call #Ultimate.allocInit(12, 3); {34#true} is VALID [2022-04-27 14:56:06,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-27 14:56:06,100 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #69#return; {34#true} is VALID [2022-04-27 14:56:06,100 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret5 := main(); {34#true} is VALID [2022-04-27 14:56:06,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {34#true} is VALID [2022-04-27 14:56:06,100 INFO L272 TraceCheckUtils]: 6: Hoare triple {34#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 5 then 1 else 0)); {34#true} is VALID [2022-04-27 14:56:06,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-27 14:56:06,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-27 14:56:06,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-27 14:56:06,101 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35#false} {34#true} #55#return; {35#false} is VALID [2022-04-27 14:56:06,101 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {35#false} is VALID [2022-04-27 14:56:06,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {35#false} assume false; {35#false} is VALID [2022-04-27 14:56:06,102 INFO L272 TraceCheckUtils]: 13: Hoare triple {35#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {35#false} is VALID [2022-04-27 14:56:06,102 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-27 14:56:06,102 INFO L290 TraceCheckUtils]: 15: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-27 14:56:06,102 INFO L290 TraceCheckUtils]: 16: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-27 14:56:06,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:56:06,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:56:06,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080742300] [2022-04-27 14:56:06,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080742300] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:56:06,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:56:06,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 14:56:06,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410538495] [2022-04-27 14:56:06,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:56:06,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 14:56:06,112 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:56:06,114 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:56:06,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:56:06,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 14:56:06,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:56:06,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 14:56:06,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:56:06,185 INFO L87 Difference]: Start difference. First operand has 31 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:56:06,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:06,302 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2022-04-27 14:56:06,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 14:56:06,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 14:56:06,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:56:06,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:56:06,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2022-04-27 14:56:06,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:56:06,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2022-04-27 14:56:06,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 76 transitions. [2022-04-27 14:56:06,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:56:06,399 INFO L225 Difference]: With dead ends: 53 [2022-04-27 14:56:06,399 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 14:56:06,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 14:56:06,404 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:56:06,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:56:06,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 14:56:06,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-27 14:56:06,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:56:06,430 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:56:06,431 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:56:06,431 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:56:06,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:06,442 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-27 14:56:06,442 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-27 14:56:06,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:56:06,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:56:06,443 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 26 states. [2022-04-27 14:56:06,444 INFO L87 Difference]: Start difference. First operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 26 states. [2022-04-27 14:56:06,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:06,447 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-27 14:56:06,448 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-27 14:56:06,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:56:06,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:56:06,448 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:56:06,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:56:06,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:56:06,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-04-27 14:56:06,451 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 17 [2022-04-27 14:56:06,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:56:06,452 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-04-27 14:56:06,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:56:06,452 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-27 14:56:06,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 14:56:06,452 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:56:06,453 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:56:06,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 14:56:06,453 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:56:06,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:56:06,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1008578050, now seen corresponding path program 1 times [2022-04-27 14:56:06,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:56:06,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251889895] [2022-04-27 14:56:06,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:56:06,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:56:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:56:06,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:56:06,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:56:06,541 INFO L290 TraceCheckUtils]: 0: Hoare triple {225#(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(11, 2);call #Ultimate.allocInit(12, 3); {213#true} is VALID [2022-04-27 14:56:06,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {213#true} assume true; {213#true} is VALID [2022-04-27 14:56:06,541 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {213#true} {213#true} #69#return; {213#true} is VALID [2022-04-27 14:56:06,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 14:56:06,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:56:06,547 INFO L290 TraceCheckUtils]: 0: Hoare triple {213#true} ~cond := #in~cond; {213#true} is VALID [2022-04-27 14:56:06,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {213#true} assume !(0 == ~cond); {213#true} is VALID [2022-04-27 14:56:06,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {213#true} assume true; {213#true} is VALID [2022-04-27 14:56:06,548 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {213#true} {213#true} #55#return; {213#true} is VALID [2022-04-27 14:56:06,549 INFO L272 TraceCheckUtils]: 0: Hoare triple {213#true} call ULTIMATE.init(); {225#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 14:56:06,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {225#(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(11, 2);call #Ultimate.allocInit(12, 3); {213#true} is VALID [2022-04-27 14:56:06,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {213#true} assume true; {213#true} is VALID [2022-04-27 14:56:06,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {213#true} {213#true} #69#return; {213#true} is VALID [2022-04-27 14:56:06,549 INFO L272 TraceCheckUtils]: 4: Hoare triple {213#true} call #t~ret5 := main(); {213#true} is VALID [2022-04-27 14:56:06,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {213#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {213#true} is VALID [2022-04-27 14:56:06,549 INFO L272 TraceCheckUtils]: 6: Hoare triple {213#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 5 then 1 else 0)); {213#true} is VALID [2022-04-27 14:56:06,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {213#true} ~cond := #in~cond; {213#true} is VALID [2022-04-27 14:56:06,550 INFO L290 TraceCheckUtils]: 8: Hoare triple {213#true} assume !(0 == ~cond); {213#true} is VALID [2022-04-27 14:56:06,550 INFO L290 TraceCheckUtils]: 9: Hoare triple {213#true} assume true; {213#true} is VALID [2022-04-27 14:56:06,550 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {213#true} {213#true} #55#return; {213#true} is VALID [2022-04-27 14:56:06,551 INFO L290 TraceCheckUtils]: 11: Hoare triple {213#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {222#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-27 14:56:06,551 INFO L290 TraceCheckUtils]: 12: Hoare triple {222#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} assume !false; {222#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-27 14:56:06,552 INFO L272 TraceCheckUtils]: 13: Hoare triple {222#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {223#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:56:06,552 INFO L290 TraceCheckUtils]: 14: Hoare triple {223#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {224#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 14:56:06,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {224#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {214#false} is VALID [2022-04-27 14:56:06,553 INFO L290 TraceCheckUtils]: 16: Hoare triple {214#false} assume !false; {214#false} is VALID [2022-04-27 14:56:06,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:56:06,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:56:06,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251889895] [2022-04-27 14:56:06,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251889895] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:56:06,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:56:06,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 14:56:06,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233767710] [2022-04-27 14:56:06,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:56:06,555 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 14:56:06,555 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:56:06,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:56:06,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:56:06,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 14:56:06,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:56:06,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 14:56:06,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 14:56:06,568 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:56:06,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:06,882 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-27 14:56:06,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 14:56:06,883 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 14:56:06,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:56:06,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:56:06,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-27 14:56:06,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:56:06,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-27 14:56:06,891 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 50 transitions. [2022-04-27 14:56:06,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:56:06,950 INFO L225 Difference]: With dead ends: 40 [2022-04-27 14:56:06,950 INFO L226 Difference]: Without dead ends: 38 [2022-04-27 14:56:06,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 14:56:06,954 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 25 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:56:06,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 39 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:56:06,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-27 14:56:06,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2022-04-27 14:56:06,963 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:56:06,963 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:56:06,963 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:56:06,964 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:56:06,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:06,966 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-27 14:56:06,966 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-27 14:56:06,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:56:06,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:56:06,977 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states. [2022-04-27 14:56:06,977 INFO L87 Difference]: Start difference. First operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states. [2022-04-27 14:56:06,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:06,980 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-27 14:56:06,980 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-27 14:56:06,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:56:06,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:56:06,981 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:56:06,981 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:56:06,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:56:06,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-04-27 14:56:06,983 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 17 [2022-04-27 14:56:06,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:56:06,983 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-04-27 14:56:06,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:56:06,983 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-27 14:56:06,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 14:56:06,984 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:56:06,984 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:56:06,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 14:56:06,984 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:56:06,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:56:06,985 INFO L85 PathProgramCache]: Analyzing trace with hash -789682422, now seen corresponding path program 1 times [2022-04-27 14:56:06,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:56:06,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293550323] [2022-04-27 14:56:06,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:56:06,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:56:06,998 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:56:06,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1361787503] [2022-04-27 14:56:06,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:56:06,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:56:06,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:56:07,009 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 14:56:07,071 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 14:56:07,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:56:07,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:56:07,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:56:07,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:56:07,231 INFO L272 TraceCheckUtils]: 0: Hoare triple {430#true} call ULTIMATE.init(); {430#true} is VALID [2022-04-27 14:56:07,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {430#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(11, 2);call #Ultimate.allocInit(12, 3); {430#true} is VALID [2022-04-27 14:56:07,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {430#true} assume true; {430#true} is VALID [2022-04-27 14:56:07,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {430#true} {430#true} #69#return; {430#true} is VALID [2022-04-27 14:56:07,231 INFO L272 TraceCheckUtils]: 4: Hoare triple {430#true} call #t~ret5 := main(); {430#true} is VALID [2022-04-27 14:56:07,232 INFO L290 TraceCheckUtils]: 5: Hoare triple {430#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {430#true} is VALID [2022-04-27 14:56:07,232 INFO L272 TraceCheckUtils]: 6: Hoare triple {430#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 5 then 1 else 0)); {430#true} is VALID [2022-04-27 14:56:07,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {430#true} ~cond := #in~cond; {430#true} is VALID [2022-04-27 14:56:07,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {430#true} assume !(0 == ~cond); {430#true} is VALID [2022-04-27 14:56:07,232 INFO L290 TraceCheckUtils]: 9: Hoare triple {430#true} assume true; {430#true} is VALID [2022-04-27 14:56:07,232 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {430#true} {430#true} #55#return; {430#true} is VALID [2022-04-27 14:56:07,233 INFO L290 TraceCheckUtils]: 11: Hoare triple {430#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {468#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-27 14:56:07,233 INFO L290 TraceCheckUtils]: 12: Hoare triple {468#(and (= main_~a~0 0) (= main_~s~0 1))} assume !false; {468#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-27 14:56:07,233 INFO L272 TraceCheckUtils]: 13: Hoare triple {468#(and (= main_~a~0 0) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {430#true} is VALID [2022-04-27 14:56:07,234 INFO L290 TraceCheckUtils]: 14: Hoare triple {430#true} ~cond := #in~cond; {430#true} is VALID [2022-04-27 14:56:07,234 INFO L290 TraceCheckUtils]: 15: Hoare triple {430#true} assume !(0 == ~cond); {430#true} is VALID [2022-04-27 14:56:07,234 INFO L290 TraceCheckUtils]: 16: Hoare triple {430#true} assume true; {430#true} is VALID [2022-04-27 14:56:07,234 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {430#true} {468#(and (= main_~a~0 0) (= main_~s~0 1))} #57#return; {468#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-27 14:56:07,235 INFO L272 TraceCheckUtils]: 18: Hoare triple {468#(and (= main_~a~0 0) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {490#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:56:07,236 INFO L290 TraceCheckUtils]: 19: Hoare triple {490#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {494#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:56:07,236 INFO L290 TraceCheckUtils]: 20: Hoare triple {494#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {431#false} is VALID [2022-04-27 14:56:07,236 INFO L290 TraceCheckUtils]: 21: Hoare triple {431#false} assume !false; {431#false} is VALID [2022-04-27 14:56:07,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:56:07,237 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:56:07,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:56:07,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293550323] [2022-04-27 14:56:07,237 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:56:07,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361787503] [2022-04-27 14:56:07,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361787503] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:56:07,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:56:07,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 14:56:07,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619544737] [2022-04-27 14:56:07,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:56:07,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 14:56:07,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:56:07,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:56:07,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:56:07,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:56:07,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:56:07,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:56:07,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:56:07,255 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:56:07,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:07,377 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-27 14:56:07,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:56:07,377 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 14:56:07,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:56:07,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:56:07,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-27 14:56:07,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:56:07,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-27 14:56:07,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-27 14:56:07,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:56:07,423 INFO L225 Difference]: With dead ends: 44 [2022-04-27 14:56:07,423 INFO L226 Difference]: Without dead ends: 42 [2022-04-27 14:56:07,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 14:56:07,426 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 6 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:56:07,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 103 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:56:07,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-27 14:56:07,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2022-04-27 14:56:07,440 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:56:07,441 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:56:07,441 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:56:07,442 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:56:07,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:07,449 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-27 14:56:07,449 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2022-04-27 14:56:07,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:56:07,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:56:07,454 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 42 states. [2022-04-27 14:56:07,455 INFO L87 Difference]: Start difference. First operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 42 states. [2022-04-27 14:56:07,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:07,456 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-27 14:56:07,456 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2022-04-27 14:56:07,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:56:07,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:56:07,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:56:07,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:56:07,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:56:07,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2022-04-27 14:56:07,463 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 22 [2022-04-27 14:56:07,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:56:07,463 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2022-04-27 14:56:07,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:56:07,464 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2022-04-27 14:56:07,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 14:56:07,464 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:56:07,465 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:56:07,481 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 14:56:07,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:56:07,681 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:56:07,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:56:07,682 INFO L85 PathProgramCache]: Analyzing trace with hash 2087529154, now seen corresponding path program 1 times [2022-04-27 14:56:07,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:56:07,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446237995] [2022-04-27 14:56:07,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:56:07,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:56:07,705 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:56:07,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2066998723] [2022-04-27 14:56:07,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:56:07,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:56:07,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:56:07,723 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 14:56:07,735 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 14:56:07,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:56:07,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:56:07,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:56:07,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:56:07,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {716#true} call ULTIMATE.init(); {716#true} is VALID [2022-04-27 14:56:07,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {716#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(11, 2);call #Ultimate.allocInit(12, 3); {716#true} is VALID [2022-04-27 14:56:07,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {716#true} assume true; {716#true} is VALID [2022-04-27 14:56:07,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {716#true} {716#true} #69#return; {716#true} is VALID [2022-04-27 14:56:07,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {716#true} call #t~ret5 := main(); {716#true} is VALID [2022-04-27 14:56:07,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {716#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {716#true} is VALID [2022-04-27 14:56:07,870 INFO L272 TraceCheckUtils]: 6: Hoare triple {716#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 5 then 1 else 0)); {716#true} is VALID [2022-04-27 14:56:07,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {716#true} ~cond := #in~cond; {716#true} is VALID [2022-04-27 14:56:07,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {716#true} assume !(0 == ~cond); {716#true} is VALID [2022-04-27 14:56:07,871 INFO L290 TraceCheckUtils]: 9: Hoare triple {716#true} assume true; {716#true} is VALID [2022-04-27 14:56:07,871 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {716#true} {716#true} #55#return; {716#true} is VALID [2022-04-27 14:56:07,871 INFO L290 TraceCheckUtils]: 11: Hoare triple {716#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {754#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:56:07,872 INFO L290 TraceCheckUtils]: 12: Hoare triple {754#(and (= main_~t~0 1) (= main_~s~0 1))} assume !false; {754#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:56:07,872 INFO L272 TraceCheckUtils]: 13: Hoare triple {754#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {716#true} is VALID [2022-04-27 14:56:07,872 INFO L290 TraceCheckUtils]: 14: Hoare triple {716#true} ~cond := #in~cond; {716#true} is VALID [2022-04-27 14:56:07,872 INFO L290 TraceCheckUtils]: 15: Hoare triple {716#true} assume !(0 == ~cond); {716#true} is VALID [2022-04-27 14:56:07,872 INFO L290 TraceCheckUtils]: 16: Hoare triple {716#true} assume true; {716#true} is VALID [2022-04-27 14:56:07,873 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {716#true} {754#(and (= main_~t~0 1) (= main_~s~0 1))} #57#return; {754#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:56:07,873 INFO L272 TraceCheckUtils]: 18: Hoare triple {754#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {716#true} is VALID [2022-04-27 14:56:07,873 INFO L290 TraceCheckUtils]: 19: Hoare triple {716#true} ~cond := #in~cond; {716#true} is VALID [2022-04-27 14:56:07,873 INFO L290 TraceCheckUtils]: 20: Hoare triple {716#true} assume !(0 == ~cond); {716#true} is VALID [2022-04-27 14:56:07,873 INFO L290 TraceCheckUtils]: 21: Hoare triple {716#true} assume true; {716#true} is VALID [2022-04-27 14:56:07,874 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {716#true} {754#(and (= main_~t~0 1) (= main_~s~0 1))} #59#return; {754#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:56:07,875 INFO L272 TraceCheckUtils]: 23: Hoare triple {754#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {791#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:56:07,875 INFO L290 TraceCheckUtils]: 24: Hoare triple {791#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {795#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:56:07,875 INFO L290 TraceCheckUtils]: 25: Hoare triple {795#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {717#false} is VALID [2022-04-27 14:56:07,875 INFO L290 TraceCheckUtils]: 26: Hoare triple {717#false} assume !false; {717#false} is VALID [2022-04-27 14:56:07,876 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:56:07,876 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:56:07,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:56:07,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446237995] [2022-04-27 14:56:07,876 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:56:07,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066998723] [2022-04-27 14:56:07,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066998723] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:56:07,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:56:07,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 14:56:07,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539723131] [2022-04-27 14:56:07,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:56:07,877 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-27 14:56:07,877 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:56:07,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:56:07,893 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 14:56:07,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:56:07,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:56:07,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:56:07,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:56:07,895 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:56:08,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:08,023 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2022-04-27 14:56:08,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:56:08,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-27 14:56:08,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:56:08,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:56:08,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-27 14:56:08,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:56:08,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-27 14:56:08,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-27 14:56:08,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:56:08,069 INFO L225 Difference]: With dead ends: 48 [2022-04-27 14:56:08,069 INFO L226 Difference]: Without dead ends: 43 [2022-04-27 14:56:08,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 14:56:08,070 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:56:08,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 106 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:56:08,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-27 14:56:08,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-27 14:56:08,079 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:56:08,079 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:56:08,079 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:56:08,080 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:56:08,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:08,081 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-27 14:56:08,081 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-27 14:56:08,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:56:08,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:56:08,082 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 43 states. [2022-04-27 14:56:08,082 INFO L87 Difference]: Start difference. First operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 43 states. [2022-04-27 14:56:08,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:08,084 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-27 14:56:08,084 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-27 14:56:08,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:56:08,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:56:08,084 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:56:08,084 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:56:08,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:56:08,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-04-27 14:56:08,086 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 27 [2022-04-27 14:56:08,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:56:08,086 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-04-27 14:56:08,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:56:08,086 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-27 14:56:08,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 14:56:08,087 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:56:08,087 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:56:08,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 14:56:08,302 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,SelfDestructingSolverStorable3 [2022-04-27 14:56:08,302 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:56:08,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:56:08,303 INFO L85 PathProgramCache]: Analyzing trace with hash -2092280728, now seen corresponding path program 1 times [2022-04-27 14:56:08,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:56:08,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190454525] [2022-04-27 14:56:08,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:56:08,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:56:08,313 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:56:08,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1168585708] [2022-04-27 14:56:08,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:56:08,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:56:08,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:56:08,314 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:56:08,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 14:56:08,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:56:08,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 14:56:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:56:08,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:56:08,537 INFO L272 TraceCheckUtils]: 0: Hoare triple {1025#true} call ULTIMATE.init(); {1025#true} is VALID [2022-04-27 14:56:08,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {1025#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(11, 2);call #Ultimate.allocInit(12, 3); {1025#true} is VALID [2022-04-27 14:56:08,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-27 14:56:08,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1025#true} {1025#true} #69#return; {1025#true} is VALID [2022-04-27 14:56:08,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {1025#true} call #t~ret5 := main(); {1025#true} is VALID [2022-04-27 14:56:08,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {1025#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1025#true} is VALID [2022-04-27 14:56:08,538 INFO L272 TraceCheckUtils]: 6: Hoare triple {1025#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 5 then 1 else 0)); {1025#true} is VALID [2022-04-27 14:56:08,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-27 14:56:08,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-27 14:56:08,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-27 14:56:08,539 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1025#true} {1025#true} #55#return; {1025#true} is VALID [2022-04-27 14:56:08,540 INFO L290 TraceCheckUtils]: 11: Hoare triple {1025#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {1063#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-27 14:56:08,540 INFO L290 TraceCheckUtils]: 12: Hoare triple {1063#(and (= main_~a~0 0) (= main_~t~0 1))} assume !false; {1063#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-27 14:56:08,540 INFO L272 TraceCheckUtils]: 13: Hoare triple {1063#(and (= main_~a~0 0) (= main_~t~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1025#true} is VALID [2022-04-27 14:56:08,540 INFO L290 TraceCheckUtils]: 14: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-27 14:56:08,540 INFO L290 TraceCheckUtils]: 15: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-27 14:56:08,540 INFO L290 TraceCheckUtils]: 16: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-27 14:56:08,541 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1025#true} {1063#(and (= main_~a~0 0) (= main_~t~0 1))} #57#return; {1063#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-27 14:56:08,541 INFO L272 TraceCheckUtils]: 18: Hoare triple {1063#(and (= main_~a~0 0) (= main_~t~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1025#true} is VALID [2022-04-27 14:56:08,541 INFO L290 TraceCheckUtils]: 19: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-27 14:56:08,541 INFO L290 TraceCheckUtils]: 20: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-27 14:56:08,541 INFO L290 TraceCheckUtils]: 21: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-27 14:56:08,543 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1025#true} {1063#(and (= main_~a~0 0) (= main_~t~0 1))} #59#return; {1063#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-27 14:56:08,543 INFO L272 TraceCheckUtils]: 23: Hoare triple {1063#(and (= main_~a~0 0) (= main_~t~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1025#true} is VALID [2022-04-27 14:56:08,544 INFO L290 TraceCheckUtils]: 24: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-27 14:56:08,544 INFO L290 TraceCheckUtils]: 25: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-27 14:56:08,544 INFO L290 TraceCheckUtils]: 26: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-27 14:56:08,551 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1025#true} {1063#(and (= main_~a~0 0) (= main_~t~0 1))} #61#return; {1063#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-27 14:56:08,551 INFO L290 TraceCheckUtils]: 28: Hoare triple {1063#(and (= main_~a~0 0) (= main_~t~0 1))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1115#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-27 14:56:08,552 INFO L290 TraceCheckUtils]: 29: Hoare triple {1115#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} assume !false; {1115#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-27 14:56:08,552 INFO L272 TraceCheckUtils]: 30: Hoare triple {1115#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1122#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:56:08,553 INFO L290 TraceCheckUtils]: 31: Hoare triple {1122#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1126#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:56:08,553 INFO L290 TraceCheckUtils]: 32: Hoare triple {1126#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1026#false} is VALID [2022-04-27 14:56:08,553 INFO L290 TraceCheckUtils]: 33: Hoare triple {1026#false} assume !false; {1026#false} is VALID [2022-04-27 14:56:08,553 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 14:56:08,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:56:08,709 INFO L290 TraceCheckUtils]: 33: Hoare triple {1026#false} assume !false; {1026#false} is VALID [2022-04-27 14:56:08,710 INFO L290 TraceCheckUtils]: 32: Hoare triple {1126#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1026#false} is VALID [2022-04-27 14:56:08,710 INFO L290 TraceCheckUtils]: 31: Hoare triple {1122#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1126#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:56:08,711 INFO L272 TraceCheckUtils]: 30: Hoare triple {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1122#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:56:08,711 INFO L290 TraceCheckUtils]: 29: Hoare triple {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} assume !false; {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 14:56:08,712 INFO L290 TraceCheckUtils]: 28: Hoare triple {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 14:56:08,712 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1025#true} {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} #61#return; {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 14:56:08,712 INFO L290 TraceCheckUtils]: 26: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-27 14:56:08,712 INFO L290 TraceCheckUtils]: 25: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-27 14:56:08,712 INFO L290 TraceCheckUtils]: 24: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-27 14:56:08,713 INFO L272 TraceCheckUtils]: 23: Hoare triple {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1025#true} is VALID [2022-04-27 14:56:08,713 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1025#true} {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} #59#return; {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 14:56:08,713 INFO L290 TraceCheckUtils]: 21: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-27 14:56:08,713 INFO L290 TraceCheckUtils]: 20: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-27 14:56:08,713 INFO L290 TraceCheckUtils]: 19: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-27 14:56:08,713 INFO L272 TraceCheckUtils]: 18: Hoare triple {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1025#true} is VALID [2022-04-27 14:56:08,714 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1025#true} {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} #57#return; {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 14:56:08,714 INFO L290 TraceCheckUtils]: 16: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-27 14:56:08,714 INFO L290 TraceCheckUtils]: 15: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-27 14:56:08,714 INFO L290 TraceCheckUtils]: 14: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-27 14:56:08,714 INFO L272 TraceCheckUtils]: 13: Hoare triple {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1025#true} is VALID [2022-04-27 14:56:08,714 INFO L290 TraceCheckUtils]: 12: Hoare triple {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} assume !false; {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 14:56:08,715 INFO L290 TraceCheckUtils]: 11: Hoare triple {1025#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 14:56:08,715 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1025#true} {1025#true} #55#return; {1025#true} is VALID [2022-04-27 14:56:08,715 INFO L290 TraceCheckUtils]: 9: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-27 14:56:08,715 INFO L290 TraceCheckUtils]: 8: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-27 14:56:08,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-27 14:56:08,715 INFO L272 TraceCheckUtils]: 6: Hoare triple {1025#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 5 then 1 else 0)); {1025#true} is VALID [2022-04-27 14:56:08,715 INFO L290 TraceCheckUtils]: 5: Hoare triple {1025#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1025#true} is VALID [2022-04-27 14:56:08,715 INFO L272 TraceCheckUtils]: 4: Hoare triple {1025#true} call #t~ret5 := main(); {1025#true} is VALID [2022-04-27 14:56:08,715 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1025#true} {1025#true} #69#return; {1025#true} is VALID [2022-04-27 14:56:08,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-27 14:56:08,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {1025#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(11, 2);call #Ultimate.allocInit(12, 3); {1025#true} is VALID [2022-04-27 14:56:08,716 INFO L272 TraceCheckUtils]: 0: Hoare triple {1025#true} call ULTIMATE.init(); {1025#true} is VALID [2022-04-27 14:56:08,716 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-27 14:56:08,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:56:08,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190454525] [2022-04-27 14:56:08,716 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:56:08,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168585708] [2022-04-27 14:56:08,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168585708] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 14:56:08,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:56:08,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-27 14:56:08,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585217894] [2022-04-27 14:56:08,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:56:08,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-27 14:56:08,717 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:56:08,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:56:08,737 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:56:08,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:56:08,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:56:08,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:56:08,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 14:56:08,738 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:56:08,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:08,858 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-04-27 14:56:08,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:56:08,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-27 14:56:08,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:56:08,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:56:08,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-27 14:56:08,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:56:08,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-27 14:56:08,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-04-27 14:56:08,883 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:56:08,884 INFO L225 Difference]: With dead ends: 49 [2022-04-27 14:56:08,884 INFO L226 Difference]: Without dead ends: 47 [2022-04-27 14:56:08,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:56:08,885 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:56:08,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 79 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:56:08,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-27 14:56:08,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-27 14:56:08,894 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:56:08,894 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:56:08,895 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:56:08,895 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:56:08,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:08,896 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-27 14:56:08,896 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-27 14:56:08,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:56:08,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:56:08,897 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 47 states. [2022-04-27 14:56:08,897 INFO L87 Difference]: Start difference. First operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 47 states. [2022-04-27 14:56:08,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:08,898 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-27 14:56:08,898 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-27 14:56:08,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:56:08,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:56:08,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:56:08,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:56:08,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:56:08,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-04-27 14:56:08,900 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 34 [2022-04-27 14:56:08,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:56:08,900 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-04-27 14:56:08,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:56:08,901 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-27 14:56:08,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-27 14:56:08,902 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:56:08,902 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:56:08,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 14:56:09,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:56:09,119 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:56:09,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:56:09,119 INFO L85 PathProgramCache]: Analyzing trace with hash 398970980, now seen corresponding path program 2 times [2022-04-27 14:56:09,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:56:09,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810235024] [2022-04-27 14:56:09,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:56:09,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:56:09,129 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:56:09,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1269522248] [2022-04-27 14:56:09,129 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:56:09,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:56:09,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:56:09,130 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:56:09,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 14:56:09,168 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:56:09,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:56:09,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 14:56:09,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:56:09,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:56:09,308 INFO L272 TraceCheckUtils]: 0: Hoare triple {1471#true} call ULTIMATE.init(); {1471#true} is VALID [2022-04-27 14:56:09,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {1471#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(11, 2);call #Ultimate.allocInit(12, 3); {1471#true} is VALID [2022-04-27 14:56:09,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-27 14:56:09,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1471#true} {1471#true} #69#return; {1471#true} is VALID [2022-04-27 14:56:09,309 INFO L272 TraceCheckUtils]: 4: Hoare triple {1471#true} call #t~ret5 := main(); {1471#true} is VALID [2022-04-27 14:56:09,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {1471#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1471#true} is VALID [2022-04-27 14:56:09,309 INFO L272 TraceCheckUtils]: 6: Hoare triple {1471#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 5 then 1 else 0)); {1471#true} is VALID [2022-04-27 14:56:09,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-04-27 14:56:09,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {1471#true} assume !(0 == ~cond); {1471#true} is VALID [2022-04-27 14:56:09,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-27 14:56:09,309 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1471#true} {1471#true} #55#return; {1471#true} is VALID [2022-04-27 14:56:09,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {1471#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:56:09,310 INFO L290 TraceCheckUtils]: 12: Hoare triple {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} assume !false; {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:56:09,310 INFO L272 TraceCheckUtils]: 13: Hoare triple {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1471#true} is VALID [2022-04-27 14:56:09,310 INFO L290 TraceCheckUtils]: 14: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-04-27 14:56:09,310 INFO L290 TraceCheckUtils]: 15: Hoare triple {1471#true} assume !(0 == ~cond); {1471#true} is VALID [2022-04-27 14:56:09,310 INFO L290 TraceCheckUtils]: 16: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-27 14:56:09,311 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1471#true} {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #57#return; {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:56:09,311 INFO L272 TraceCheckUtils]: 18: Hoare triple {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1471#true} is VALID [2022-04-27 14:56:09,311 INFO L290 TraceCheckUtils]: 19: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-04-27 14:56:09,311 INFO L290 TraceCheckUtils]: 20: Hoare triple {1471#true} assume !(0 == ~cond); {1471#true} is VALID [2022-04-27 14:56:09,311 INFO L290 TraceCheckUtils]: 21: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-27 14:56:09,313 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1471#true} {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #59#return; {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:56:09,313 INFO L272 TraceCheckUtils]: 23: Hoare triple {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1471#true} is VALID [2022-04-27 14:56:09,314 INFO L290 TraceCheckUtils]: 24: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-04-27 14:56:09,314 INFO L290 TraceCheckUtils]: 25: Hoare triple {1471#true} assume !(0 == ~cond); {1471#true} is VALID [2022-04-27 14:56:09,314 INFO L290 TraceCheckUtils]: 26: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-27 14:56:09,314 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1471#true} {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #61#return; {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:56:09,315 INFO L290 TraceCheckUtils]: 28: Hoare triple {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1561#(and (= (+ main_~s~0 (- 3)) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-27 14:56:09,315 INFO L290 TraceCheckUtils]: 29: Hoare triple {1561#(and (= (+ main_~s~0 (- 3)) 1) (= (+ (- 1) main_~a~0) 0))} assume !false; {1561#(and (= (+ main_~s~0 (- 3)) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-27 14:56:09,315 INFO L272 TraceCheckUtils]: 30: Hoare triple {1561#(and (= (+ main_~s~0 (- 3)) 1) (= (+ (- 1) main_~a~0) 0))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1471#true} is VALID [2022-04-27 14:56:09,315 INFO L290 TraceCheckUtils]: 31: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-04-27 14:56:09,315 INFO L290 TraceCheckUtils]: 32: Hoare triple {1471#true} assume !(0 == ~cond); {1471#true} is VALID [2022-04-27 14:56:09,315 INFO L290 TraceCheckUtils]: 33: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-27 14:56:09,318 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1471#true} {1561#(and (= (+ main_~s~0 (- 3)) 1) (= (+ (- 1) main_~a~0) 0))} #57#return; {1561#(and (= (+ main_~s~0 (- 3)) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-27 14:56:09,318 INFO L272 TraceCheckUtils]: 35: Hoare triple {1561#(and (= (+ main_~s~0 (- 3)) 1) (= (+ (- 1) main_~a~0) 0))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1583#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:56:09,319 INFO L290 TraceCheckUtils]: 36: Hoare triple {1583#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1587#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:56:09,319 INFO L290 TraceCheckUtils]: 37: Hoare triple {1587#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1472#false} is VALID [2022-04-27 14:56:09,319 INFO L290 TraceCheckUtils]: 38: Hoare triple {1472#false} assume !false; {1472#false} is VALID [2022-04-27 14:56:09,319 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 14:56:09,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:56:09,443 INFO L290 TraceCheckUtils]: 38: Hoare triple {1472#false} assume !false; {1472#false} is VALID [2022-04-27 14:56:09,444 INFO L290 TraceCheckUtils]: 37: Hoare triple {1587#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1472#false} is VALID [2022-04-27 14:56:09,444 INFO L290 TraceCheckUtils]: 36: Hoare triple {1583#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1587#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:56:09,445 INFO L272 TraceCheckUtils]: 35: Hoare triple {1603#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1583#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:56:09,445 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1471#true} {1603#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} #57#return; {1603#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-27 14:56:09,445 INFO L290 TraceCheckUtils]: 33: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-27 14:56:09,446 INFO L290 TraceCheckUtils]: 32: Hoare triple {1471#true} assume !(0 == ~cond); {1471#true} is VALID [2022-04-27 14:56:09,446 INFO L290 TraceCheckUtils]: 31: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-04-27 14:56:09,446 INFO L272 TraceCheckUtils]: 30: Hoare triple {1603#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1471#true} is VALID [2022-04-27 14:56:09,446 INFO L290 TraceCheckUtils]: 29: Hoare triple {1603#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} assume !false; {1603#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-27 14:56:09,531 INFO L290 TraceCheckUtils]: 28: Hoare triple {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1603#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-27 14:56:09,532 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1471#true} {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #61#return; {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-27 14:56:09,532 INFO L290 TraceCheckUtils]: 26: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-27 14:56:09,532 INFO L290 TraceCheckUtils]: 25: Hoare triple {1471#true} assume !(0 == ~cond); {1471#true} is VALID [2022-04-27 14:56:09,532 INFO L290 TraceCheckUtils]: 24: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-04-27 14:56:09,532 INFO L272 TraceCheckUtils]: 23: Hoare triple {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1471#true} is VALID [2022-04-27 14:56:09,533 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1471#true} {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #59#return; {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-27 14:56:09,533 INFO L290 TraceCheckUtils]: 21: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-27 14:56:09,533 INFO L290 TraceCheckUtils]: 20: Hoare triple {1471#true} assume !(0 == ~cond); {1471#true} is VALID [2022-04-27 14:56:09,533 INFO L290 TraceCheckUtils]: 19: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-04-27 14:56:09,533 INFO L272 TraceCheckUtils]: 18: Hoare triple {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1471#true} is VALID [2022-04-27 14:56:09,547 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1471#true} {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #57#return; {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-27 14:56:09,548 INFO L290 TraceCheckUtils]: 16: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-27 14:56:09,548 INFO L290 TraceCheckUtils]: 15: Hoare triple {1471#true} assume !(0 == ~cond); {1471#true} is VALID [2022-04-27 14:56:09,548 INFO L290 TraceCheckUtils]: 14: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-04-27 14:56:09,548 INFO L272 TraceCheckUtils]: 13: Hoare triple {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1471#true} is VALID [2022-04-27 14:56:09,548 INFO L290 TraceCheckUtils]: 12: Hoare triple {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} assume !false; {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-27 14:56:09,549 INFO L290 TraceCheckUtils]: 11: Hoare triple {1471#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-27 14:56:09,549 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1471#true} {1471#true} #55#return; {1471#true} is VALID [2022-04-27 14:56:09,549 INFO L290 TraceCheckUtils]: 9: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-27 14:56:09,549 INFO L290 TraceCheckUtils]: 8: Hoare triple {1471#true} assume !(0 == ~cond); {1471#true} is VALID [2022-04-27 14:56:09,549 INFO L290 TraceCheckUtils]: 7: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-04-27 14:56:09,549 INFO L272 TraceCheckUtils]: 6: Hoare triple {1471#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 5 then 1 else 0)); {1471#true} is VALID [2022-04-27 14:56:09,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {1471#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1471#true} is VALID [2022-04-27 14:56:09,549 INFO L272 TraceCheckUtils]: 4: Hoare triple {1471#true} call #t~ret5 := main(); {1471#true} is VALID [2022-04-27 14:56:09,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1471#true} {1471#true} #69#return; {1471#true} is VALID [2022-04-27 14:56:09,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-27 14:56:09,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {1471#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(11, 2);call #Ultimate.allocInit(12, 3); {1471#true} is VALID [2022-04-27 14:56:09,549 INFO L272 TraceCheckUtils]: 0: Hoare triple {1471#true} call ULTIMATE.init(); {1471#true} is VALID [2022-04-27 14:56:09,550 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 14:56:09,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:56:09,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810235024] [2022-04-27 14:56:09,550 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:56:09,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269522248] [2022-04-27 14:56:09,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269522248] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:56:09,550 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:56:09,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-27 14:56:09,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605373944] [2022-04-27 14:56:09,550 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:56:09,551 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 39 [2022-04-27 14:56:09,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:56:09,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 14:56:09,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:56:09,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:56:09,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:56:09,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:56:09,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:56:09,576 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 14:56:09,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:09,966 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2022-04-27 14:56:09,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 14:56:09,966 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 39 [2022-04-27 14:56:09,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:56:09,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 14:56:09,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 53 transitions. [2022-04-27 14:56:09,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 14:56:09,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 53 transitions. [2022-04-27 14:56:09,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 53 transitions. [2022-04-27 14:56:10,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:56:10,024 INFO L225 Difference]: With dead ends: 55 [2022-04-27 14:56:10,024 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 14:56:10,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-04-27 14:56:10,027 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 9 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:56:10,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 98 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:56:10,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 14:56:10,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 14:56:10,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:56:10,028 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 14:56:10,028 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 14:56:10,028 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 14:56:10,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:10,029 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 14:56:10,029 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:56:10,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:56:10,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:56:10,029 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 14:56:10,029 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 14:56:10,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:10,029 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 14:56:10,029 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:56:10,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:56:10,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:56:10,029 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:56:10,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:56:10,029 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 14:56:10,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 14:56:10,029 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2022-04-27 14:56:10,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:56:10,029 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 14:56:10,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 14:56:10,030 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:56:10,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:56:10,043 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 14:56:10,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 14:56:10,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:56:10,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 14:56:10,423 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2022-04-27 14:56:10,423 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2022-04-27 14:56:10,423 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2022-04-27 14:56:10,424 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 8 10) the Hoare annotation is: true [2022-04-27 14:56:10,424 INFO L899 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2022-04-27 14:56:10,424 INFO L899 garLoopResultBuilder]: For program point L9-2(lines 8 10) no Hoare annotation was computed. [2022-04-27 14:56:10,424 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 8 10) no Hoare annotation was computed. [2022-04-27 14:56:10,424 INFO L899 garLoopResultBuilder]: For program point L33(lines 30 42) no Hoare annotation was computed. [2022-04-27 14:56:10,424 INFO L895 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: (and (= (+ main_~t~0 main_~s~0) (+ (* main_~a~0 4) 2 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) [2022-04-27 14:56:10,424 INFO L895 garLoopResultBuilder]: At program point L31-1(line 31) the Hoare annotation is: (and (= (+ main_~t~0 main_~s~0) (+ (* main_~a~0 4) 2 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) [2022-04-27 14:56:10,424 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 20 49) no Hoare annotation was computed. [2022-04-27 14:56:10,424 INFO L899 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2022-04-27 14:56:10,424 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 20 49) no Hoare annotation was computed. [2022-04-27 14:56:10,424 INFO L895 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: (and (= (+ main_~t~0 main_~s~0) (+ (* main_~a~0 4) 2 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) [2022-04-27 14:56:10,424 INFO L895 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: (and (= (+ main_~t~0 main_~s~0) (+ (* main_~a~0 4) 2 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) [2022-04-27 14:56:10,424 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 20 49) the Hoare annotation is: true [2022-04-27 14:56:10,424 INFO L895 garLoopResultBuilder]: At program point L30-2(lines 30 42) the Hoare annotation is: (and (= (+ main_~t~0 main_~s~0) (+ (* main_~a~0 4) 2 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) [2022-04-27 14:56:10,424 INFO L895 garLoopResultBuilder]: At program point L30-3(lines 30 42) the Hoare annotation is: (and (= (+ main_~t~0 main_~s~0) (+ (* main_~a~0 4) 2 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) [2022-04-27 14:56:10,424 INFO L902 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: true [2022-04-27 14:56:10,424 INFO L899 garLoopResultBuilder]: For program point L24-1(line 24) no Hoare annotation was computed. [2022-04-27 14:56:10,425 INFO L895 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (or (and (= (+ main_~t~0 main_~s~0) (+ (* main_~a~0 4) 2 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (and (= main_~t~0 1) (= main_~s~0 1))) [2022-04-27 14:56:10,425 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 14:56:10,425 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 14:56:10,425 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 14:56:10,425 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 14:56:10,425 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 14:56:10,425 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 14:56:10,425 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 14:56:10,425 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-27 14:56:10,425 INFO L899 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2022-04-27 14:56:10,425 INFO L899 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2022-04-27 14:56:10,425 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2022-04-27 14:56:10,425 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2022-04-27 14:56:10,425 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-04-27 14:56:10,427 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2022-04-27 14:56:10,428 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 14:56:10,431 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 14:56:10,431 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 14:56:10,433 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 14:56:10,433 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 14:56:10,433 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 14:56:10,433 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 14:56:10,433 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 14:56:10,433 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 14:56:10,433 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 14:56:10,433 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-27 14:56:10,433 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 14:56:10,433 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 14:56:10,433 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 14:56:10,433 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 14:56:10,433 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-27 14:56:10,433 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-27 14:56:10,433 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 14:56:10,433 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 14:56:10,433 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-27 14:56:10,433 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 14:56:10,434 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:56:10,434 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:56:10,434 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:56:10,434 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:56:10,434 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:56:10,434 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:56:10,434 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-27 14:56:10,434 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-27 14:56:10,434 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-27 14:56:10,434 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-27 14:56:10,435 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-27 14:56:10,435 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 14:56:10,435 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 14:56:10,435 INFO L163 areAnnotationChecker]: CFG has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 14:56:10,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 02:56:10 BoogieIcfgContainer [2022-04-27 14:56:10,440 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 14:56:10,441 INFO L158 Benchmark]: Toolchain (without parser) took 5057.75ms. Allocated memory was 212.9MB in the beginning and 255.9MB in the end (delta: 43.0MB). Free memory was 157.2MB in the beginning and 211.2MB in the end (delta: -54.0MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 14:56:10,441 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 212.9MB. Free memory is still 173.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 14:56:10,441 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.46ms. Allocated memory is still 212.9MB. Free memory was 157.1MB in the beginning and 185.4MB in the end (delta: -28.3MB). Peak memory consumption was 8.2MB. Max. memory is 8.0GB. [2022-04-27 14:56:10,442 INFO L158 Benchmark]: Boogie Preprocessor took 27.83ms. Allocated memory is still 212.9MB. Free memory was 185.4MB in the beginning and 184.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 14:56:10,442 INFO L158 Benchmark]: RCFGBuilder took 182.65ms. Allocated memory is still 212.9MB. Free memory was 184.0MB in the beginning and 173.2MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 14:56:10,442 INFO L158 Benchmark]: TraceAbstraction took 4611.95ms. Allocated memory was 212.9MB in the beginning and 255.9MB in the end (delta: 43.0MB). Free memory was 172.5MB in the beginning and 211.2MB in the end (delta: -38.7MB). Peak memory consumption was 5.0MB. Max. memory is 8.0GB. [2022-04-27 14:56:10,443 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.09ms. Allocated memory is still 212.9MB. Free memory is still 173.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 227.46ms. Allocated memory is still 212.9MB. Free memory was 157.1MB in the beginning and 185.4MB in the end (delta: -28.3MB). Peak memory consumption was 8.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.83ms. Allocated memory is still 212.9MB. Free memory was 185.4MB in the beginning and 184.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 182.65ms. Allocated memory is still 212.9MB. Free memory was 184.0MB in the beginning and 173.2MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 4611.95ms. Allocated memory was 212.9MB in the beginning and 255.9MB in the end (delta: 43.0MB). Free memory was 172.5MB in the beginning and 211.2MB in the end (delta: -38.7MB). Peak memory consumption was 5.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.5s, OverallIterations: 6, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 89 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 67 mSDsluCounter, 457 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 289 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 353 IncrementalHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 168 mSDtfsCounter, 353 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 217 GetRequests, 182 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=5, InterpolantAutomatonStates: 32, 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, 6 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 37 PreInvPairs, 58 NumberOfFragments, 161 HoareAnnotationTreeSize, 37 FomulaSimplifications, 4 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 14 FomulaSimplificationsInter, 476 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 221 ConstructedInterpolants, 0 QuantifiedInterpolants, 603 SizeOfPredicates, 5 NumberOfNonLiveVariables, 378 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 112/120 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: 30]: Loop Invariant Derived loop invariant: t + s == a * 4 + 2 + a * a && t == a * 2 + 1 RESULT: Ultimate proved your program to be correct! [2022-04-27 14:56:10,467 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...