./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_valuebound1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_valuebound1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0a70f1205afb9cca148fa8c17f899d7361834a55786fb03fe89056a7c6fb47c5 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:44:24,123 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:44:24,125 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:44:24,155 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:44:24,155 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:44:24,158 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:44:24,159 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:44:24,161 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:44:24,163 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:44:24,167 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:44:24,168 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:44:24,169 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:44:24,169 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:44:24,171 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:44:24,172 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:44:24,175 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:44:24,175 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:44:24,176 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:44:24,178 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:44:24,181 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:44:24,182 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:44:24,183 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:44:24,184 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:44:24,185 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:44:24,189 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:44:24,190 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:44:24,190 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:44:24,191 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:44:24,191 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:44:24,192 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:44:24,192 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:44:24,193 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:44:24,194 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:44:24,195 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:44:24,195 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:44:24,196 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:44:24,196 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:44:24,196 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:44:24,196 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:44:24,197 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:44:24,197 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:44:24,198 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 17:44:24,219 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:44:24,220 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:44:24,220 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:44:24,220 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:44:24,221 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:44:24,221 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:44:24,221 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:44:24,221 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:44:24,222 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:44:24,222 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:44:24,222 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:44:24,223 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:44:24,223 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:44:24,223 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:44:24,223 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:44:24,223 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:44:24,223 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:44:24,223 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:44:24,224 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:44:24,224 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:44:24,224 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:44:24,224 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:44:24,224 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:44:24,224 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:44:24,224 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:44:24,225 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:44:24,225 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:44:24,225 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:44:24,225 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:44:24,225 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:44:24,225 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:44:24,225 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:44:24,226 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:44:24,226 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0a70f1205afb9cca148fa8c17f899d7361834a55786fb03fe89056a7c6fb47c5 [2022-02-20 17:44:24,411 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:44:24,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:44:24,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:44:24,433 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:44:24,434 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:44:24,435 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_valuebound1.c [2022-02-20 17:44:24,480 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ce5174fd/970915729baf4af79a7d7028d3527b91/FLAG01e998255 [2022-02-20 17:44:24,799 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:44:24,799 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_valuebound1.c [2022-02-20 17:44:24,806 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ce5174fd/970915729baf4af79a7d7028d3527b91/FLAG01e998255 [2022-02-20 17:44:25,224 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ce5174fd/970915729baf4af79a7d7028d3527b91 [2022-02-20 17:44:25,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:44:25,227 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:44:25,228 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:44:25,229 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:44:25,231 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:44:25,231 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:44:25" (1/1) ... [2022-02-20 17:44:25,232 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f8e0705 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:44:25, skipping insertion in model container [2022-02-20 17:44:25,232 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:44:25" (1/1) ... [2022-02-20 17:44:25,237 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:44:25,254 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:44:25,352 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_valuebound1.c[520,533] [2022-02-20 17:44:25,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:44:25,368 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:44:25,377 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_valuebound1.c[520,533] [2022-02-20 17:44:25,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:44:25,390 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:44:25,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:44:25 WrapperNode [2022-02-20 17:44:25,391 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:44:25,391 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:44:25,392 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:44:25,392 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:44:25,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:44:25" (1/1) ... [2022-02-20 17:44:25,400 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:44:25" (1/1) ... [2022-02-20 17:44:25,413 INFO L137 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 41 [2022-02-20 17:44:25,413 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:44:25,414 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:44:25,414 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:44:25,414 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:44:25,419 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:44:25" (1/1) ... [2022-02-20 17:44:25,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:44:25" (1/1) ... [2022-02-20 17:44:25,420 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:44:25" (1/1) ... [2022-02-20 17:44:25,420 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:44:25" (1/1) ... [2022-02-20 17:44:25,422 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:44:25" (1/1) ... [2022-02-20 17:44:25,424 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:44:25" (1/1) ... [2022-02-20 17:44:25,425 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:44:25" (1/1) ... [2022-02-20 17:44:25,426 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:44:25,427 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:44:25,427 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:44:25,427 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:44:25,428 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:44:25" (1/1) ... [2022-02-20 17:44:25,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:44:25,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:44:25,450 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-02-20 17:44:25,460 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-02-20 17:44:25,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:44:25,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:44:25,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:44:25,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:44:25,479 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:44:25,479 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:44:25,517 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:44:25,518 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:44:25,659 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:44:25,664 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:44:25,676 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:44:25,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:44:25 BoogieIcfgContainer [2022-02-20 17:44:25,677 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:44:25,679 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:44:25,679 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:44:25,681 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:44:25,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:44:25" (1/3) ... [2022-02-20 17:44:25,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@396a9918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:44:25, skipping insertion in model container [2022-02-20 17:44:25,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:44:25" (2/3) ... [2022-02-20 17:44:25,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@396a9918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:44:25, skipping insertion in model container [2022-02-20 17:44:25,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:44:25" (3/3) ... [2022-02-20 17:44:25,683 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_valuebound1.c [2022-02-20 17:44:25,686 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:44:25,687 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:44:25,733 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:44:25,738 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 17:44:25,741 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:44:25,756 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:44:25,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 17:44:25,759 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:44:25,760 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:44:25,760 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:44:25,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:44:25,766 INFO L85 PathProgramCache]: Analyzing trace with hash -589224774, now seen corresponding path program 1 times [2022-02-20 17:44:25,773 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:44:25,775 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392306436] [2022-02-20 17:44:25,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:44:25,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:44:25,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:44:25,903 INFO L290 TraceCheckUtils]: 0: Hoare triple {25#true} assume { :begin_inline_ULTIMATE.init } 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); {25#true} is VALID [2022-02-20 17:44:25,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~n~0#1, main_~a~0#1, main_~s~0#1, main_~t~0#1;havoc main_~n~0#1;havoc main_~a~0#1;havoc main_~s~0#1;havoc main_~t~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~n~0#1 >= 0 && main_~n~0#1 <= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {25#true} is VALID [2022-02-20 17:44:25,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {26#false} is VALID [2022-02-20 17:44:25,905 INFO L290 TraceCheckUtils]: 3: Hoare triple {26#false} assume { :end_inline_assume_abort_if_not } true;main_~a~0#1 := 0;main_~s~0#1 := 1;main_~t~0#1 := 1; {26#false} is VALID [2022-02-20 17:44:25,905 INFO L290 TraceCheckUtils]: 4: Hoare triple {26#false} assume false; {26#false} is VALID [2022-02-20 17:44:25,905 INFO L272 TraceCheckUtils]: 5: Hoare triple {26#false} call __VERIFIER_assert((if main_~t~0#1 == 1 + 2 * main_~a~0#1 then 1 else 0)); {26#false} is VALID [2022-02-20 17:44:25,905 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-02-20 17:44:25,906 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-02-20 17:44:25,906 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-02-20 17:44:25,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:44:25,907 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:44:25,907 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392306436] [2022-02-20 17:44:25,908 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392306436] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:44:25,908 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:44:25,908 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:44:25,910 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850294847] [2022-02-20 17:44:25,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:44:25,916 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:44:25,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:44:25,921 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:44:25,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:25,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:44:25,941 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:44:25,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:44:25,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:44:25,962 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:44:26,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:26,031 INFO L93 Difference]: Finished difference Result 41 states and 64 transitions. [2022-02-20 17:44:26,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:44:26,032 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:44:26,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:44:26,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:44:26,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 64 transitions. [2022-02-20 17:44:26,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:44:26,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 64 transitions. [2022-02-20 17:44:26,052 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 64 transitions. [2022-02-20 17:44:26,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:26,140 INFO L225 Difference]: With dead ends: 41 [2022-02-20 17:44:26,140 INFO L226 Difference]: Without dead ends: 18 [2022-02-20 17:44:26,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:44:26,145 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:44:26,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:44:26,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-02-20 17:44:26,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-20 17:44:26,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:44:26,173 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:44:26,173 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:44:26,174 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:44:26,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:26,178 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2022-02-20 17:44:26,179 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-02-20 17:44:26,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:26,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:26,180 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 18 states. [2022-02-20 17:44:26,181 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 18 states. [2022-02-20 17:44:26,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:26,184 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2022-02-20 17:44:26,184 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-02-20 17:44:26,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:26,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:26,185 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:44:26,186 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:44:26,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:44:26,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2022-02-20 17:44:26,192 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 9 [2022-02-20 17:44:26,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:44:26,193 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2022-02-20 17:44:26,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:44:26,193 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-02-20 17:44:26,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 17:44:26,194 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:44:26,194 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:44:26,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:44:26,200 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:44:26,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:44:26,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1187450884, now seen corresponding path program 1 times [2022-02-20 17:44:26,203 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:44:26,203 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574307916] [2022-02-20 17:44:26,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:44:26,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:44:26,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:44:26,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {150#true} assume { :begin_inline_ULTIMATE.init } 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); {150#true} is VALID [2022-02-20 17:44:26,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {150#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~n~0#1, main_~a~0#1, main_~s~0#1, main_~t~0#1;havoc main_~n~0#1;havoc main_~a~0#1;havoc main_~s~0#1;havoc main_~t~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~n~0#1 >= 0 && main_~n~0#1 <= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {150#true} is VALID [2022-02-20 17:44:26,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {150#true} assume !(0 == assume_abort_if_not_~cond#1); {150#true} is VALID [2022-02-20 17:44:26,312 INFO L290 TraceCheckUtils]: 3: Hoare triple {150#true} assume { :end_inline_assume_abort_if_not } true;main_~a~0#1 := 0;main_~s~0#1 := 1;main_~t~0#1 := 1; {152#(and (= |ULTIMATE.start_main_~t~0#1| (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|))) (= |ULTIMATE.start_main_~a~0#1| 0))} is VALID [2022-02-20 17:44:26,312 INFO L290 TraceCheckUtils]: 4: Hoare triple {152#(and (= |ULTIMATE.start_main_~t~0#1| (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|))) (= |ULTIMATE.start_main_~a~0#1| 0))} assume !false; {152#(and (= |ULTIMATE.start_main_~t~0#1| (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|))) (= |ULTIMATE.start_main_~a~0#1| 0))} is VALID [2022-02-20 17:44:26,313 INFO L272 TraceCheckUtils]: 5: Hoare triple {152#(and (= |ULTIMATE.start_main_~t~0#1| (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|))) (= |ULTIMATE.start_main_~a~0#1| 0))} call __VERIFIER_assert((if main_~t~0#1 == 1 + 2 * main_~a~0#1 then 1 else 0)); {153#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:44:26,318 INFO L290 TraceCheckUtils]: 6: Hoare triple {153#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {154#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:44:26,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {154#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {151#false} is VALID [2022-02-20 17:44:26,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {151#false} assume !false; {151#false} is VALID [2022-02-20 17:44:26,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:44:26,319 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:44:26,320 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574307916] [2022-02-20 17:44:26,320 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574307916] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:44:26,320 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:44:26,320 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:44:26,321 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210541267] [2022-02-20 17:44:26,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:44:26,322 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:44:26,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:44:26,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:44:26,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:26,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:44:26,329 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:44:26,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:44:26,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:44:26,331 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:44:26,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:26,468 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-02-20 17:44:26,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:44:26,469 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:44:26,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:44:26,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:44:26,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-02-20 17:44:26,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:44:26,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-02-20 17:44:26,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2022-02-20 17:44:26,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:26,505 INFO L225 Difference]: With dead ends: 32 [2022-02-20 17:44:26,505 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 17:44:26,506 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-20 17:44:26,506 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 7 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:44:26,507 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 80 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:44:26,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 17:44:26,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2022-02-20 17:44:26,511 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:44:26,511 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 28 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:44:26,512 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 28 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:44:26,512 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 28 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:44:26,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:26,514 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2022-02-20 17:44:26,514 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-02-20 17:44:26,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:26,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:26,515 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 30 states. [2022-02-20 17:44:26,515 INFO L87 Difference]: Start difference. First operand has 28 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 30 states. [2022-02-20 17:44:26,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:26,517 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2022-02-20 17:44:26,517 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-02-20 17:44:26,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:26,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:26,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:44:26,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:44:26,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:44:26,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2022-02-20 17:44:26,520 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 9 [2022-02-20 17:44:26,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:44:26,520 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-02-20 17:44:26,520 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:44:26,521 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-02-20 17:44:26,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 17:44:26,521 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:44:26,521 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:44:26,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:44:26,522 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:44:26,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:44:26,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1170702338, now seen corresponding path program 1 times [2022-02-20 17:44:26,522 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:44:26,522 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775715448] [2022-02-20 17:44:26,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:44:26,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:44:26,535 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:44:26,535 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1350073756] [2022-02-20 17:44:26,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:44:26,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:44:26,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:44:26,537 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-02-20 17:44:26,538 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-02-20 17:44:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:44:26,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:44:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:44:26,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:44:26,673 INFO L290 TraceCheckUtils]: 0: Hoare triple {309#true} assume { :begin_inline_ULTIMATE.init } 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); {309#true} is VALID [2022-02-20 17:44:26,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {309#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~n~0#1, main_~a~0#1, main_~s~0#1, main_~t~0#1;havoc main_~n~0#1;havoc main_~a~0#1;havoc main_~s~0#1;havoc main_~t~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~n~0#1 >= 0 && main_~n~0#1 <= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {309#true} is VALID [2022-02-20 17:44:26,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {309#true} assume !(0 == assume_abort_if_not_~cond#1); {309#true} is VALID [2022-02-20 17:44:26,674 INFO L290 TraceCheckUtils]: 3: Hoare triple {309#true} assume { :end_inline_assume_abort_if_not } true;main_~a~0#1 := 0;main_~s~0#1 := 1;main_~t~0#1 := 1; {323#(and (= |ULTIMATE.start_main_~a~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:44:26,674 INFO L290 TraceCheckUtils]: 4: Hoare triple {323#(and (= |ULTIMATE.start_main_~a~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} assume !false; {323#(and (= |ULTIMATE.start_main_~a~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:44:26,675 INFO L272 TraceCheckUtils]: 5: Hoare triple {323#(and (= |ULTIMATE.start_main_~a~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} call __VERIFIER_assert((if main_~t~0#1 == 1 + 2 * main_~a~0#1 then 1 else 0)); {309#true} is VALID [2022-02-20 17:44:26,675 INFO L290 TraceCheckUtils]: 6: Hoare triple {309#true} ~cond := #in~cond; {309#true} is VALID [2022-02-20 17:44:26,675 INFO L290 TraceCheckUtils]: 7: Hoare triple {309#true} assume !(0 == ~cond); {309#true} is VALID [2022-02-20 17:44:26,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {309#true} assume true; {309#true} is VALID [2022-02-20 17:44:26,676 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {309#true} {323#(and (= |ULTIMATE.start_main_~a~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} #49#return; {323#(and (= |ULTIMATE.start_main_~a~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:44:26,677 INFO L272 TraceCheckUtils]: 10: Hoare triple {323#(and (= |ULTIMATE.start_main_~a~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} call __VERIFIER_assert((if main_~s~0#1 == (1 + main_~a~0#1) * (1 + main_~a~0#1) then 1 else 0)); {345#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:44:26,677 INFO L290 TraceCheckUtils]: 11: Hoare triple {345#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {349#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:44:26,677 INFO L290 TraceCheckUtils]: 12: Hoare triple {349#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {310#false} is VALID [2022-02-20 17:44:26,678 INFO L290 TraceCheckUtils]: 13: Hoare triple {310#false} assume !false; {310#false} is VALID [2022-02-20 17:44:26,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:44:26,678 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:44:26,678 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:44:26,678 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775715448] [2022-02-20 17:44:26,679 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:44:26,679 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350073756] [2022-02-20 17:44:26,679 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350073756] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:44:26,679 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:44:26,679 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:44:26,679 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416954426] [2022-02-20 17:44:26,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:44:26,680 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-02-20 17:44:26,680 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:44:26,680 INFO L86 InductivityCheck]: Starting indutivity 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:44:26,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:26,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:44:26,690 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:44:26,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:44:26,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:44:26,691 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:44:26,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:26,834 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-02-20 17:44:26,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:44:26,835 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-02-20 17:44:26,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:44:26,836 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:44:26,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-02-20 17:44:26,838 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:44:26,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-02-20 17:44:26,840 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 42 transitions. [2022-02-20 17:44:26,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:26,877 INFO L225 Difference]: With dead ends: 36 [2022-02-20 17:44:26,877 INFO L226 Difference]: Without dead ends: 34 [2022-02-20 17:44:26,878 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 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-02-20 17:44:26,880 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:44:26,880 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 83 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:44:26,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-20 17:44:26,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-02-20 17:44:26,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:44:26,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 33 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:44:26,892 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 33 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:44:26,892 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 33 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:44:26,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:26,894 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-02-20 17:44:26,894 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-02-20 17:44:26,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:26,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:26,895 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-02-20 17:44:26,895 INFO L87 Difference]: Start difference. First operand has 33 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-02-20 17:44:26,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:26,897 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-02-20 17:44:26,897 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-02-20 17:44:26,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:26,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:26,898 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:44:26,898 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:44:26,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:44:26,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2022-02-20 17:44:26,900 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 14 [2022-02-20 17:44:26,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:44:26,900 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2022-02-20 17:44:26,900 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:44:26,901 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2022-02-20 17:44:26,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:44:26,901 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:44:26,901 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:44:26,924 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-02-20 17:44:27,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:44:27,118 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:44:27,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:44:27,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1035962748, now seen corresponding path program 1 times [2022-02-20 17:44:27,118 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:44:27,118 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729966202] [2022-02-20 17:44:27,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:44:27,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:44:27,137 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:44:27,137 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [823881258] [2022-02-20 17:44:27,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:44:27,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:44:27,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:44:27,139 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-02-20 17:44:27,140 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-02-20 17:44:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:44:27,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:44:27,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:44:27,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:44:27,283 INFO L290 TraceCheckUtils]: 0: Hoare triple {527#true} assume { :begin_inline_ULTIMATE.init } 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); {527#true} is VALID [2022-02-20 17:44:27,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {527#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~n~0#1, main_~a~0#1, main_~s~0#1, main_~t~0#1;havoc main_~n~0#1;havoc main_~a~0#1;havoc main_~s~0#1;havoc main_~t~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~n~0#1 >= 0 && main_~n~0#1 <= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {527#true} is VALID [2022-02-20 17:44:27,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {527#true} assume !(0 == assume_abort_if_not_~cond#1); {527#true} is VALID [2022-02-20 17:44:27,285 INFO L290 TraceCheckUtils]: 3: Hoare triple {527#true} assume { :end_inline_assume_abort_if_not } true;main_~a~0#1 := 0;main_~s~0#1 := 1;main_~t~0#1 := 1; {541#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:44:27,285 INFO L290 TraceCheckUtils]: 4: Hoare triple {541#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~s~0#1| 1))} assume !false; {541#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:44:27,285 INFO L272 TraceCheckUtils]: 5: Hoare triple {541#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~s~0#1| 1))} call __VERIFIER_assert((if main_~t~0#1 == 1 + 2 * main_~a~0#1 then 1 else 0)); {527#true} is VALID [2022-02-20 17:44:27,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {527#true} ~cond := #in~cond; {527#true} is VALID [2022-02-20 17:44:27,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {527#true} assume !(0 == ~cond); {527#true} is VALID [2022-02-20 17:44:27,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {527#true} assume true; {527#true} is VALID [2022-02-20 17:44:27,286 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {527#true} {541#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~s~0#1| 1))} #49#return; {541#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:44:27,287 INFO L272 TraceCheckUtils]: 10: Hoare triple {541#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~s~0#1| 1))} call __VERIFIER_assert((if main_~s~0#1 == (1 + main_~a~0#1) * (1 + main_~a~0#1) then 1 else 0)); {527#true} is VALID [2022-02-20 17:44:27,287 INFO L290 TraceCheckUtils]: 11: Hoare triple {527#true} ~cond := #in~cond; {527#true} is VALID [2022-02-20 17:44:27,287 INFO L290 TraceCheckUtils]: 12: Hoare triple {527#true} assume !(0 == ~cond); {527#true} is VALID [2022-02-20 17:44:27,287 INFO L290 TraceCheckUtils]: 13: Hoare triple {527#true} assume true; {527#true} is VALID [2022-02-20 17:44:27,288 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {527#true} {541#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~s~0#1| 1))} #51#return; {541#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:44:27,291 INFO L272 TraceCheckUtils]: 15: Hoare triple {541#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~s~0#1| 1))} call __VERIFIER_assert((if 0 == 1 + (main_~t~0#1 * main_~t~0#1 - 4 * main_~s~0#1 + 2 * main_~t~0#1) then 1 else 0)); {578#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:44:27,291 INFO L290 TraceCheckUtils]: 16: Hoare triple {578#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {582#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:44:27,292 INFO L290 TraceCheckUtils]: 17: Hoare triple {582#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {528#false} is VALID [2022-02-20 17:44:27,292 INFO L290 TraceCheckUtils]: 18: Hoare triple {528#false} assume !false; {528#false} is VALID [2022-02-20 17:44:27,292 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:44:27,292 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:44:27,293 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:44:27,293 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729966202] [2022-02-20 17:44:27,293 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:44:27,293 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823881258] [2022-02-20 17:44:27,293 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823881258] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:44:27,293 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:44:27,293 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:44:27,294 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264507852] [2022-02-20 17:44:27,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:44:27,308 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), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-20 17:44:27,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:44:27,308 INFO L86 InductivityCheck]: Starting indutivity 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), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:44:27,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:27,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:44:27,320 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:44:27,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:44:27,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:44:27,321 INFO L87 Difference]: Start difference. First operand 33 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), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:44:27,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:27,451 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2022-02-20 17:44:27,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:44:27,452 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), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-20 17:44:27,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:44:27,452 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), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:44:27,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-02-20 17:44:27,453 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), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:44:27,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-02-20 17:44:27,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 42 transitions. [2022-02-20 17:44:27,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:27,493 INFO L225 Difference]: With dead ends: 40 [2022-02-20 17:44:27,493 INFO L226 Difference]: Without dead ends: 35 [2022-02-20 17:44:27,493 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 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-02-20 17:44:27,494 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:44:27,494 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 86 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:44:27,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-02-20 17:44:27,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-02-20 17:44:27,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:44:27,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:44:27,500 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:44:27,500 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:44:27,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:27,501 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-02-20 17:44:27,501 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-02-20 17:44:27,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:27,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:27,502 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 35 states. [2022-02-20 17:44:27,502 INFO L87 Difference]: Start difference. First operand has 35 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 35 states. [2022-02-20 17:44:27,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:27,503 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-02-20 17:44:27,504 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-02-20 17:44:27,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:27,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:27,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:44:27,504 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:44:27,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:44:27,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2022-02-20 17:44:27,505 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 19 [2022-02-20 17:44:27,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:44:27,506 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2022-02-20 17:44:27,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:44:27,506 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-02-20 17:44:27,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 17:44:27,506 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:44:27,507 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:44:27,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-20 17:44:27,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-02-20 17:44:27,725 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:44:27,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:44:27,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1637726784, now seen corresponding path program 1 times [2022-02-20 17:44:27,726 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:44:27,726 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837809669] [2022-02-20 17:44:27,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:44:27,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:44:27,740 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:44:27,740 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [644391165] [2022-02-20 17:44:27,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:44:27,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:44:27,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:44:27,741 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-02-20 17:44:27,742 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-02-20 17:44:27,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:44:27,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 17:44:27,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:44:27,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:44:27,904 INFO L290 TraceCheckUtils]: 0: Hoare triple {768#true} assume { :begin_inline_ULTIMATE.init } 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); {768#true} is VALID [2022-02-20 17:44:27,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {768#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~n~0#1, main_~a~0#1, main_~s~0#1, main_~t~0#1;havoc main_~n~0#1;havoc main_~a~0#1;havoc main_~s~0#1;havoc main_~t~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~n~0#1 >= 0 && main_~n~0#1 <= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {768#true} is VALID [2022-02-20 17:44:27,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {768#true} assume !(0 == assume_abort_if_not_~cond#1); {768#true} is VALID [2022-02-20 17:44:27,906 INFO L290 TraceCheckUtils]: 3: Hoare triple {768#true} assume { :end_inline_assume_abort_if_not } true;main_~a~0#1 := 0;main_~s~0#1 := 1;main_~t~0#1 := 1; {782#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0))} is VALID [2022-02-20 17:44:27,906 INFO L290 TraceCheckUtils]: 4: Hoare triple {782#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0))} assume !false; {782#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0))} is VALID [2022-02-20 17:44:27,906 INFO L272 TraceCheckUtils]: 5: Hoare triple {782#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0))} call __VERIFIER_assert((if main_~t~0#1 == 1 + 2 * main_~a~0#1 then 1 else 0)); {768#true} is VALID [2022-02-20 17:44:27,907 INFO L290 TraceCheckUtils]: 6: Hoare triple {768#true} ~cond := #in~cond; {768#true} is VALID [2022-02-20 17:44:27,907 INFO L290 TraceCheckUtils]: 7: Hoare triple {768#true} assume !(0 == ~cond); {768#true} is VALID [2022-02-20 17:44:27,907 INFO L290 TraceCheckUtils]: 8: Hoare triple {768#true} assume true; {768#true} is VALID [2022-02-20 17:44:27,907 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {768#true} {782#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0))} #49#return; {782#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0))} is VALID [2022-02-20 17:44:27,908 INFO L272 TraceCheckUtils]: 10: Hoare triple {782#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0))} call __VERIFIER_assert((if main_~s~0#1 == (1 + main_~a~0#1) * (1 + main_~a~0#1) then 1 else 0)); {768#true} is VALID [2022-02-20 17:44:27,908 INFO L290 TraceCheckUtils]: 11: Hoare triple {768#true} ~cond := #in~cond; {768#true} is VALID [2022-02-20 17:44:27,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {768#true} assume !(0 == ~cond); {768#true} is VALID [2022-02-20 17:44:27,908 INFO L290 TraceCheckUtils]: 13: Hoare triple {768#true} assume true; {768#true} is VALID [2022-02-20 17:44:27,909 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {768#true} {782#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0))} #51#return; {782#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0))} is VALID [2022-02-20 17:44:27,909 INFO L272 TraceCheckUtils]: 15: Hoare triple {782#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0))} call __VERIFIER_assert((if 0 == 1 + (main_~t~0#1 * main_~t~0#1 - 4 * main_~s~0#1 + 2 * main_~t~0#1) then 1 else 0)); {768#true} is VALID [2022-02-20 17:44:27,909 INFO L290 TraceCheckUtils]: 16: Hoare triple {768#true} ~cond := #in~cond; {768#true} is VALID [2022-02-20 17:44:27,909 INFO L290 TraceCheckUtils]: 17: Hoare triple {768#true} assume !(0 == ~cond); {768#true} is VALID [2022-02-20 17:44:27,909 INFO L290 TraceCheckUtils]: 18: Hoare triple {768#true} assume true; {768#true} is VALID [2022-02-20 17:44:27,910 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {768#true} {782#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0))} #53#return; {782#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0))} is VALID [2022-02-20 17:44:27,910 INFO L290 TraceCheckUtils]: 20: Hoare triple {782#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0))} assume !!(main_~s~0#1 <= main_~n~0#1);main_~a~0#1 := 1 + main_~a~0#1;main_~t~0#1 := 2 + main_~t~0#1;main_~s~0#1 := main_~s~0#1 + main_~t~0#1; {834#(and (= 3 |ULTIMATE.start_main_~t~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~a~0#1|) 0))} is VALID [2022-02-20 17:44:27,911 INFO L290 TraceCheckUtils]: 21: Hoare triple {834#(and (= 3 |ULTIMATE.start_main_~t~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~a~0#1|) 0))} assume !false; {834#(and (= 3 |ULTIMATE.start_main_~t~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~a~0#1|) 0))} is VALID [2022-02-20 17:44:27,911 INFO L272 TraceCheckUtils]: 22: Hoare triple {834#(and (= 3 |ULTIMATE.start_main_~t~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~a~0#1|) 0))} call __VERIFIER_assert((if main_~t~0#1 == 1 + 2 * main_~a~0#1 then 1 else 0)); {841#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:44:27,912 INFO L290 TraceCheckUtils]: 23: Hoare triple {841#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {845#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:44:27,914 INFO L290 TraceCheckUtils]: 24: Hoare triple {845#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {769#false} is VALID [2022-02-20 17:44:27,914 INFO L290 TraceCheckUtils]: 25: Hoare triple {769#false} assume !false; {769#false} is VALID [2022-02-20 17:44:27,914 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:44:27,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:44:28,039 INFO L290 TraceCheckUtils]: 25: Hoare triple {769#false} assume !false; {769#false} is VALID [2022-02-20 17:44:28,040 INFO L290 TraceCheckUtils]: 24: Hoare triple {845#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {769#false} is VALID [2022-02-20 17:44:28,040 INFO L290 TraceCheckUtils]: 23: Hoare triple {841#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {845#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:44:28,041 INFO L272 TraceCheckUtils]: 22: Hoare triple {861#(= |ULTIMATE.start_main_~t~0#1| (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)))} call __VERIFIER_assert((if main_~t~0#1 == 1 + 2 * main_~a~0#1 then 1 else 0)); {841#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:44:28,041 INFO L290 TraceCheckUtils]: 21: Hoare triple {861#(= |ULTIMATE.start_main_~t~0#1| (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)))} assume !false; {861#(= |ULTIMATE.start_main_~t~0#1| (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)))} is VALID [2022-02-20 17:44:28,042 INFO L290 TraceCheckUtils]: 20: Hoare triple {861#(= |ULTIMATE.start_main_~t~0#1| (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)))} assume !!(main_~s~0#1 <= main_~n~0#1);main_~a~0#1 := 1 + main_~a~0#1;main_~t~0#1 := 2 + main_~t~0#1;main_~s~0#1 := main_~s~0#1 + main_~t~0#1; {861#(= |ULTIMATE.start_main_~t~0#1| (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)))} is VALID [2022-02-20 17:44:28,042 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {768#true} {861#(= |ULTIMATE.start_main_~t~0#1| (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)))} #53#return; {861#(= |ULTIMATE.start_main_~t~0#1| (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)))} is VALID [2022-02-20 17:44:28,042 INFO L290 TraceCheckUtils]: 18: Hoare triple {768#true} assume true; {768#true} is VALID [2022-02-20 17:44:28,042 INFO L290 TraceCheckUtils]: 17: Hoare triple {768#true} assume !(0 == ~cond); {768#true} is VALID [2022-02-20 17:44:28,042 INFO L290 TraceCheckUtils]: 16: Hoare triple {768#true} ~cond := #in~cond; {768#true} is VALID [2022-02-20 17:44:28,042 INFO L272 TraceCheckUtils]: 15: Hoare triple {861#(= |ULTIMATE.start_main_~t~0#1| (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)))} call __VERIFIER_assert((if 0 == 1 + (main_~t~0#1 * main_~t~0#1 - 4 * main_~s~0#1 + 2 * main_~t~0#1) then 1 else 0)); {768#true} is VALID [2022-02-20 17:44:28,043 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {768#true} {861#(= |ULTIMATE.start_main_~t~0#1| (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)))} #51#return; {861#(= |ULTIMATE.start_main_~t~0#1| (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)))} is VALID [2022-02-20 17:44:28,043 INFO L290 TraceCheckUtils]: 13: Hoare triple {768#true} assume true; {768#true} is VALID [2022-02-20 17:44:28,044 INFO L290 TraceCheckUtils]: 12: Hoare triple {768#true} assume !(0 == ~cond); {768#true} is VALID [2022-02-20 17:44:28,044 INFO L290 TraceCheckUtils]: 11: Hoare triple {768#true} ~cond := #in~cond; {768#true} is VALID [2022-02-20 17:44:28,044 INFO L272 TraceCheckUtils]: 10: Hoare triple {861#(= |ULTIMATE.start_main_~t~0#1| (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)))} call __VERIFIER_assert((if main_~s~0#1 == (1 + main_~a~0#1) * (1 + main_~a~0#1) then 1 else 0)); {768#true} is VALID [2022-02-20 17:44:28,044 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {768#true} {861#(= |ULTIMATE.start_main_~t~0#1| (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)))} #49#return; {861#(= |ULTIMATE.start_main_~t~0#1| (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)))} is VALID [2022-02-20 17:44:28,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {768#true} assume true; {768#true} is VALID [2022-02-20 17:44:28,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {768#true} assume !(0 == ~cond); {768#true} is VALID [2022-02-20 17:44:28,045 INFO L290 TraceCheckUtils]: 6: Hoare triple {768#true} ~cond := #in~cond; {768#true} is VALID [2022-02-20 17:44:28,045 INFO L272 TraceCheckUtils]: 5: Hoare triple {861#(= |ULTIMATE.start_main_~t~0#1| (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)))} call __VERIFIER_assert((if main_~t~0#1 == 1 + 2 * main_~a~0#1 then 1 else 0)); {768#true} is VALID [2022-02-20 17:44:28,045 INFO L290 TraceCheckUtils]: 4: Hoare triple {861#(= |ULTIMATE.start_main_~t~0#1| (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)))} assume !false; {861#(= |ULTIMATE.start_main_~t~0#1| (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)))} is VALID [2022-02-20 17:44:28,046 INFO L290 TraceCheckUtils]: 3: Hoare triple {768#true} assume { :end_inline_assume_abort_if_not } true;main_~a~0#1 := 0;main_~s~0#1 := 1;main_~t~0#1 := 1; {861#(= |ULTIMATE.start_main_~t~0#1| (+ 1 (* 2 |ULTIMATE.start_main_~a~0#1|)))} is VALID [2022-02-20 17:44:28,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {768#true} assume !(0 == assume_abort_if_not_~cond#1); {768#true} is VALID [2022-02-20 17:44:28,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {768#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~n~0#1, main_~a~0#1, main_~s~0#1, main_~t~0#1;havoc main_~n~0#1;havoc main_~a~0#1;havoc main_~s~0#1;havoc main_~t~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~n~0#1 >= 0 && main_~n~0#1 <= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {768#true} is VALID [2022-02-20 17:44:28,046 INFO L290 TraceCheckUtils]: 0: Hoare triple {768#true} assume { :begin_inline_ULTIMATE.init } 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); {768#true} is VALID [2022-02-20 17:44:28,046 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-02-20 17:44:28,046 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:44:28,046 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837809669] [2022-02-20 17:44:28,046 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:44:28,047 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644391165] [2022-02-20 17:44:28,047 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644391165] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 17:44:28,047 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:44:28,047 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-02-20 17:44:28,047 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290606426] [2022-02-20 17:44:28,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:44:28,047 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), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-02-20 17:44:28,047 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:44:28,048 INFO L86 InductivityCheck]: Starting indutivity 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), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:44:28,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:28,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:44:28,074 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:44:28,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:44:28,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:44:28,075 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:44:28,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:28,188 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2022-02-20 17:44:28,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:44:28,189 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), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-02-20 17:44:28,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:44:28,189 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), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:44:28,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-02-20 17:44:28,190 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), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:44:28,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-02-20 17:44:28,190 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 28 transitions. [2022-02-20 17:44:28,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:28,217 INFO L225 Difference]: With dead ends: 41 [2022-02-20 17:44:28,217 INFO L226 Difference]: Without dead ends: 39 [2022-02-20 17:44:28,217 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:44:28,218 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:44:28,218 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 59 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:44:28,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-02-20 17:44:28,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-02-20 17:44:28,226 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:44:28,226 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:44:28,227 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:44:28,227 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:44:28,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:28,228 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-02-20 17:44:28,228 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-02-20 17:44:28,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:28,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:28,229 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 39 states. [2022-02-20 17:44:28,229 INFO L87 Difference]: Start difference. First operand has 39 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 39 states. [2022-02-20 17:44:28,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:28,231 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-02-20 17:44:28,231 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-02-20 17:44:28,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:28,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:28,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:44:28,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:44:28,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:44:28,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-02-20 17:44:28,233 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 26 [2022-02-20 17:44:28,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:44:28,233 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-02-20 17:44:28,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:44:28,233 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-02-20 17:44:28,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 17:44:28,234 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:44:28,234 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:44:28,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-02-20 17:44:28,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:44:28,450 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:44:28,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:44:28,451 INFO L85 PathProgramCache]: Analyzing trace with hash 682917830, now seen corresponding path program 2 times [2022-02-20 17:44:28,451 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:44:28,451 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283004916] [2022-02-20 17:44:28,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:44:28,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:44:28,460 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:44:28,460 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1358229429] [2022-02-20 17:44:28,460 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:44:28,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:44:28,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:44:28,461 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-02-20 17:44:28,462 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-02-20 17:44:28,501 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:44:28,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:44:28,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-20 17:44:28,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:44:28,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:44:28,641 INFO L290 TraceCheckUtils]: 0: Hoare triple {1119#true} assume { :begin_inline_ULTIMATE.init } 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); {1119#true} is VALID [2022-02-20 17:44:28,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {1119#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~n~0#1, main_~a~0#1, main_~s~0#1, main_~t~0#1;havoc main_~n~0#1;havoc main_~a~0#1;havoc main_~s~0#1;havoc main_~t~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~n~0#1 >= 0 && main_~n~0#1 <= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1119#true} is VALID [2022-02-20 17:44:28,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {1119#true} assume !(0 == assume_abort_if_not_~cond#1); {1119#true} is VALID [2022-02-20 17:44:28,642 INFO L290 TraceCheckUtils]: 3: Hoare triple {1119#true} assume { :end_inline_assume_abort_if_not } true;main_~a~0#1 := 0;main_~s~0#1 := 1;main_~t~0#1 := 1; {1133#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:44:28,642 INFO L290 TraceCheckUtils]: 4: Hoare triple {1133#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} assume !false; {1133#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:44:28,642 INFO L272 TraceCheckUtils]: 5: Hoare triple {1133#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} call __VERIFIER_assert((if main_~t~0#1 == 1 + 2 * main_~a~0#1 then 1 else 0)); {1119#true} is VALID [2022-02-20 17:44:28,642 INFO L290 TraceCheckUtils]: 6: Hoare triple {1119#true} ~cond := #in~cond; {1119#true} is VALID [2022-02-20 17:44:28,643 INFO L290 TraceCheckUtils]: 7: Hoare triple {1119#true} assume !(0 == ~cond); {1119#true} is VALID [2022-02-20 17:44:28,643 INFO L290 TraceCheckUtils]: 8: Hoare triple {1119#true} assume true; {1119#true} is VALID [2022-02-20 17:44:28,644 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1119#true} {1133#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} #49#return; {1133#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:44:28,644 INFO L272 TraceCheckUtils]: 10: Hoare triple {1133#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} call __VERIFIER_assert((if main_~s~0#1 == (1 + main_~a~0#1) * (1 + main_~a~0#1) then 1 else 0)); {1119#true} is VALID [2022-02-20 17:44:28,644 INFO L290 TraceCheckUtils]: 11: Hoare triple {1119#true} ~cond := #in~cond; {1119#true} is VALID [2022-02-20 17:44:28,644 INFO L290 TraceCheckUtils]: 12: Hoare triple {1119#true} assume !(0 == ~cond); {1119#true} is VALID [2022-02-20 17:44:28,644 INFO L290 TraceCheckUtils]: 13: Hoare triple {1119#true} assume true; {1119#true} is VALID [2022-02-20 17:44:28,652 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1119#true} {1133#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} #51#return; {1133#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:44:28,652 INFO L272 TraceCheckUtils]: 15: Hoare triple {1133#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} call __VERIFIER_assert((if 0 == 1 + (main_~t~0#1 * main_~t~0#1 - 4 * main_~s~0#1 + 2 * main_~t~0#1) then 1 else 0)); {1119#true} is VALID [2022-02-20 17:44:28,652 INFO L290 TraceCheckUtils]: 16: Hoare triple {1119#true} ~cond := #in~cond; {1119#true} is VALID [2022-02-20 17:44:28,652 INFO L290 TraceCheckUtils]: 17: Hoare triple {1119#true} assume !(0 == ~cond); {1119#true} is VALID [2022-02-20 17:44:28,652 INFO L290 TraceCheckUtils]: 18: Hoare triple {1119#true} assume true; {1119#true} is VALID [2022-02-20 17:44:28,652 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1119#true} {1133#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} #53#return; {1133#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} is VALID [2022-02-20 17:44:28,653 INFO L290 TraceCheckUtils]: 20: Hoare triple {1133#(and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| 0) (= |ULTIMATE.start_main_~s~0#1| 1))} assume !!(main_~s~0#1 <= main_~n~0#1);main_~a~0#1 := 1 + main_~a~0#1;main_~t~0#1 := 2 + main_~t~0#1;main_~s~0#1 := main_~s~0#1 + main_~t~0#1; {1185#(and (= (+ (- 3) |ULTIMATE.start_main_~s~0#1|) 1) (= |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-20 17:44:28,653 INFO L290 TraceCheckUtils]: 21: Hoare triple {1185#(and (= (+ (- 3) |ULTIMATE.start_main_~s~0#1|) 1) (= |ULTIMATE.start_main_~a~0#1| 1))} assume !false; {1185#(and (= (+ (- 3) |ULTIMATE.start_main_~s~0#1|) 1) (= |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-20 17:44:28,653 INFO L272 TraceCheckUtils]: 22: Hoare triple {1185#(and (= (+ (- 3) |ULTIMATE.start_main_~s~0#1|) 1) (= |ULTIMATE.start_main_~a~0#1| 1))} call __VERIFIER_assert((if main_~t~0#1 == 1 + 2 * main_~a~0#1 then 1 else 0)); {1119#true} is VALID [2022-02-20 17:44:28,653 INFO L290 TraceCheckUtils]: 23: Hoare triple {1119#true} ~cond := #in~cond; {1119#true} is VALID [2022-02-20 17:44:28,654 INFO L290 TraceCheckUtils]: 24: Hoare triple {1119#true} assume !(0 == ~cond); {1119#true} is VALID [2022-02-20 17:44:28,654 INFO L290 TraceCheckUtils]: 25: Hoare triple {1119#true} assume true; {1119#true} is VALID [2022-02-20 17:44:28,654 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1119#true} {1185#(and (= (+ (- 3) |ULTIMATE.start_main_~s~0#1|) 1) (= |ULTIMATE.start_main_~a~0#1| 1))} #49#return; {1185#(and (= (+ (- 3) |ULTIMATE.start_main_~s~0#1|) 1) (= |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-20 17:44:28,655 INFO L272 TraceCheckUtils]: 27: Hoare triple {1185#(and (= (+ (- 3) |ULTIMATE.start_main_~s~0#1|) 1) (= |ULTIMATE.start_main_~a~0#1| 1))} call __VERIFIER_assert((if main_~s~0#1 == (1 + main_~a~0#1) * (1 + main_~a~0#1) then 1 else 0)); {1207#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:44:28,655 INFO L290 TraceCheckUtils]: 28: Hoare triple {1207#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1211#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:44:28,655 INFO L290 TraceCheckUtils]: 29: Hoare triple {1211#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1120#false} is VALID [2022-02-20 17:44:28,655 INFO L290 TraceCheckUtils]: 30: Hoare triple {1120#false} assume !false; {1120#false} is VALID [2022-02-20 17:44:28,655 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 17:44:28,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:44:28,787 INFO L290 TraceCheckUtils]: 30: Hoare triple {1120#false} assume !false; {1120#false} is VALID [2022-02-20 17:44:28,787 INFO L290 TraceCheckUtils]: 29: Hoare triple {1211#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1120#false} is VALID [2022-02-20 17:44:28,788 INFO L290 TraceCheckUtils]: 28: Hoare triple {1207#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1211#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:44:28,788 INFO L272 TraceCheckUtils]: 27: Hoare triple {1227#(= (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~a~0#1|) 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~s~0#1|)} call __VERIFIER_assert((if main_~s~0#1 == (1 + main_~a~0#1) * (1 + main_~a~0#1) then 1 else 0)); {1207#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:44:28,789 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1119#true} {1227#(= (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~a~0#1|) 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~s~0#1|)} #49#return; {1227#(= (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~a~0#1|) 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~s~0#1|)} is VALID [2022-02-20 17:44:28,789 INFO L290 TraceCheckUtils]: 25: Hoare triple {1119#true} assume true; {1119#true} is VALID [2022-02-20 17:44:28,789 INFO L290 TraceCheckUtils]: 24: Hoare triple {1119#true} assume !(0 == ~cond); {1119#true} is VALID [2022-02-20 17:44:28,789 INFO L290 TraceCheckUtils]: 23: Hoare triple {1119#true} ~cond := #in~cond; {1119#true} is VALID [2022-02-20 17:44:28,789 INFO L272 TraceCheckUtils]: 22: Hoare triple {1227#(= (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~a~0#1|) 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~s~0#1|)} call __VERIFIER_assert((if main_~t~0#1 == 1 + 2 * main_~a~0#1 then 1 else 0)); {1119#true} is VALID [2022-02-20 17:44:28,790 INFO L290 TraceCheckUtils]: 21: Hoare triple {1227#(= (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~a~0#1|) 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~s~0#1|)} assume !false; {1227#(= (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~a~0#1|) 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~s~0#1|)} is VALID [2022-02-20 17:44:28,801 INFO L290 TraceCheckUtils]: 20: Hoare triple {1249#(= (+ 2 |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~t~0#1|) (+ 3 (* (+ |ULTIMATE.start_main_~a~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1)) (* 2 |ULTIMATE.start_main_~a~0#1|)))} assume !!(main_~s~0#1 <= main_~n~0#1);main_~a~0#1 := 1 + main_~a~0#1;main_~t~0#1 := 2 + main_~t~0#1;main_~s~0#1 := main_~s~0#1 + main_~t~0#1; {1227#(= (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~a~0#1|) 1 (* 2 |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~s~0#1|)} is VALID [2022-02-20 17:44:28,802 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1119#true} {1249#(= (+ 2 |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~t~0#1|) (+ 3 (* (+ |ULTIMATE.start_main_~a~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1)) (* 2 |ULTIMATE.start_main_~a~0#1|)))} #53#return; {1249#(= (+ 2 |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~t~0#1|) (+ 3 (* (+ |ULTIMATE.start_main_~a~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1)) (* 2 |ULTIMATE.start_main_~a~0#1|)))} is VALID [2022-02-20 17:44:28,802 INFO L290 TraceCheckUtils]: 18: Hoare triple {1119#true} assume true; {1119#true} is VALID [2022-02-20 17:44:28,803 INFO L290 TraceCheckUtils]: 17: Hoare triple {1119#true} assume !(0 == ~cond); {1119#true} is VALID [2022-02-20 17:44:28,803 INFO L290 TraceCheckUtils]: 16: Hoare triple {1119#true} ~cond := #in~cond; {1119#true} is VALID [2022-02-20 17:44:28,803 INFO L272 TraceCheckUtils]: 15: Hoare triple {1249#(= (+ 2 |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~t~0#1|) (+ 3 (* (+ |ULTIMATE.start_main_~a~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1)) (* 2 |ULTIMATE.start_main_~a~0#1|)))} call __VERIFIER_assert((if 0 == 1 + (main_~t~0#1 * main_~t~0#1 - 4 * main_~s~0#1 + 2 * main_~t~0#1) then 1 else 0)); {1119#true} is VALID [2022-02-20 17:44:28,803 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1119#true} {1249#(= (+ 2 |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~t~0#1|) (+ 3 (* (+ |ULTIMATE.start_main_~a~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1)) (* 2 |ULTIMATE.start_main_~a~0#1|)))} #51#return; {1249#(= (+ 2 |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~t~0#1|) (+ 3 (* (+ |ULTIMATE.start_main_~a~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1)) (* 2 |ULTIMATE.start_main_~a~0#1|)))} is VALID [2022-02-20 17:44:28,803 INFO L290 TraceCheckUtils]: 13: Hoare triple {1119#true} assume true; {1119#true} is VALID [2022-02-20 17:44:28,804 INFO L290 TraceCheckUtils]: 12: Hoare triple {1119#true} assume !(0 == ~cond); {1119#true} is VALID [2022-02-20 17:44:28,804 INFO L290 TraceCheckUtils]: 11: Hoare triple {1119#true} ~cond := #in~cond; {1119#true} is VALID [2022-02-20 17:44:28,804 INFO L272 TraceCheckUtils]: 10: Hoare triple {1249#(= (+ 2 |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~t~0#1|) (+ 3 (* (+ |ULTIMATE.start_main_~a~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1)) (* 2 |ULTIMATE.start_main_~a~0#1|)))} call __VERIFIER_assert((if main_~s~0#1 == (1 + main_~a~0#1) * (1 + main_~a~0#1) then 1 else 0)); {1119#true} is VALID [2022-02-20 17:44:28,804 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1119#true} {1249#(= (+ 2 |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~t~0#1|) (+ 3 (* (+ |ULTIMATE.start_main_~a~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1)) (* 2 |ULTIMATE.start_main_~a~0#1|)))} #49#return; {1249#(= (+ 2 |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~t~0#1|) (+ 3 (* (+ |ULTIMATE.start_main_~a~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1)) (* 2 |ULTIMATE.start_main_~a~0#1|)))} is VALID [2022-02-20 17:44:28,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {1119#true} assume true; {1119#true} is VALID [2022-02-20 17:44:28,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {1119#true} assume !(0 == ~cond); {1119#true} is VALID [2022-02-20 17:44:28,805 INFO L290 TraceCheckUtils]: 6: Hoare triple {1119#true} ~cond := #in~cond; {1119#true} is VALID [2022-02-20 17:44:28,805 INFO L272 TraceCheckUtils]: 5: Hoare triple {1249#(= (+ 2 |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~t~0#1|) (+ 3 (* (+ |ULTIMATE.start_main_~a~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1)) (* 2 |ULTIMATE.start_main_~a~0#1|)))} call __VERIFIER_assert((if main_~t~0#1 == 1 + 2 * main_~a~0#1 then 1 else 0)); {1119#true} is VALID [2022-02-20 17:44:28,806 INFO L290 TraceCheckUtils]: 4: Hoare triple {1249#(= (+ 2 |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~t~0#1|) (+ 3 (* (+ |ULTIMATE.start_main_~a~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1)) (* 2 |ULTIMATE.start_main_~a~0#1|)))} assume !false; {1249#(= (+ 2 |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~t~0#1|) (+ 3 (* (+ |ULTIMATE.start_main_~a~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1)) (* 2 |ULTIMATE.start_main_~a~0#1|)))} is VALID [2022-02-20 17:44:28,806 INFO L290 TraceCheckUtils]: 3: Hoare triple {1119#true} assume { :end_inline_assume_abort_if_not } true;main_~a~0#1 := 0;main_~s~0#1 := 1;main_~t~0#1 := 1; {1249#(= (+ 2 |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~t~0#1|) (+ 3 (* (+ |ULTIMATE.start_main_~a~0#1| 1) (+ |ULTIMATE.start_main_~a~0#1| 1)) (* 2 |ULTIMATE.start_main_~a~0#1|)))} is VALID [2022-02-20 17:44:28,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {1119#true} assume !(0 == assume_abort_if_not_~cond#1); {1119#true} is VALID [2022-02-20 17:44:28,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {1119#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~n~0#1, main_~a~0#1, main_~s~0#1, main_~t~0#1;havoc main_~n~0#1;havoc main_~a~0#1;havoc main_~s~0#1;havoc main_~t~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~n~0#1 >= 0 && main_~n~0#1 <= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1119#true} is VALID [2022-02-20 17:44:28,806 INFO L290 TraceCheckUtils]: 0: Hoare triple {1119#true} assume { :begin_inline_ULTIMATE.init } 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); {1119#true} is VALID [2022-02-20 17:44:28,807 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 17:44:28,807 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:44:28,807 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283004916] [2022-02-20 17:44:28,807 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:44:28,807 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358229429] [2022-02-20 17:44:28,807 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358229429] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:44:28,807 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:44:28,807 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-02-20 17:44:28,808 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164320422] [2022-02-20 17:44:28,808 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:44:28,808 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 31 [2022-02-20 17:44:28,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:44:28,809 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 17:44:28,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:28,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:44:28,839 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:44:28,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:44:28,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:44:28,839 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 17:44:29,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:29,185 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-02-20 17:44:29,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:44:29,185 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 31 [2022-02-20 17:44:29,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:44:29,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 17:44:29,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2022-02-20 17:44:29,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 17:44:29,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2022-02-20 17:44:29,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 45 transitions. [2022-02-20 17:44:29,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:29,229 INFO L225 Difference]: With dead ends: 47 [2022-02-20 17:44:29,230 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 17:44:29,230 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:44:29,230 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 10 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:44:29,231 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 63 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 17:44:29,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 17:44:29,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 17:44:29,231 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:44:29,231 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-02-20 17:44:29,231 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-02-20 17:44:29,231 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-02-20 17:44:29,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:29,231 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:44:29,231 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:44:29,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:29,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:29,232 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-02-20 17:44:29,232 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-02-20 17:44:29,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:29,232 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:44:29,232 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:44:29,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:29,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:29,232 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:44:29,232 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:44:29,232 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-02-20 17:44:29,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 17:44:29,232 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2022-02-20 17:44:29,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:44:29,232 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 17:44:29,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 17:44:29,232 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:44:29,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:29,234 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:44:29,257 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-02-20 17:44:29,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:44:29,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 17:44:29,569 INFO L858 garLoopResultBuilder]: For program point L33(lines 30 42) no Hoare annotation was computed. [2022-02-20 17:44:29,569 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 17:44:29,569 INFO L854 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: (let ((.cse0 (* 2 |ULTIMATE.start_main_~a~0#1|))) (and (= |ULTIMATE.start_main_~t~0#1| (+ 1 .cse0)) (= (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~a~0#1|) 1 .cse0) |ULTIMATE.start_main_~s~0#1|))) [2022-02-20 17:44:29,569 INFO L854 garLoopResultBuilder]: At program point L31-1(line 31) the Hoare annotation is: (let ((.cse0 (* 2 |ULTIMATE.start_main_~a~0#1|))) (and (= |ULTIMATE.start_main_~t~0#1| (+ 1 .cse0)) (= (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~a~0#1|) 1 .cse0) |ULTIMATE.start_main_~s~0#1|))) [2022-02-20 17:44:29,569 INFO L861 garLoopResultBuilder]: At program point L48(lines 20 49) the Hoare annotation is: true [2022-02-20 17:44:29,569 INFO L858 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2022-02-20 17:44:29,570 INFO L854 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: (let ((.cse0 (* 2 |ULTIMATE.start_main_~a~0#1|))) (and (= |ULTIMATE.start_main_~t~0#1| (+ 1 .cse0)) (= (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~a~0#1|) 1 .cse0) |ULTIMATE.start_main_~s~0#1|))) [2022-02-20 17:44:29,570 INFO L858 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2022-02-20 17:44:29,570 INFO L854 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: (let ((.cse0 (* 2 |ULTIMATE.start_main_~a~0#1|))) (and (= |ULTIMATE.start_main_~t~0#1| (+ 1 .cse0)) (= (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~a~0#1|) 1 .cse0) |ULTIMATE.start_main_~s~0#1|))) [2022-02-20 17:44:29,570 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 17:44:29,570 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 17:44:29,570 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 17:44:29,570 INFO L854 garLoopResultBuilder]: At program point L30-2(lines 30 42) the Hoare annotation is: (let ((.cse0 (* 2 |ULTIMATE.start_main_~a~0#1|))) (and (= |ULTIMATE.start_main_~t~0#1| (+ 1 .cse0)) (= (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~a~0#1|) 1 .cse0) |ULTIMATE.start_main_~s~0#1|))) [2022-02-20 17:44:29,570 INFO L854 garLoopResultBuilder]: At program point L30-3(lines 30 42) the Hoare annotation is: (let ((.cse0 (* 2 |ULTIMATE.start_main_~a~0#1|))) (and (= |ULTIMATE.start_main_~t~0#1| (+ 1 .cse0)) (= (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~a~0#1|) 1 .cse0) |ULTIMATE.start_main_~s~0#1|))) [2022-02-20 17:44:29,570 INFO L854 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (or (let ((.cse0 (* 2 |ULTIMATE.start_main_~a~0#1|))) (and (= |ULTIMATE.start_main_~t~0#1| (+ 1 .cse0)) (= (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~a~0#1|) 1 .cse0) |ULTIMATE.start_main_~s~0#1|))) (and (= |ULTIMATE.start_main_~t~0#1| 1) (= |ULTIMATE.start_main_~s~0#1| 1))) [2022-02-20 17:44:29,570 INFO L858 garLoopResultBuilder]: For program point L8(lines 8 10) no Hoare annotation was computed. [2022-02-20 17:44:29,570 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-02-20 17:44:29,570 INFO L858 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2022-02-20 17:44:29,570 INFO L858 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2022-02-20 17:44:29,570 INFO L858 garLoopResultBuilder]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2022-02-20 17:44:29,570 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2022-02-20 17:44:29,570 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-02-20 17:44:29,572 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2022-02-20 17:44:29,573 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:44:29,575 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 17:44:29,575 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-20 17:44:29,575 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 17:44:29,575 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-20 17:44:29,575 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-20 17:44:29,575 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-02-20 17:44:29,575 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-02-20 17:44:29,575 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-20 17:44:29,575 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-20 17:44:29,575 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-02-20 17:44:29,575 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-02-20 17:44:29,575 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:44:29,576 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:44:29,576 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:44:29,576 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:44:29,576 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:44:29,576 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:44:29,577 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-02-20 17:44:29,577 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-02-20 17:44:29,577 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-02-20 17:44:29,577 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-02-20 17:44:29,577 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-02-20 17:44:29,577 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:44:29,577 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:44:29,577 INFO L163 areAnnotationChecker]: CFG has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 17:44:29,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 05:44:29 BoogieIcfgContainer [2022-02-20 17:44:29,583 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 17:44:29,583 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 17:44:29,583 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 17:44:29,583 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 17:44:29,583 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:44:25" (3/4) ... [2022-02-20 17:44:29,585 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 17:44:29,589 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-02-20 17:44:29,591 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2022-02-20 17:44:29,591 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 17:44:29,591 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 17:44:29,591 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 17:44:29,610 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 17:44:29,610 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 17:44:29,611 INFO L158 Benchmark]: Toolchain (without parser) took 4384.21ms. Allocated memory was 142.6MB in the beginning and 172.0MB in the end (delta: 29.4MB). Free memory was 110.6MB in the beginning and 115.7MB in the end (delta: -5.1MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. [2022-02-20 17:44:29,612 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 81.8MB. Free memory was 40.8MB in the beginning and 40.8MB in the end (delta: 42.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:44:29,612 INFO L158 Benchmark]: CACSL2BoogieTranslator took 162.39ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 116.9MB in the end (delta: -6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 17:44:29,612 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.86ms. Allocated memory is still 142.6MB. Free memory was 116.9MB in the beginning and 115.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:44:29,612 INFO L158 Benchmark]: Boogie Preprocessor took 12.49ms. Allocated memory is still 142.6MB. Free memory was 115.4MB in the beginning and 114.5MB in the end (delta: 936.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:44:29,612 INFO L158 Benchmark]: RCFGBuilder took 250.93ms. Allocated memory is still 142.6MB. Free memory was 114.5MB in the beginning and 103.3MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 17:44:29,613 INFO L158 Benchmark]: TraceAbstraction took 3904.13ms. Allocated memory was 142.6MB in the beginning and 172.0MB in the end (delta: 29.4MB). Free memory was 102.9MB in the beginning and 118.9MB in the end (delta: -16.0MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2022-02-20 17:44:29,613 INFO L158 Benchmark]: Witness Printer took 27.50ms. Allocated memory is still 172.0MB. Free memory was 118.9MB in the beginning and 115.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:44:29,614 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.19ms. Allocated memory is still 81.8MB. Free memory was 40.8MB in the beginning and 40.8MB in the end (delta: 42.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 162.39ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 116.9MB in the end (delta: -6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.86ms. Allocated memory is still 142.6MB. Free memory was 116.9MB in the beginning and 115.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 12.49ms. Allocated memory is still 142.6MB. Free memory was 115.4MB in the beginning and 114.5MB in the end (delta: 936.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 250.93ms. Allocated memory is still 142.6MB. Free memory was 114.5MB in the beginning and 103.3MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3904.13ms. Allocated memory was 142.6MB in the beginning and 172.0MB in the end (delta: 29.4MB). Free memory was 102.9MB in the beginning and 118.9MB in the end (delta: -16.0MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. * Witness Printer took 27.50ms. Allocated memory is still 172.0MB. Free memory was 118.9MB in the beginning and 115.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * 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 2 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 6, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 49 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 35 mSDsluCounter, 398 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 263 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 181 IncrementalHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 135 mSDtfsCounter, 181 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 155 GetRequests, 125 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=5, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 32 PreInvPairs, 54 NumberOfFragments, 136 HoareAnnotationTreeSize, 32 FomulaSimplifications, 5 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 451 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 108 NumberOfCodeBlocks, 108 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 157 ConstructedInterpolants, 0 QuantifiedInterpolants, 513 SizeOfPredicates, 5 NumberOfNonLiveVariables, 298 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 112/120 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: t == 1 + 2 * a && a * a + 1 + 2 * a == s - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-02-20 17:44:29,643 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE