/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_unwindbound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 17:54:21,610 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 17:54:21,619 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 17:54:21,665 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 17:54:21,665 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 17:54:21,666 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 17:54:21,667 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 17:54:21,668 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 17:54:21,669 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 17:54:21,670 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 17:54:21,671 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 17:54:21,671 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 17:54:21,672 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 17:54:21,672 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 17:54:21,673 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 17:54:21,674 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 17:54:21,674 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 17:54:21,675 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 17:54:21,676 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 17:54:21,677 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 17:54:21,679 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 17:54:21,682 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 17:54:21,682 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 17:54:21,683 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 17:54:21,684 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 17:54:21,685 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 17:54:21,686 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 17:54:21,686 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 17:54:21,686 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 17:54:21,687 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 17:54:21,687 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 17:54:21,687 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 17:54:21,688 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 17:54:21,688 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 17:54:21,689 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 17:54:21,689 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 17:54:21,690 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 17:54:21,690 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 17:54:21,690 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 17:54:21,691 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 17:54:21,691 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 17:54:21,697 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 17:54:21,698 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-14 17:54:21,719 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 17:54:21,719 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 17:54:21,719 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-14 17:54:21,720 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-14 17:54:21,720 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-14 17:54:21,720 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-14 17:54:21,721 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-14 17:54:21,721 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-14 17:54:21,721 INFO L138 SettingsManager]: * Use SBE=true [2022-04-14 17:54:21,721 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 17:54:21,721 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 17:54:21,721 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 17:54:21,721 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 17:54:21,721 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 17:54:21,721 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 17:54:21,721 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 17:54:21,721 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 17:54:21,721 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 17:54:21,722 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 17:54:21,722 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 17:54:21,722 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 17:54:21,722 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 17:54:21,722 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 17:54:21,722 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 17:54:21,722 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 17:54:21,722 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 17:54:21,722 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-14 17:54:21,722 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-14 17:54:21,722 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 17:54:21,723 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-14 17:54:21,723 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-14 17:54:21,723 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-14 17:54:21,723 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-14 17:54:21,723 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-14 17:54:21,927 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 17:54:21,946 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 17:54:21,948 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 17:54:21,948 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 17:54:21,949 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 17:54:21,950 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound100.c [2022-04-14 17:54:22,009 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff5b50653/a51353ddee45459dbc866869ec2e2a30/FLAG3c208fb7e [2022-04-14 17:54:22,348 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 17:54:22,349 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound100.c [2022-04-14 17:54:22,353 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff5b50653/a51353ddee45459dbc866869ec2e2a30/FLAG3c208fb7e [2022-04-14 17:54:22,778 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff5b50653/a51353ddee45459dbc866869ec2e2a30 [2022-04-14 17:54:22,780 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 17:54:22,781 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-14 17:54:22,784 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 17:54:22,784 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 17:54:22,786 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 17:54:22,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 05:54:22" (1/1) ... [2022-04-14 17:54:22,788 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d7a61c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:54:22, skipping insertion in model container [2022-04-14 17:54:22,788 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 05:54:22" (1/1) ... [2022-04-14 17:54:22,794 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 17:54:22,804 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 17:54:22,971 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_unwindbound100.c[520,533] [2022-04-14 17:54:22,997 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 17:54:23,005 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 17:54:23,017 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_unwindbound100.c[520,533] [2022-04-14 17:54:23,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 17:54:23,043 INFO L208 MainTranslator]: Completed translation [2022-04-14 17:54:23,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:54:23 WrapperNode [2022-04-14 17:54:23,044 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 17:54:23,045 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 17:54:23,045 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 17:54:23,045 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 17:54:23,052 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:54:23" (1/1) ... [2022-04-14 17:54:23,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:54:23" (1/1) ... [2022-04-14 17:54:23,057 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:54:23" (1/1) ... [2022-04-14 17:54:23,058 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:54:23" (1/1) ... [2022-04-14 17:54:23,069 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:54:23" (1/1) ... [2022-04-14 17:54:23,073 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:54:23" (1/1) ... [2022-04-14 17:54:23,074 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:54:23" (1/1) ... [2022-04-14 17:54:23,078 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 17:54:23,079 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 17:54:23,079 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 17:54:23,079 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 17:54:23,080 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:54:23" (1/1) ... [2022-04-14 17:54:23,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 17:54:23,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:54:23,103 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-14 17:54:23,112 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-14 17:54:23,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 17:54:23,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 17:54:23,129 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 17:54:23,129 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 17:54:23,129 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 17:54:23,129 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 17:54:23,129 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 17:54:23,129 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 17:54:23,130 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 17:54:23,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 17:54:23,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-14 17:54:23,130 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 17:54:23,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 17:54:23,130 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 17:54:23,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 17:54:23,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 17:54:23,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 17:54:23,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 17:54:23,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 17:54:23,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 17:54:23,171 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 17:54:23,172 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 17:54:23,286 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 17:54:23,291 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 17:54:23,291 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 17:54:23,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 05:54:23 BoogieIcfgContainer [2022-04-14 17:54:23,293 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 17:54:23,294 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 17:54:23,294 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 17:54:23,309 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 17:54:23,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 05:54:22" (1/3) ... [2022-04-14 17:54:23,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49ca9c81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 05:54:23, skipping insertion in model container [2022-04-14 17:54:23,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:54:23" (2/3) ... [2022-04-14 17:54:23,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49ca9c81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 05:54:23, skipping insertion in model container [2022-04-14 17:54:23,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 05:54:23" (3/3) ... [2022-04-14 17:54:23,311 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_unwindbound100.c [2022-04-14 17:54:23,315 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-14 17:54:23,315 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 17:54:23,377 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 17:54:23,386 INFO L340 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 [2022-04-14 17:54:23,386 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 17:54:23,404 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 17:54:23,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-14 17:54:23,408 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:54:23,408 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:54:23,409 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:54:23,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:54:23,416 INFO L85 PathProgramCache]: Analyzing trace with hash -643130361, now seen corresponding path program 1 times [2022-04-14 17:54:23,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:54:23,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705034106] [2022-04-14 17:54:23,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:54:23,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:54:23,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:54:23,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 17:54:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:54:23,589 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(and (= ~counter~0 |old(~counter~0)|) (= |#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);~counter~0 := 0; {29#true} is VALID [2022-04-14 17:54:23,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-14 17:54:23,589 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #66#return; {29#true} is VALID [2022-04-14 17:54:23,591 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 17:54:23,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(and (= ~counter~0 |old(~counter~0)|) (= |#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);~counter~0 := 0; {29#true} is VALID [2022-04-14 17:54:23,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-14 17:54:23,592 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #66#return; {29#true} is VALID [2022-04-14 17:54:23,592 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret6 := main(); {29#true} is VALID [2022-04-14 17:54:23,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#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;~a~0 := 0;~s~0 := 1;~t~0 := 1; {29#true} is VALID [2022-04-14 17:54:23,593 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#true} assume !true; {30#false} is VALID [2022-04-14 17:54:23,593 INFO L272 TraceCheckUtils]: 7: Hoare triple {30#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {30#false} is VALID [2022-04-14 17:54:23,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-04-14 17:54:23,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2022-04-14 17:54:23,593 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-04-14 17:54:23,594 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-14 17:54:23,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:54:23,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705034106] [2022-04-14 17:54:23,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705034106] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 17:54:23,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 17:54:23,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 17:54:23,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234972131] [2022-04-14 17:54:23,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 17:54:23,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-14 17:54:23,602 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:54:23,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 17:54:23,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:54:23,617 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 17:54:23,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:54:23,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 17:54:23,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 17:54:23,632 INFO L87 Difference]: Start difference. First operand has 26 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 17:54:23,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:54:23,742 INFO L93 Difference]: Finished difference Result 47 states and 70 transitions. [2022-04-14 17:54:23,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 17:54:23,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-14 17:54:23,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:54:23,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 17:54:23,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-14 17:54:23,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 17:54:23,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-14 17:54:23,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2022-04-14 17:54:23,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:54:23,849 INFO L225 Difference]: With dead ends: 47 [2022-04-14 17:54:23,849 INFO L226 Difference]: Without dead ends: 22 [2022-04-14 17:54:23,851 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-14 17:54:23,857 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 17:54:23,858 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 35 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 17:54:23,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-14 17:54:23,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-14 17:54:23,879 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:54:23,879 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 17:54:23,880 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 17:54:23,880 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 17:54:23,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:54:23,884 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-14 17:54:23,884 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-14 17:54:23,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:54:23,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:54:23,885 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 22 states. [2022-04-14 17:54:23,885 INFO L87 Difference]: Start difference. First operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 22 states. [2022-04-14 17:54:23,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:54:23,888 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-14 17:54:23,889 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-14 17:54:23,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:54:23,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:54:23,889 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:54:23,889 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:54:23,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 17:54:23,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-04-14 17:54:23,894 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 11 [2022-04-14 17:54:23,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:54:23,894 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-04-14 17:54:23,895 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 17:54:23,895 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-04-14 17:54:23,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-14 17:54:23,895 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:54:23,895 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:54:23,896 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 17:54:23,896 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:54:23,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:54:23,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1070997212, now seen corresponding path program 1 times [2022-04-14 17:54:23,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:54:23,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325504215] [2022-04-14 17:54:23,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:54:23,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:54:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:54:23,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 17:54:23,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:54:23,985 INFO L290 TraceCheckUtils]: 0: Hoare triple {189#(and (= ~counter~0 |old(~counter~0)|) (= |#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);~counter~0 := 0; {187#(= ~counter~0 0)} is VALID [2022-04-14 17:54:23,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {187#(= ~counter~0 0)} assume true; {187#(= ~counter~0 0)} is VALID [2022-04-14 17:54:23,986 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {187#(= ~counter~0 0)} {182#true} #66#return; {187#(= ~counter~0 0)} is VALID [2022-04-14 17:54:23,986 INFO L272 TraceCheckUtils]: 0: Hoare triple {182#true} call ULTIMATE.init(); {189#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 17:54:23,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {189#(and (= ~counter~0 |old(~counter~0)|) (= |#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);~counter~0 := 0; {187#(= ~counter~0 0)} is VALID [2022-04-14 17:54:23,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {187#(= ~counter~0 0)} assume true; {187#(= ~counter~0 0)} is VALID [2022-04-14 17:54:23,988 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {187#(= ~counter~0 0)} {182#true} #66#return; {187#(= ~counter~0 0)} is VALID [2022-04-14 17:54:23,988 INFO L272 TraceCheckUtils]: 4: Hoare triple {187#(= ~counter~0 0)} call #t~ret6 := main(); {187#(= ~counter~0 0)} is VALID [2022-04-14 17:54:23,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {187#(= ~counter~0 0)} 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;~a~0 := 0;~s~0 := 1;~t~0 := 1; {187#(= ~counter~0 0)} is VALID [2022-04-14 17:54:23,989 INFO L290 TraceCheckUtils]: 6: Hoare triple {187#(= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {188#(= |main_#t~post5| 0)} is VALID [2022-04-14 17:54:23,989 INFO L290 TraceCheckUtils]: 7: Hoare triple {188#(= |main_#t~post5| 0)} assume !(#t~post5 < 100);havoc #t~post5; {183#false} is VALID [2022-04-14 17:54:23,990 INFO L272 TraceCheckUtils]: 8: Hoare triple {183#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {183#false} is VALID [2022-04-14 17:54:23,990 INFO L290 TraceCheckUtils]: 9: Hoare triple {183#false} ~cond := #in~cond; {183#false} is VALID [2022-04-14 17:54:23,990 INFO L290 TraceCheckUtils]: 10: Hoare triple {183#false} assume 0 == ~cond; {183#false} is VALID [2022-04-14 17:54:23,990 INFO L290 TraceCheckUtils]: 11: Hoare triple {183#false} assume !false; {183#false} is VALID [2022-04-14 17:54:23,990 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-14 17:54:23,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:54:23,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325504215] [2022-04-14 17:54:23,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325504215] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 17:54:23,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 17:54:23,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 17:54:23,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602810489] [2022-04-14 17:54:23,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 17:54:23,992 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-14 17:54:23,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:54:23,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 17:54:24,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:54:24,002 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 17:54:24,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:54:24,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 17:54:24,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 17:54:24,003 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 17:54:24,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:54:24,169 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-14 17:54:24,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 17:54:24,170 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-14 17:54:24,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:54:24,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 17:54:24,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-14 17:54:24,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 17:54:24,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-14 17:54:24,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-14 17:54:24,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:54:24,223 INFO L225 Difference]: With dead ends: 32 [2022-04-14 17:54:24,224 INFO L226 Difference]: Without dead ends: 23 [2022-04-14 17:54:24,226 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-14 17:54:24,236 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 17:54:24,236 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 49 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 17:54:24,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-14 17:54:24,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-14 17:54:24,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:54:24,240 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 17:54:24,240 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 17:54:24,241 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 17:54:24,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:54:24,244 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-14 17:54:24,244 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-14 17:54:24,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:54:24,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:54:24,269 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 23 states. [2022-04-14 17:54:24,269 INFO L87 Difference]: Start difference. First operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 23 states. [2022-04-14 17:54:24,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:54:24,272 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-14 17:54:24,272 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-14 17:54:24,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:54:24,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:54:24,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:54:24,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:54:24,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 17:54:24,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2022-04-14 17:54:24,277 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 12 [2022-04-14 17:54:24,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:54:24,278 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-04-14 17:54:24,278 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 17:54:24,279 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-14 17:54:24,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-14 17:54:24,282 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:54:24,283 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:54:24,283 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-14 17:54:24,283 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:54:24,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:54:24,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1072665508, now seen corresponding path program 1 times [2022-04-14 17:54:24,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:54:24,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268331730] [2022-04-14 17:54:24,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:54:24,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:54:24,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:54:24,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 17:54:24,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:54:24,382 INFO L290 TraceCheckUtils]: 0: Hoare triple {333#(and (= ~counter~0 |old(~counter~0)|) (= |#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);~counter~0 := 0; {325#true} is VALID [2022-04-14 17:54:24,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {325#true} assume true; {325#true} is VALID [2022-04-14 17:54:24,383 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {325#true} {325#true} #66#return; {325#true} is VALID [2022-04-14 17:54:24,384 INFO L272 TraceCheckUtils]: 0: Hoare triple {325#true} call ULTIMATE.init(); {333#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 17:54:24,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {333#(and (= ~counter~0 |old(~counter~0)|) (= |#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);~counter~0 := 0; {325#true} is VALID [2022-04-14 17:54:24,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {325#true} assume true; {325#true} is VALID [2022-04-14 17:54:24,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {325#true} {325#true} #66#return; {325#true} is VALID [2022-04-14 17:54:24,385 INFO L272 TraceCheckUtils]: 4: Hoare triple {325#true} call #t~ret6 := main(); {325#true} is VALID [2022-04-14 17:54:24,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {325#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;~a~0 := 0;~s~0 := 1;~t~0 := 1; {330#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-14 17:54:24,386 INFO L290 TraceCheckUtils]: 6: Hoare triple {330#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {330#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-14 17:54:24,387 INFO L290 TraceCheckUtils]: 7: Hoare triple {330#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} assume !!(#t~post5 < 100);havoc #t~post5; {330#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-14 17:54:24,388 INFO L272 TraceCheckUtils]: 8: Hoare triple {330#(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)); {331#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:54:24,389 INFO L290 TraceCheckUtils]: 9: Hoare triple {331#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {332#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 17:54:24,390 INFO L290 TraceCheckUtils]: 10: Hoare triple {332#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {326#false} is VALID [2022-04-14 17:54:24,390 INFO L290 TraceCheckUtils]: 11: Hoare triple {326#false} assume !false; {326#false} is VALID [2022-04-14 17:54:24,391 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-14 17:54:24,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:54:24,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268331730] [2022-04-14 17:54:24,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268331730] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 17:54:24,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 17:54:24,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 17:54:24,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583434771] [2022-04-14 17:54:24,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 17:54:24,394 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-14 17:54:24,394 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:54:24,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 17:54:24,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:54:24,406 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 17:54:24,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:54:24,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 17:54:24,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-14 17:54:24,411 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 17:54:24,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:54:24,754 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-14 17:54:24,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-14 17:54:24,755 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-14 17:54:24,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:54:24,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 17:54:24,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-14 17:54:24,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 17:54:24,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-14 17:54:24,759 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-14 17:54:24,800 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:54:24,801 INFO L225 Difference]: With dead ends: 36 [2022-04-14 17:54:24,802 INFO L226 Difference]: Without dead ends: 34 [2022-04-14 17:54:24,802 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-14 17:54:24,803 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 17:54:24,803 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 53 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 17:54:24,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-14 17:54:24,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-04-14 17:54:24,808 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:54:24,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 17:54:24,808 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 17:54:24,808 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 17:54:24,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:54:24,810 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-14 17:54:24,810 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-14 17:54:24,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:54:24,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:54:24,811 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-04-14 17:54:24,812 INFO L87 Difference]: Start difference. First operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-04-14 17:54:24,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:54:24,814 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-14 17:54:24,814 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-14 17:54:24,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:54:24,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:54:24,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:54:24,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:54:24,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 17:54:24,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-14 17:54:24,816 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-04-14 17:54:24,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:54:24,816 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-14 17:54:24,816 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 17:54:24,816 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-14 17:54:24,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-14 17:54:24,817 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:54:24,817 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:54:24,817 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-14 17:54:24,817 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:54:24,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:54:24,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1640566567, now seen corresponding path program 1 times [2022-04-14 17:54:24,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:54:24,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417207417] [2022-04-14 17:54:24,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:54:24,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:54:24,829 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:54:24,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1528905917] [2022-04-14 17:54:24,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:54:24,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:54:24,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:54:24,840 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-14 17:54:24,863 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-14 17:54:24,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:54:24,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 17:54:24,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:54:24,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:54:25,060 INFO L272 TraceCheckUtils]: 0: Hoare triple {518#true} call ULTIMATE.init(); {518#true} is VALID [2022-04-14 17:54:25,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {518#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);~counter~0 := 0; {518#true} is VALID [2022-04-14 17:54:25,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {518#true} assume true; {518#true} is VALID [2022-04-14 17:54:25,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {518#true} {518#true} #66#return; {518#true} is VALID [2022-04-14 17:54:25,061 INFO L272 TraceCheckUtils]: 4: Hoare triple {518#true} call #t~ret6 := main(); {518#true} is VALID [2022-04-14 17:54:25,062 INFO L290 TraceCheckUtils]: 5: Hoare triple {518#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;~a~0 := 0;~s~0 := 1;~t~0 := 1; {538#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-14 17:54:25,074 INFO L290 TraceCheckUtils]: 6: Hoare triple {538#(and (= main_~a~0 0) (= main_~s~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {538#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-14 17:54:25,075 INFO L290 TraceCheckUtils]: 7: Hoare triple {538#(and (= main_~a~0 0) (= main_~s~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {538#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-14 17:54:25,075 INFO L272 TraceCheckUtils]: 8: Hoare triple {538#(and (= main_~a~0 0) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {518#true} is VALID [2022-04-14 17:54:25,075 INFO L290 TraceCheckUtils]: 9: Hoare triple {518#true} ~cond := #in~cond; {518#true} is VALID [2022-04-14 17:54:25,076 INFO L290 TraceCheckUtils]: 10: Hoare triple {518#true} assume !(0 == ~cond); {518#true} is VALID [2022-04-14 17:54:25,076 INFO L290 TraceCheckUtils]: 11: Hoare triple {518#true} assume true; {518#true} is VALID [2022-04-14 17:54:25,077 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {518#true} {538#(and (= main_~a~0 0) (= main_~s~0 1))} #54#return; {538#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-14 17:54:25,078 INFO L272 TraceCheckUtils]: 13: Hoare triple {538#(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)); {563#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:54:25,079 INFO L290 TraceCheckUtils]: 14: Hoare triple {563#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {567#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:54:25,080 INFO L290 TraceCheckUtils]: 15: Hoare triple {567#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {519#false} is VALID [2022-04-14 17:54:25,080 INFO L290 TraceCheckUtils]: 16: Hoare triple {519#false} assume !false; {519#false} is VALID [2022-04-14 17:54:25,081 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-14 17:54:25,081 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 17:54:25,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:54:25,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417207417] [2022-04-14 17:54:25,082 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:54:25,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528905917] [2022-04-14 17:54:25,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528905917] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 17:54:25,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 17:54:25,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 17:54:25,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036124507] [2022-04-14 17:54:25,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 17:54:25,083 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-14 17:54:25,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:54:25,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 17:54:25,096 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-14 17:54:25,096 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 17:54:25,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:54:25,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 17:54:25,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 17:54:25,099 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 17:54:25,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:54:25,232 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-14 17:54:25,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 17:54:25,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-14 17:54:25,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:54:25,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 17:54:25,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-14 17:54:25,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 17:54:25,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-14 17:54:25,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-14 17:54:25,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:54:25,275 INFO L225 Difference]: With dead ends: 40 [2022-04-14 17:54:25,275 INFO L226 Difference]: Without dead ends: 38 [2022-04-14 17:54:25,276 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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-14 17:54:25,281 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 17:54:25,282 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 88 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 17:54:25,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-14 17:54:25,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-04-14 17:54:25,307 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:54:25,307 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 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-14 17:54:25,308 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 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-14 17:54:25,308 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 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-14 17:54:25,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:54:25,310 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-14 17:54:25,310 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-14 17:54:25,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:54:25,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:54:25,310 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 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-14 17:54:25,311 INFO L87 Difference]: Start difference. First operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 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-14 17:54:25,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:54:25,312 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-14 17:54:25,312 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-14 17:54:25,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:54:25,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:54:25,313 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:54:25,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:54:25,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 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-14 17:54:25,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2022-04-14 17:54:25,314 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 17 [2022-04-14 17:54:25,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:54:25,315 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2022-04-14 17:54:25,315 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 17:54:25,315 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-14 17:54:25,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-14 17:54:25,315 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:54:25,315 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:54:25,339 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-14 17:54:25,537 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:54:25,538 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:54:25,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:54:25,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1129080132, now seen corresponding path program 1 times [2022-04-14 17:54:25,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:54:25,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488564367] [2022-04-14 17:54:25,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:54:25,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:54:25,550 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:54:25,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [217866939] [2022-04-14 17:54:25,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:54:25,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:54:25,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:54:25,557 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-14 17:54:25,558 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-14 17:54:25,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:54:25,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 17:54:25,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:54:25,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:54:25,713 INFO L272 TraceCheckUtils]: 0: Hoare triple {769#true} call ULTIMATE.init(); {769#true} is VALID [2022-04-14 17:54:25,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {769#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);~counter~0 := 0; {769#true} is VALID [2022-04-14 17:54:25,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {769#true} assume true; {769#true} is VALID [2022-04-14 17:54:25,714 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {769#true} {769#true} #66#return; {769#true} is VALID [2022-04-14 17:54:25,714 INFO L272 TraceCheckUtils]: 4: Hoare triple {769#true} call #t~ret6 := main(); {769#true} is VALID [2022-04-14 17:54:25,715 INFO L290 TraceCheckUtils]: 5: Hoare triple {769#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;~a~0 := 0;~s~0 := 1;~t~0 := 1; {789#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-14 17:54:25,715 INFO L290 TraceCheckUtils]: 6: Hoare triple {789#(and (= main_~t~0 1) (= main_~s~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {789#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-14 17:54:25,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {789#(and (= main_~t~0 1) (= main_~s~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {789#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-14 17:54:25,716 INFO L272 TraceCheckUtils]: 8: Hoare triple {789#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {769#true} is VALID [2022-04-14 17:54:25,716 INFO L290 TraceCheckUtils]: 9: Hoare triple {769#true} ~cond := #in~cond; {769#true} is VALID [2022-04-14 17:54:25,716 INFO L290 TraceCheckUtils]: 10: Hoare triple {769#true} assume !(0 == ~cond); {769#true} is VALID [2022-04-14 17:54:25,716 INFO L290 TraceCheckUtils]: 11: Hoare triple {769#true} assume true; {769#true} is VALID [2022-04-14 17:54:25,716 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {769#true} {789#(and (= main_~t~0 1) (= main_~s~0 1))} #54#return; {789#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-14 17:54:25,717 INFO L272 TraceCheckUtils]: 13: Hoare triple {789#(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)); {769#true} is VALID [2022-04-14 17:54:25,717 INFO L290 TraceCheckUtils]: 14: Hoare triple {769#true} ~cond := #in~cond; {769#true} is VALID [2022-04-14 17:54:25,717 INFO L290 TraceCheckUtils]: 15: Hoare triple {769#true} assume !(0 == ~cond); {769#true} is VALID [2022-04-14 17:54:25,717 INFO L290 TraceCheckUtils]: 16: Hoare triple {769#true} assume true; {769#true} is VALID [2022-04-14 17:54:25,718 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {769#true} {789#(and (= main_~t~0 1) (= main_~s~0 1))} #56#return; {789#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-14 17:54:25,718 INFO L272 TraceCheckUtils]: 18: Hoare triple {789#(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)); {829#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:54:25,719 INFO L290 TraceCheckUtils]: 19: Hoare triple {829#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {833#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:54:25,719 INFO L290 TraceCheckUtils]: 20: Hoare triple {833#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {770#false} is VALID [2022-04-14 17:54:25,719 INFO L290 TraceCheckUtils]: 21: Hoare triple {770#false} assume !false; {770#false} is VALID [2022-04-14 17:54:25,719 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-14 17:54:25,719 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 17:54:25,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:54:25,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488564367] [2022-04-14 17:54:25,720 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:54:25,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217866939] [2022-04-14 17:54:25,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217866939] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 17:54:25,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 17:54:25,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 17:54:25,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985552607] [2022-04-14 17:54:25,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 17:54:25,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-14 17:54:25,721 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:54:25,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 17:54:25,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:54:25,735 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 17:54:25,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:54:25,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 17:54:25,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 17:54:25,737 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 17:54:25,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:54:25,871 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-14 17:54:25,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 17:54:25,871 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-14 17:54:25,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:54:25,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 17:54:25,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-14 17:54:25,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 17:54:25,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-14 17:54:25,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-14 17:54:25,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:54:25,923 INFO L225 Difference]: With dead ends: 44 [2022-04-14 17:54:25,923 INFO L226 Difference]: Without dead ends: 39 [2022-04-14 17:54:25,923 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-14 17:54:25,924 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 17:54:25,924 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 95 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 17:54:25,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-14 17:54:25,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-14 17:54:25,928 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:54:25,929 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-14 17:54:25,929 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-14 17:54:25,929 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-14 17:54:25,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:54:25,931 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-14 17:54:25,931 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-14 17:54:25,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:54:25,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:54:25,931 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 39 states. [2022-04-14 17:54:25,931 INFO L87 Difference]: Start difference. First operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 39 states. [2022-04-14 17:54:25,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:54:25,933 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-14 17:54:25,933 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-14 17:54:25,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:54:25,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:54:25,933 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:54:25,933 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:54:25,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-14 17:54:25,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2022-04-14 17:54:25,935 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 22 [2022-04-14 17:54:25,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:54:25,935 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-04-14 17:54:25,935 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 17:54:25,935 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-14 17:54:25,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-14 17:54:25,936 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:54:25,936 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:54:25,959 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-14 17:54:26,151 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:54:26,152 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:54:26,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:54:26,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1326533350, now seen corresponding path program 1 times [2022-04-14 17:54:26,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:54:26,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332336057] [2022-04-14 17:54:26,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:54:26,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:54:26,165 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:54:26,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1406536356] [2022-04-14 17:54:26,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:54:26,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:54:26,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:54:26,167 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-14 17:54:26,168 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-14 17:54:26,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:54:26,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 17:54:26,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:54:26,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:54:26,406 INFO L272 TraceCheckUtils]: 0: Hoare triple {1043#true} call ULTIMATE.init(); {1043#true} is VALID [2022-04-14 17:54:26,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {1043#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);~counter~0 := 0; {1051#(<= ~counter~0 0)} is VALID [2022-04-14 17:54:26,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {1051#(<= ~counter~0 0)} assume true; {1051#(<= ~counter~0 0)} is VALID [2022-04-14 17:54:26,407 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1051#(<= ~counter~0 0)} {1043#true} #66#return; {1051#(<= ~counter~0 0)} is VALID [2022-04-14 17:54:26,408 INFO L272 TraceCheckUtils]: 4: Hoare triple {1051#(<= ~counter~0 0)} call #t~ret6 := main(); {1051#(<= ~counter~0 0)} is VALID [2022-04-14 17:54:26,408 INFO L290 TraceCheckUtils]: 5: Hoare triple {1051#(<= ~counter~0 0)} 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;~a~0 := 0;~s~0 := 1;~t~0 := 1; {1051#(<= ~counter~0 0)} is VALID [2022-04-14 17:54:26,408 INFO L290 TraceCheckUtils]: 6: Hoare triple {1051#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1067#(<= ~counter~0 1)} is VALID [2022-04-14 17:54:26,409 INFO L290 TraceCheckUtils]: 7: Hoare triple {1067#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {1067#(<= ~counter~0 1)} is VALID [2022-04-14 17:54:26,409 INFO L272 TraceCheckUtils]: 8: Hoare triple {1067#(<= ~counter~0 1)} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1067#(<= ~counter~0 1)} is VALID [2022-04-14 17:54:26,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {1067#(<= ~counter~0 1)} ~cond := #in~cond; {1067#(<= ~counter~0 1)} is VALID [2022-04-14 17:54:26,410 INFO L290 TraceCheckUtils]: 10: Hoare triple {1067#(<= ~counter~0 1)} assume !(0 == ~cond); {1067#(<= ~counter~0 1)} is VALID [2022-04-14 17:54:26,410 INFO L290 TraceCheckUtils]: 11: Hoare triple {1067#(<= ~counter~0 1)} assume true; {1067#(<= ~counter~0 1)} is VALID [2022-04-14 17:54:26,411 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1067#(<= ~counter~0 1)} {1067#(<= ~counter~0 1)} #54#return; {1067#(<= ~counter~0 1)} is VALID [2022-04-14 17:54:26,411 INFO L272 TraceCheckUtils]: 13: Hoare triple {1067#(<= ~counter~0 1)} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1067#(<= ~counter~0 1)} is VALID [2022-04-14 17:54:26,411 INFO L290 TraceCheckUtils]: 14: Hoare triple {1067#(<= ~counter~0 1)} ~cond := #in~cond; {1067#(<= ~counter~0 1)} is VALID [2022-04-14 17:54:26,412 INFO L290 TraceCheckUtils]: 15: Hoare triple {1067#(<= ~counter~0 1)} assume !(0 == ~cond); {1067#(<= ~counter~0 1)} is VALID [2022-04-14 17:54:26,412 INFO L290 TraceCheckUtils]: 16: Hoare triple {1067#(<= ~counter~0 1)} assume true; {1067#(<= ~counter~0 1)} is VALID [2022-04-14 17:54:26,412 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1067#(<= ~counter~0 1)} {1067#(<= ~counter~0 1)} #56#return; {1067#(<= ~counter~0 1)} is VALID [2022-04-14 17:54:26,413 INFO L272 TraceCheckUtils]: 18: Hoare triple {1067#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1067#(<= ~counter~0 1)} is VALID [2022-04-14 17:54:26,413 INFO L290 TraceCheckUtils]: 19: Hoare triple {1067#(<= ~counter~0 1)} ~cond := #in~cond; {1067#(<= ~counter~0 1)} is VALID [2022-04-14 17:54:26,413 INFO L290 TraceCheckUtils]: 20: Hoare triple {1067#(<= ~counter~0 1)} assume !(0 == ~cond); {1067#(<= ~counter~0 1)} is VALID [2022-04-14 17:54:26,413 INFO L290 TraceCheckUtils]: 21: Hoare triple {1067#(<= ~counter~0 1)} assume true; {1067#(<= ~counter~0 1)} is VALID [2022-04-14 17:54:26,414 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1067#(<= ~counter~0 1)} {1067#(<= ~counter~0 1)} #58#return; {1067#(<= ~counter~0 1)} is VALID [2022-04-14 17:54:26,414 INFO L290 TraceCheckUtils]: 23: Hoare triple {1067#(<= ~counter~0 1)} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1067#(<= ~counter~0 1)} is VALID [2022-04-14 17:54:26,415 INFO L290 TraceCheckUtils]: 24: Hoare triple {1067#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1122#(<= |main_#t~post5| 1)} is VALID [2022-04-14 17:54:26,415 INFO L290 TraceCheckUtils]: 25: Hoare triple {1122#(<= |main_#t~post5| 1)} assume !(#t~post5 < 100);havoc #t~post5; {1044#false} is VALID [2022-04-14 17:54:26,415 INFO L272 TraceCheckUtils]: 26: Hoare triple {1044#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1044#false} is VALID [2022-04-14 17:54:26,415 INFO L290 TraceCheckUtils]: 27: Hoare triple {1044#false} ~cond := #in~cond; {1044#false} is VALID [2022-04-14 17:54:26,415 INFO L290 TraceCheckUtils]: 28: Hoare triple {1044#false} assume 0 == ~cond; {1044#false} is VALID [2022-04-14 17:54:26,415 INFO L290 TraceCheckUtils]: 29: Hoare triple {1044#false} assume !false; {1044#false} is VALID [2022-04-14 17:54:26,416 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-14 17:54:26,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 17:54:26,567 INFO L290 TraceCheckUtils]: 29: Hoare triple {1044#false} assume !false; {1044#false} is VALID [2022-04-14 17:54:26,567 INFO L290 TraceCheckUtils]: 28: Hoare triple {1044#false} assume 0 == ~cond; {1044#false} is VALID [2022-04-14 17:54:26,567 INFO L290 TraceCheckUtils]: 27: Hoare triple {1044#false} ~cond := #in~cond; {1044#false} is VALID [2022-04-14 17:54:26,567 INFO L272 TraceCheckUtils]: 26: Hoare triple {1044#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1044#false} is VALID [2022-04-14 17:54:26,568 INFO L290 TraceCheckUtils]: 25: Hoare triple {1150#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {1044#false} is VALID [2022-04-14 17:54:26,568 INFO L290 TraceCheckUtils]: 24: Hoare triple {1154#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1150#(< |main_#t~post5| 100)} is VALID [2022-04-14 17:54:26,569 INFO L290 TraceCheckUtils]: 23: Hoare triple {1154#(< ~counter~0 100)} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1154#(< ~counter~0 100)} is VALID [2022-04-14 17:54:26,569 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1043#true} {1154#(< ~counter~0 100)} #58#return; {1154#(< ~counter~0 100)} is VALID [2022-04-14 17:54:26,569 INFO L290 TraceCheckUtils]: 21: Hoare triple {1043#true} assume true; {1043#true} is VALID [2022-04-14 17:54:26,569 INFO L290 TraceCheckUtils]: 20: Hoare triple {1043#true} assume !(0 == ~cond); {1043#true} is VALID [2022-04-14 17:54:26,570 INFO L290 TraceCheckUtils]: 19: Hoare triple {1043#true} ~cond := #in~cond; {1043#true} is VALID [2022-04-14 17:54:26,570 INFO L272 TraceCheckUtils]: 18: Hoare triple {1154#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1043#true} is VALID [2022-04-14 17:54:26,572 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1043#true} {1154#(< ~counter~0 100)} #56#return; {1154#(< ~counter~0 100)} is VALID [2022-04-14 17:54:26,572 INFO L290 TraceCheckUtils]: 16: Hoare triple {1043#true} assume true; {1043#true} is VALID [2022-04-14 17:54:26,572 INFO L290 TraceCheckUtils]: 15: Hoare triple {1043#true} assume !(0 == ~cond); {1043#true} is VALID [2022-04-14 17:54:26,572 INFO L290 TraceCheckUtils]: 14: Hoare triple {1043#true} ~cond := #in~cond; {1043#true} is VALID [2022-04-14 17:54:26,572 INFO L272 TraceCheckUtils]: 13: Hoare triple {1154#(< ~counter~0 100)} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1043#true} is VALID [2022-04-14 17:54:26,584 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1043#true} {1154#(< ~counter~0 100)} #54#return; {1154#(< ~counter~0 100)} is VALID [2022-04-14 17:54:26,584 INFO L290 TraceCheckUtils]: 11: Hoare triple {1043#true} assume true; {1043#true} is VALID [2022-04-14 17:54:26,584 INFO L290 TraceCheckUtils]: 10: Hoare triple {1043#true} assume !(0 == ~cond); {1043#true} is VALID [2022-04-14 17:54:26,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {1043#true} ~cond := #in~cond; {1043#true} is VALID [2022-04-14 17:54:26,584 INFO L272 TraceCheckUtils]: 8: Hoare triple {1154#(< ~counter~0 100)} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1043#true} is VALID [2022-04-14 17:54:26,585 INFO L290 TraceCheckUtils]: 7: Hoare triple {1154#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {1154#(< ~counter~0 100)} is VALID [2022-04-14 17:54:26,585 INFO L290 TraceCheckUtils]: 6: Hoare triple {1209#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1154#(< ~counter~0 100)} is VALID [2022-04-14 17:54:26,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {1209#(< ~counter~0 99)} 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;~a~0 := 0;~s~0 := 1;~t~0 := 1; {1209#(< ~counter~0 99)} is VALID [2022-04-14 17:54:26,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {1209#(< ~counter~0 99)} call #t~ret6 := main(); {1209#(< ~counter~0 99)} is VALID [2022-04-14 17:54:26,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1209#(< ~counter~0 99)} {1043#true} #66#return; {1209#(< ~counter~0 99)} is VALID [2022-04-14 17:54:26,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {1209#(< ~counter~0 99)} assume true; {1209#(< ~counter~0 99)} is VALID [2022-04-14 17:54:26,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {1043#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);~counter~0 := 0; {1209#(< ~counter~0 99)} is VALID [2022-04-14 17:54:26,587 INFO L272 TraceCheckUtils]: 0: Hoare triple {1043#true} call ULTIMATE.init(); {1043#true} is VALID [2022-04-14 17:54:26,587 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-14 17:54:26,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:54:26,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332336057] [2022-04-14 17:54:26,588 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:54:26,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406536356] [2022-04-14 17:54:26,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406536356] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 17:54:26,588 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 17:54:26,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-14 17:54:26,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425557422] [2022-04-14 17:54:26,588 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 17:54:26,589 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 30 [2022-04-14 17:54:26,589 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:54:26,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-14 17:54:26,615 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-14 17:54:26,615 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 17:54:26,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:54:26,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 17:54:26,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-14 17:54:26,616 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-14 17:54:26,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:54:26,910 INFO L93 Difference]: Finished difference Result 80 states and 100 transitions. [2022-04-14 17:54:26,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-14 17:54:26,911 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 30 [2022-04-14 17:54:26,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:54:26,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-14 17:54:26,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 94 transitions. [2022-04-14 17:54:26,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-14 17:54:26,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 94 transitions. [2022-04-14 17:54:26,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 94 transitions. [2022-04-14 17:54:26,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:54:26,986 INFO L225 Difference]: With dead ends: 80 [2022-04-14 17:54:26,986 INFO L226 Difference]: Without dead ends: 71 [2022-04-14 17:54:26,986 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-14 17:54:26,987 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 40 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 17:54:26,987 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 167 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 17:54:26,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-14 17:54:27,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2022-04-14 17:54:27,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:54:27,014 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 67 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-14 17:54:27,014 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 67 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-14 17:54:27,016 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 67 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-14 17:54:27,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:54:27,019 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2022-04-14 17:54:27,019 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 87 transitions. [2022-04-14 17:54:27,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:54:27,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:54:27,020 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 71 states. [2022-04-14 17:54:27,020 INFO L87 Difference]: Start difference. First operand has 67 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 71 states. [2022-04-14 17:54:27,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:54:27,023 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2022-04-14 17:54:27,023 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 87 transitions. [2022-04-14 17:54:27,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:54:27,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:54:27,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:54:27,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:54:27,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-14 17:54:27,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2022-04-14 17:54:27,028 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 30 [2022-04-14 17:54:27,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:54:27,028 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions. [2022-04-14 17:54:27,028 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-14 17:54:27,028 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2022-04-14 17:54:27,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-14 17:54:27,028 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:54:27,029 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:54:27,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-14 17:54:27,231 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:54:27,231 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:54:27,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:54:27,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1324865054, now seen corresponding path program 1 times [2022-04-14 17:54:27,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:54:27,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000467637] [2022-04-14 17:54:27,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:54:27,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:54:27,242 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:54:27,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1476853407] [2022-04-14 17:54:27,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:54:27,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:54:27,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:54:27,248 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-14 17:54:27,263 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-14 17:54:27,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:54:27,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-14 17:54:27,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:54:27,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:54:27,469 INFO L272 TraceCheckUtils]: 0: Hoare triple {1601#true} call ULTIMATE.init(); {1601#true} is VALID [2022-04-14 17:54:27,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {1601#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);~counter~0 := 0; {1601#true} is VALID [2022-04-14 17:54:27,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {1601#true} assume true; {1601#true} is VALID [2022-04-14 17:54:27,470 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1601#true} {1601#true} #66#return; {1601#true} is VALID [2022-04-14 17:54:27,470 INFO L272 TraceCheckUtils]: 4: Hoare triple {1601#true} call #t~ret6 := main(); {1601#true} is VALID [2022-04-14 17:54:27,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {1601#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;~a~0 := 0;~s~0 := 1;~t~0 := 1; {1621#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-14 17:54:27,471 INFO L290 TraceCheckUtils]: 6: Hoare triple {1621#(and (= main_~a~0 0) (= main_~t~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1621#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-14 17:54:27,471 INFO L290 TraceCheckUtils]: 7: Hoare triple {1621#(and (= main_~a~0 0) (= main_~t~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {1621#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-14 17:54:27,471 INFO L272 TraceCheckUtils]: 8: Hoare triple {1621#(and (= main_~a~0 0) (= main_~t~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1601#true} is VALID [2022-04-14 17:54:27,471 INFO L290 TraceCheckUtils]: 9: Hoare triple {1601#true} ~cond := #in~cond; {1601#true} is VALID [2022-04-14 17:54:27,471 INFO L290 TraceCheckUtils]: 10: Hoare triple {1601#true} assume !(0 == ~cond); {1601#true} is VALID [2022-04-14 17:54:27,471 INFO L290 TraceCheckUtils]: 11: Hoare triple {1601#true} assume true; {1601#true} is VALID [2022-04-14 17:54:27,472 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1601#true} {1621#(and (= main_~a~0 0) (= main_~t~0 1))} #54#return; {1621#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-14 17:54:27,472 INFO L272 TraceCheckUtils]: 13: Hoare triple {1621#(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)); {1601#true} is VALID [2022-04-14 17:54:27,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {1601#true} ~cond := #in~cond; {1601#true} is VALID [2022-04-14 17:54:27,472 INFO L290 TraceCheckUtils]: 15: Hoare triple {1601#true} assume !(0 == ~cond); {1601#true} is VALID [2022-04-14 17:54:27,472 INFO L290 TraceCheckUtils]: 16: Hoare triple {1601#true} assume true; {1601#true} is VALID [2022-04-14 17:54:27,473 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1601#true} {1621#(and (= main_~a~0 0) (= main_~t~0 1))} #56#return; {1621#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-14 17:54:27,473 INFO L272 TraceCheckUtils]: 18: Hoare triple {1621#(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)); {1601#true} is VALID [2022-04-14 17:54:27,473 INFO L290 TraceCheckUtils]: 19: Hoare triple {1601#true} ~cond := #in~cond; {1601#true} is VALID [2022-04-14 17:54:27,473 INFO L290 TraceCheckUtils]: 20: Hoare triple {1601#true} assume !(0 == ~cond); {1601#true} is VALID [2022-04-14 17:54:27,473 INFO L290 TraceCheckUtils]: 21: Hoare triple {1601#true} assume true; {1601#true} is VALID [2022-04-14 17:54:27,474 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1601#true} {1621#(and (= main_~a~0 0) (= main_~t~0 1))} #58#return; {1621#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-14 17:54:27,474 INFO L290 TraceCheckUtils]: 23: Hoare triple {1621#(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; {1676#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-14 17:54:27,475 INFO L290 TraceCheckUtils]: 24: Hoare triple {1676#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1676#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-14 17:54:27,475 INFO L290 TraceCheckUtils]: 25: Hoare triple {1676#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} assume !!(#t~post5 < 100);havoc #t~post5; {1676#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-14 17:54:27,476 INFO L272 TraceCheckUtils]: 26: Hoare triple {1676#(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)); {1686#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:54:27,476 INFO L290 TraceCheckUtils]: 27: Hoare triple {1686#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1690#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:54:27,476 INFO L290 TraceCheckUtils]: 28: Hoare triple {1690#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1602#false} is VALID [2022-04-14 17:54:27,476 INFO L290 TraceCheckUtils]: 29: Hoare triple {1602#false} assume !false; {1602#false} is VALID [2022-04-14 17:54:27,477 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-14 17:54:27,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 17:54:27,623 INFO L290 TraceCheckUtils]: 29: Hoare triple {1602#false} assume !false; {1602#false} is VALID [2022-04-14 17:54:27,624 INFO L290 TraceCheckUtils]: 28: Hoare triple {1690#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1602#false} is VALID [2022-04-14 17:54:27,624 INFO L290 TraceCheckUtils]: 27: Hoare triple {1686#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1690#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:54:27,625 INFO L272 TraceCheckUtils]: 26: Hoare triple {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1686#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:54:27,626 INFO L290 TraceCheckUtils]: 25: Hoare triple {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} assume !!(#t~post5 < 100);havoc #t~post5; {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-14 17:54:27,627 INFO L290 TraceCheckUtils]: 24: Hoare triple {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-14 17:54:27,627 INFO L290 TraceCheckUtils]: 23: Hoare triple {1706#(= 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; {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-14 17:54:27,628 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1601#true} {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} #58#return; {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-14 17:54:27,628 INFO L290 TraceCheckUtils]: 21: Hoare triple {1601#true} assume true; {1601#true} is VALID [2022-04-14 17:54:27,628 INFO L290 TraceCheckUtils]: 20: Hoare triple {1601#true} assume !(0 == ~cond); {1601#true} is VALID [2022-04-14 17:54:27,628 INFO L290 TraceCheckUtils]: 19: Hoare triple {1601#true} ~cond := #in~cond; {1601#true} is VALID [2022-04-14 17:54:27,628 INFO L272 TraceCheckUtils]: 18: Hoare triple {1706#(= 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)); {1601#true} is VALID [2022-04-14 17:54:27,629 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1601#true} {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} #56#return; {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-14 17:54:27,629 INFO L290 TraceCheckUtils]: 16: Hoare triple {1601#true} assume true; {1601#true} is VALID [2022-04-14 17:54:27,632 INFO L290 TraceCheckUtils]: 15: Hoare triple {1601#true} assume !(0 == ~cond); {1601#true} is VALID [2022-04-14 17:54:27,632 INFO L290 TraceCheckUtils]: 14: Hoare triple {1601#true} ~cond := #in~cond; {1601#true} is VALID [2022-04-14 17:54:27,632 INFO L272 TraceCheckUtils]: 13: Hoare triple {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1601#true} is VALID [2022-04-14 17:54:27,633 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1601#true} {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} #54#return; {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-14 17:54:27,633 INFO L290 TraceCheckUtils]: 11: Hoare triple {1601#true} assume true; {1601#true} is VALID [2022-04-14 17:54:27,633 INFO L290 TraceCheckUtils]: 10: Hoare triple {1601#true} assume !(0 == ~cond); {1601#true} is VALID [2022-04-14 17:54:27,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {1601#true} ~cond := #in~cond; {1601#true} is VALID [2022-04-14 17:54:27,633 INFO L272 TraceCheckUtils]: 8: Hoare triple {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1601#true} is VALID [2022-04-14 17:54:27,634 INFO L290 TraceCheckUtils]: 7: Hoare triple {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} assume !!(#t~post5 < 100);havoc #t~post5; {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-14 17:54:27,634 INFO L290 TraceCheckUtils]: 6: Hoare triple {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-14 17:54:27,634 INFO L290 TraceCheckUtils]: 5: Hoare triple {1601#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;~a~0 := 0;~s~0 := 1;~t~0 := 1; {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-14 17:54:27,638 INFO L272 TraceCheckUtils]: 4: Hoare triple {1601#true} call #t~ret6 := main(); {1601#true} is VALID [2022-04-14 17:54:27,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1601#true} {1601#true} #66#return; {1601#true} is VALID [2022-04-14 17:54:27,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {1601#true} assume true; {1601#true} is VALID [2022-04-14 17:54:27,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {1601#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);~counter~0 := 0; {1601#true} is VALID [2022-04-14 17:54:27,639 INFO L272 TraceCheckUtils]: 0: Hoare triple {1601#true} call ULTIMATE.init(); {1601#true} is VALID [2022-04-14 17:54:27,639 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-14 17:54:27,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:54:27,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000467637] [2022-04-14 17:54:27,639 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:54:27,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476853407] [2022-04-14 17:54:27,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476853407] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 17:54:27,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-14 17:54:27,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-14 17:54:27,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48683318] [2022-04-14 17:54:27,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 17:54:27,640 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (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 30 [2022-04-14 17:54:27,641 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:54:27,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (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-14 17:54:27,654 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-14 17:54:27,654 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 17:54:27,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:54:27,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 17:54:27,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-14 17:54:27,655 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (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-14 17:54:27,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:54:27,776 INFO L93 Difference]: Finished difference Result 81 states and 98 transitions. [2022-04-14 17:54:27,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 17:54:27,776 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (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 30 [2022-04-14 17:54:27,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:54:27,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (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-14 17:54:27,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-14 17:54:27,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (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-14 17:54:27,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-14 17:54:27,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-14 17:54:27,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:54:27,824 INFO L225 Difference]: With dead ends: 81 [2022-04-14 17:54:27,824 INFO L226 Difference]: Without dead ends: 79 [2022-04-14 17:54:27,824 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-14 17:54:27,824 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 17:54:27,825 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 62 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 17:54:27,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-14 17:54:27,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-04-14 17:54:27,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:54:27,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 79 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-14 17:54:27,851 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 79 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-14 17:54:27,851 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 79 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-14 17:54:27,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:54:27,853 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2022-04-14 17:54:27,853 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2022-04-14 17:54:27,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:54:27,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:54:27,854 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 79 states. [2022-04-14 17:54:27,854 INFO L87 Difference]: Start difference. First operand has 79 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 79 states. [2022-04-14 17:54:27,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:54:27,856 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2022-04-14 17:54:27,856 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2022-04-14 17:54:27,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:54:27,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:54:27,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:54:27,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:54:27,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-14 17:54:27,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 94 transitions. [2022-04-14 17:54:27,859 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 94 transitions. Word has length 30 [2022-04-14 17:54:27,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:54:27,859 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 94 transitions. [2022-04-14 17:54:27,859 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (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-14 17:54:27,859 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2022-04-14 17:54:27,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-14 17:54:27,860 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:54:27,860 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:54:27,881 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-14 17:54:28,060 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:54:28,061 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:54:28,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:54:28,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1080733609, now seen corresponding path program 2 times [2022-04-14 17:54:28,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:54:28,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702577824] [2022-04-14 17:54:28,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:54:28,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:54:28,076 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:54:28,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [658359100] [2022-04-14 17:54:28,076 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 17:54:28,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:54:28,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:54:28,083 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 17:54:28,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-14 17:54:28,122 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 17:54:28,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 17:54:28,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-14 17:54:28,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:54:28,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:54:28,294 INFO L272 TraceCheckUtils]: 0: Hoare triple {2185#true} call ULTIMATE.init(); {2185#true} is VALID [2022-04-14 17:54:28,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {2185#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);~counter~0 := 0; {2185#true} is VALID [2022-04-14 17:54:28,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {2185#true} assume true; {2185#true} is VALID [2022-04-14 17:54:28,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2185#true} {2185#true} #66#return; {2185#true} is VALID [2022-04-14 17:54:28,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {2185#true} call #t~ret6 := main(); {2185#true} is VALID [2022-04-14 17:54:28,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {2185#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;~a~0 := 0;~s~0 := 1;~t~0 := 1; {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-14 17:54:28,295 INFO L290 TraceCheckUtils]: 6: Hoare triple {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-14 17:54:28,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-14 17:54:28,296 INFO L272 TraceCheckUtils]: 8: Hoare triple {2205#(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)); {2185#true} is VALID [2022-04-14 17:54:28,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {2185#true} ~cond := #in~cond; {2185#true} is VALID [2022-04-14 17:54:28,296 INFO L290 TraceCheckUtils]: 10: Hoare triple {2185#true} assume !(0 == ~cond); {2185#true} is VALID [2022-04-14 17:54:28,296 INFO L290 TraceCheckUtils]: 11: Hoare triple {2185#true} assume true; {2185#true} is VALID [2022-04-14 17:54:28,297 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2185#true} {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #54#return; {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-14 17:54:28,297 INFO L272 TraceCheckUtils]: 13: Hoare triple {2205#(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)); {2185#true} is VALID [2022-04-14 17:54:28,297 INFO L290 TraceCheckUtils]: 14: Hoare triple {2185#true} ~cond := #in~cond; {2185#true} is VALID [2022-04-14 17:54:28,297 INFO L290 TraceCheckUtils]: 15: Hoare triple {2185#true} assume !(0 == ~cond); {2185#true} is VALID [2022-04-14 17:54:28,297 INFO L290 TraceCheckUtils]: 16: Hoare triple {2185#true} assume true; {2185#true} is VALID [2022-04-14 17:54:28,297 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2185#true} {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #56#return; {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-14 17:54:28,297 INFO L272 TraceCheckUtils]: 18: Hoare triple {2205#(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)); {2185#true} is VALID [2022-04-14 17:54:28,297 INFO L290 TraceCheckUtils]: 19: Hoare triple {2185#true} ~cond := #in~cond; {2185#true} is VALID [2022-04-14 17:54:28,298 INFO L290 TraceCheckUtils]: 20: Hoare triple {2185#true} assume !(0 == ~cond); {2185#true} is VALID [2022-04-14 17:54:28,298 INFO L290 TraceCheckUtils]: 21: Hoare triple {2185#true} assume true; {2185#true} is VALID [2022-04-14 17:54:28,298 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2185#true} {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #58#return; {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-14 17:54:28,298 INFO L290 TraceCheckUtils]: 23: Hoare triple {2205#(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; {2260#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} is VALID [2022-04-14 17:54:28,299 INFO L290 TraceCheckUtils]: 24: Hoare triple {2260#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2260#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} is VALID [2022-04-14 17:54:28,299 INFO L290 TraceCheckUtils]: 25: Hoare triple {2260#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} assume !!(#t~post5 < 100);havoc #t~post5; {2260#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} is VALID [2022-04-14 17:54:28,299 INFO L272 TraceCheckUtils]: 26: Hoare triple {2260#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2185#true} is VALID [2022-04-14 17:54:28,299 INFO L290 TraceCheckUtils]: 27: Hoare triple {2185#true} ~cond := #in~cond; {2185#true} is VALID [2022-04-14 17:54:28,299 INFO L290 TraceCheckUtils]: 28: Hoare triple {2185#true} assume !(0 == ~cond); {2185#true} is VALID [2022-04-14 17:54:28,300 INFO L290 TraceCheckUtils]: 29: Hoare triple {2185#true} assume true; {2185#true} is VALID [2022-04-14 17:54:28,300 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2185#true} {2260#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} #54#return; {2260#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} is VALID [2022-04-14 17:54:28,300 INFO L272 TraceCheckUtils]: 31: Hoare triple {2260#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2285#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:54:28,301 INFO L290 TraceCheckUtils]: 32: Hoare triple {2285#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2289#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:54:28,301 INFO L290 TraceCheckUtils]: 33: Hoare triple {2289#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2186#false} is VALID [2022-04-14 17:54:28,302 INFO L290 TraceCheckUtils]: 34: Hoare triple {2186#false} assume !false; {2186#false} is VALID [2022-04-14 17:54:28,302 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-14 17:54:28,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 17:54:28,446 INFO L290 TraceCheckUtils]: 34: Hoare triple {2186#false} assume !false; {2186#false} is VALID [2022-04-14 17:54:28,446 INFO L290 TraceCheckUtils]: 33: Hoare triple {2289#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2186#false} is VALID [2022-04-14 17:54:28,446 INFO L290 TraceCheckUtils]: 32: Hoare triple {2285#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2289#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:54:28,447 INFO L272 TraceCheckUtils]: 31: Hoare triple {2305#(= (+ (* 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)); {2285#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:54:28,447 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2185#true} {2305#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} #54#return; {2305#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-14 17:54:28,448 INFO L290 TraceCheckUtils]: 29: Hoare triple {2185#true} assume true; {2185#true} is VALID [2022-04-14 17:54:28,448 INFO L290 TraceCheckUtils]: 28: Hoare triple {2185#true} assume !(0 == ~cond); {2185#true} is VALID [2022-04-14 17:54:28,448 INFO L290 TraceCheckUtils]: 27: Hoare triple {2185#true} ~cond := #in~cond; {2185#true} is VALID [2022-04-14 17:54:28,448 INFO L272 TraceCheckUtils]: 26: Hoare triple {2305#(= (+ (* 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)); {2185#true} is VALID [2022-04-14 17:54:28,448 INFO L290 TraceCheckUtils]: 25: Hoare triple {2305#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} assume !!(#t~post5 < 100);havoc #t~post5; {2305#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-14 17:54:28,449 INFO L290 TraceCheckUtils]: 24: Hoare triple {2305#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2305#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-14 17:54:28,455 INFO L290 TraceCheckUtils]: 23: Hoare triple {2330#(= (+ (* (+ 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; {2305#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-14 17:54:28,457 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2185#true} {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #58#return; {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-14 17:54:28,462 INFO L290 TraceCheckUtils]: 21: Hoare triple {2185#true} assume true; {2185#true} is VALID [2022-04-14 17:54:28,463 INFO L290 TraceCheckUtils]: 20: Hoare triple {2185#true} assume !(0 == ~cond); {2185#true} is VALID [2022-04-14 17:54:28,463 INFO L290 TraceCheckUtils]: 19: Hoare triple {2185#true} ~cond := #in~cond; {2185#true} is VALID [2022-04-14 17:54:28,463 INFO L272 TraceCheckUtils]: 18: Hoare triple {2330#(= (+ (* (+ 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)); {2185#true} is VALID [2022-04-14 17:54:28,466 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2185#true} {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #56#return; {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-14 17:54:28,466 INFO L290 TraceCheckUtils]: 16: Hoare triple {2185#true} assume true; {2185#true} is VALID [2022-04-14 17:54:28,467 INFO L290 TraceCheckUtils]: 15: Hoare triple {2185#true} assume !(0 == ~cond); {2185#true} is VALID [2022-04-14 17:54:28,467 INFO L290 TraceCheckUtils]: 14: Hoare triple {2185#true} ~cond := #in~cond; {2185#true} is VALID [2022-04-14 17:54:28,467 INFO L272 TraceCheckUtils]: 13: Hoare triple {2330#(= (+ (* (+ 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)); {2185#true} is VALID [2022-04-14 17:54:28,468 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2185#true} {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #54#return; {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-14 17:54:28,468 INFO L290 TraceCheckUtils]: 11: Hoare triple {2185#true} assume true; {2185#true} is VALID [2022-04-14 17:54:28,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {2185#true} assume !(0 == ~cond); {2185#true} is VALID [2022-04-14 17:54:28,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {2185#true} ~cond := #in~cond; {2185#true} is VALID [2022-04-14 17:54:28,468 INFO L272 TraceCheckUtils]: 8: Hoare triple {2330#(= (+ (* (+ 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)); {2185#true} is VALID [2022-04-14 17:54:28,469 INFO L290 TraceCheckUtils]: 7: Hoare triple {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} assume !!(#t~post5 < 100);havoc #t~post5; {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-14 17:54:28,469 INFO L290 TraceCheckUtils]: 6: Hoare triple {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-14 17:54:28,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {2185#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;~a~0 := 0;~s~0 := 1;~t~0 := 1; {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-14 17:54:28,470 INFO L272 TraceCheckUtils]: 4: Hoare triple {2185#true} call #t~ret6 := main(); {2185#true} is VALID [2022-04-14 17:54:28,470 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2185#true} {2185#true} #66#return; {2185#true} is VALID [2022-04-14 17:54:28,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {2185#true} assume true; {2185#true} is VALID [2022-04-14 17:54:28,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {2185#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);~counter~0 := 0; {2185#true} is VALID [2022-04-14 17:54:28,470 INFO L272 TraceCheckUtils]: 0: Hoare triple {2185#true} call ULTIMATE.init(); {2185#true} is VALID [2022-04-14 17:54:28,472 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-14 17:54:28,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:54:28,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702577824] [2022-04-14 17:54:28,472 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:54:28,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658359100] [2022-04-14 17:54:28,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658359100] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 17:54:28,472 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 17:54:28,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-14 17:54:28,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241989761] [2022-04-14 17:54:28,472 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 17:54:28,473 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 35 [2022-04-14 17:54:28,473 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:54:28,473 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-14 17:54:28,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:54:28,506 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 17:54:28,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:54:28,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 17:54:28,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-14 17:54:28,507 INFO L87 Difference]: Start difference. First operand 79 states and 94 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-14 17:54:28,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:54:28,927 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2022-04-14 17:54:28,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-14 17:54:28,927 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 35 [2022-04-14 17:54:28,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:54:28,927 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-14 17:54:28,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2022-04-14 17:54:28,929 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-14 17:54:28,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2022-04-14 17:54:28,929 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 51 transitions. [2022-04-14 17:54:28,982 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:54:28,983 INFO L225 Difference]: With dead ends: 79 [2022-04-14 17:54:28,983 INFO L226 Difference]: Without dead ends: 0 [2022-04-14 17:54:28,983 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-04-14 17:54:28,984 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 11 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-14 17:54:28,984 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 67 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-14 17:54:28,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-14 17:54:28,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-14 17:54:28,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:54:28,984 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-14 17:54:28,984 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-14 17:54:28,984 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-14 17:54:28,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:54:28,985 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 17:54:28,985 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 17:54:28,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:54:28,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:54:28,985 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-14 17:54:28,985 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-14 17:54:28,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:54:28,985 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 17:54:28,985 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 17:54:28,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:54:28,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:54:28,985 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:54:28,985 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:54:28,985 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-14 17:54:28,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-14 17:54:28,986 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2022-04-14 17:54:28,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:54:28,986 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-14 17:54:28,986 INFO L479 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-14 17:54:28,986 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 17:54:28,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:54:28,988 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 17:54:29,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-14 17:54:29,203 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:54:29,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-14 17:54:29,475 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2022-04-14 17:54:29,476 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2022-04-14 17:54:29,476 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2022-04-14 17:54:29,476 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 8 10) no Hoare annotation was computed. [2022-04-14 17:54:29,476 INFO L882 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2022-04-14 17:54:29,476 INFO L882 garLoopResultBuilder]: For program point L9-2(lines 8 10) no Hoare annotation was computed. [2022-04-14 17:54:29,476 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 8 10) no Hoare annotation was computed. [2022-04-14 17:54:29,476 INFO L882 garLoopResultBuilder]: For program point L33(lines 30 42) no Hoare annotation was computed. [2022-04-14 17:54:29,476 INFO L878 garLoopResultBuilder]: At program point L31(line 31) 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))) (not (= |old(~counter~0)| 0))) [2022-04-14 17:54:29,476 INFO L878 garLoopResultBuilder]: At program point L31-1(line 31) 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))) (not (= |old(~counter~0)| 0))) [2022-04-14 17:54:29,476 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 21 49) no Hoare annotation was computed. [2022-04-14 17:54:29,476 INFO L882 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2022-04-14 17:54:29,476 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 21 49) no Hoare annotation was computed. [2022-04-14 17:54:29,476 INFO L878 garLoopResultBuilder]: At program point L44(line 44) 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))) (not (= |old(~counter~0)| 0))) [2022-04-14 17:54:29,476 INFO L878 garLoopResultBuilder]: At program point L32(line 32) 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))) (not (= |old(~counter~0)| 0))) [2022-04-14 17:54:29,477 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 21 49) the Hoare annotation is: (or (= ~counter~0 0) (not (= |old(~counter~0)| 0))) [2022-04-14 17:54:29,477 INFO L882 garLoopResultBuilder]: For program point L30-1(lines 30 42) no Hoare annotation was computed. [2022-04-14 17:54:29,477 INFO L878 garLoopResultBuilder]: At program point L30-3(lines 30 42) the Hoare annotation is: (or (let ((.cse0 (* main_~a~0 2))) (and (= (+ .cse0 (* main_~a~0 main_~a~0) 1) main_~s~0) (= main_~t~0 (+ .cse0 1)))) (not (= |old(~counter~0)| 0))) [2022-04-14 17:54:29,477 INFO L878 garLoopResultBuilder]: At program point L30-4(lines 30 42) 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))) (not (= |old(~counter~0)| 0))) [2022-04-14 17:54:29,477 INFO L878 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)) (not (= |old(~counter~0)| 0))) [2022-04-14 17:54:29,477 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-14 17:54:29,477 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-14 17:54:29,477 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-14 17:54:29,477 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-14 17:54:29,477 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (= ~counter~0 0) [2022-04-14 17:54:29,477 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-14 17:54:29,477 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-14 17:54:29,477 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-14 17:54:29,477 INFO L882 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2022-04-14 17:54:29,477 INFO L882 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2022-04-14 17:54:29,478 INFO L882 garLoopResultBuilder]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2022-04-14 17:54:29,478 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2022-04-14 17:54:29,478 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-04-14 17:54:29,480 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2022-04-14 17:54:29,481 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 17:54:29,483 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-14 17:54:29,483 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-14 17:54:29,484 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-14 17:54:29,485 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-14 17:54:29,485 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-14 17:54:29,485 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-14 17:54:29,485 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-14 17:54:29,485 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-14 17:54:29,485 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-14 17:54:29,486 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-04-14 17:54:29,486 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-14 17:54:29,486 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-14 17:54:29,486 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-14 17:54:29,486 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-14 17:54:29,486 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-14 17:54:29,486 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-04-14 17:54:29,486 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-04-14 17:54:29,486 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-14 17:54:29,486 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-14 17:54:29,486 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-14 17:54:29,486 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 17:54:29,486 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 17:54:29,486 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 17:54:29,486 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 17:54:29,486 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 17:54:29,486 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 17:54:29,486 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-14 17:54:29,486 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-14 17:54:29,486 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-14 17:54:29,486 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-14 17:54:29,486 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-14 17:54:29,486 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-14 17:54:29,486 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-14 17:54:29,487 INFO L163 areAnnotationChecker]: CFG has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-14 17:54:29,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 05:54:29 BoogieIcfgContainer [2022-04-14 17:54:29,493 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 17:54:29,494 INFO L158 Benchmark]: Toolchain (without parser) took 6712.70ms. Allocated memory was 176.2MB in the beginning and 213.9MB in the end (delta: 37.7MB). Free memory was 125.3MB in the beginning and 185.4MB in the end (delta: -60.1MB). Peak memory consumption was 95.2MB. Max. memory is 8.0GB. [2022-04-14 17:54:29,494 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 176.2MB. Free memory was 141.3MB in the beginning and 141.1MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 17:54:29,494 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.51ms. Allocated memory is still 176.2MB. Free memory was 125.1MB in the beginning and 150.0MB in the end (delta: -24.9MB). Peak memory consumption was 13.2MB. Max. memory is 8.0GB. [2022-04-14 17:54:29,494 INFO L158 Benchmark]: Boogie Preprocessor took 33.82ms. Allocated memory is still 176.2MB. Free memory was 150.0MB in the beginning and 149.0MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-14 17:54:29,494 INFO L158 Benchmark]: RCFGBuilder took 213.78ms. Allocated memory is still 176.2MB. Free memory was 148.5MB in the beginning and 137.4MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-14 17:54:29,494 INFO L158 Benchmark]: TraceAbstraction took 6198.97ms. Allocated memory was 176.2MB in the beginning and 213.9MB in the end (delta: 37.7MB). Free memory was 136.9MB in the beginning and 185.4MB in the end (delta: -48.5MB). Peak memory consumption was 107.2MB. Max. memory is 8.0GB. [2022-04-14 17:54:29,495 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.10ms. Allocated memory is still 176.2MB. Free memory was 141.3MB in the beginning and 141.1MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 260.51ms. Allocated memory is still 176.2MB. Free memory was 125.1MB in the beginning and 150.0MB in the end (delta: -24.9MB). Peak memory consumption was 13.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.82ms. Allocated memory is still 176.2MB. Free memory was 150.0MB in the beginning and 149.0MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 213.78ms. Allocated memory is still 176.2MB. Free memory was 148.5MB in the beginning and 137.4MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 6198.97ms. Allocated memory was 176.2MB in the beginning and 213.9MB in the end (delta: 37.7MB). Free memory was 136.9MB in the beginning and 185.4MB in the end (delta: -48.5MB). Peak memory consumption was 107.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 112 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 98 mSDsluCounter, 616 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 392 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 426 IncrementalHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 224 mSDtfsCounter, 426 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 255 GetRequests, 207 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=7, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 8 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 47 PreInvPairs, 76 NumberOfFragments, 203 HoareAnnotationTreeSize, 47 FomulaSimplifications, 36 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 12 FomulaSimplificationsInter, 879 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 169 NumberOfCodeBlocks, 169 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 253 ConstructedInterpolants, 0 QuantifiedInterpolants, 822 SizeOfPredicates, 7 NumberOfNonLiveVariables, 508 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 11 InterpolantComputations, 6 PerfectInterpolantSequences, 149/164 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: (a * 2 + a * a + 1 == s && t == a * 2 + 1) || !(\old(counter) == 0) RESULT: Ultimate proved your program to be correct! [2022-04-14 17:54:29,507 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...