./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/psyco/psyco_security.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/psyco/psyco_security.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 c03d27deb00d6c25e1f99c43455f6da27475e88a721be2a7236bfffedf5da1e8 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:07:58,305 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:07:58,307 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:07:58,339 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:07:58,342 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:07:58,343 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:07:58,344 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:07:58,346 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:07:58,347 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:07:58,348 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:07:58,349 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:07:58,350 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:07:58,350 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:07:58,351 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:07:58,352 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:07:58,353 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:07:58,354 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:07:58,355 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:07:58,357 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:07:58,359 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:07:58,360 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:07:58,361 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:07:58,363 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:07:58,363 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:07:58,366 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:07:58,366 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:07:58,367 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:07:58,368 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:07:58,368 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:07:58,369 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:07:58,369 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:07:58,370 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:07:58,371 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:07:58,371 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:07:58,372 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:07:58,373 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:07:58,373 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:07:58,373 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:07:58,374 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:07:58,375 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:07:58,375 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:07:58,376 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:07:58,401 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:07:58,404 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:07:58,405 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:07:58,405 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:07:58,406 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:07:58,406 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:07:58,407 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:07:58,407 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:07:58,407 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:07:58,407 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:07:58,408 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:07:58,408 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:07:58,409 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:07:58,409 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:07:58,409 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:07:58,409 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:07:58,409 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:07:58,410 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:07:58,410 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:07:58,410 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:07:58,410 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:07:58,410 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:07:58,411 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:07:58,411 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:07:58,411 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:07:58,411 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:07:58,412 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:07:58,412 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:07:58,412 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:07:58,412 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:07:58,412 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:07:58,412 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:07:58,413 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:07:58,413 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 -> c03d27deb00d6c25e1f99c43455f6da27475e88a721be2a7236bfffedf5da1e8 [2022-02-20 16:07:58,674 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:07:58,692 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:07:58,695 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:07:58,696 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:07:58,697 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:07:58,698 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/psyco/psyco_security.c [2022-02-20 16:07:58,764 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8a4b421e/0506f3358b954d9794f72785fb112840/FLAGc12bc1971 [2022-02-20 16:07:59,197 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:07:59,198 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_security.c [2022-02-20 16:07:59,209 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8a4b421e/0506f3358b954d9794f72785fb112840/FLAGc12bc1971 [2022-02-20 16:07:59,610 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8a4b421e/0506f3358b954d9794f72785fb112840 [2022-02-20 16:07:59,612 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:07:59,614 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:07:59,615 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:07:59,615 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:07:59,618 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:07:59,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:07:59" (1/1) ... [2022-02-20 16:07:59,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28d28c5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:07:59, skipping insertion in model container [2022-02-20 16:07:59,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:07:59" (1/1) ... [2022-02-20 16:07:59,626 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:07:59,655 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:07:59,832 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/psyco/psyco_security.c[12744,12757] [2022-02-20 16:07:59,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:07:59,849 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:07:59,906 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/psyco/psyco_security.c[12744,12757] [2022-02-20 16:07:59,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:07:59,923 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:07:59,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:07:59 WrapperNode [2022-02-20 16:07:59,925 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:07:59,926 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:07:59,926 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:07:59,927 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:07:59,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:07:59" (1/1) ... [2022-02-20 16:07:59,948 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:07:59" (1/1) ... [2022-02-20 16:07:59,986 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 269 [2022-02-20 16:07:59,994 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:07:59,995 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:07:59,995 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:07:59,995 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:08:00,003 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:07:59" (1/1) ... [2022-02-20 16:08:00,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:07:59" (1/1) ... [2022-02-20 16:08:00,013 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:07:59" (1/1) ... [2022-02-20 16:08:00,014 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:07:59" (1/1) ... [2022-02-20 16:08:00,018 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:07:59" (1/1) ... [2022-02-20 16:08:00,032 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:07:59" (1/1) ... [2022-02-20 16:08:00,033 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:07:59" (1/1) ... [2022-02-20 16:08:00,035 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:08:00,036 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:08:00,036 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:08:00,036 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:08:00,041 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:07:59" (1/1) ... [2022-02-20 16:08:00,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:08:00,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:08:00,073 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 16:08:00,095 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 16:08:00,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:08:00,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:08:00,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:08:00,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:08:00,173 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:08:00,174 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:08:00,516 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:08:00,523 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:08:00,523 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2022-02-20 16:08:00,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:08:00 BoogieIcfgContainer [2022-02-20 16:08:00,525 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:08:00,527 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:08:00,533 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:08:00,546 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:08:00,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:07:59" (1/3) ... [2022-02-20 16:08:00,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12f87ae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:08:00, skipping insertion in model container [2022-02-20 16:08:00,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:07:59" (2/3) ... [2022-02-20 16:08:00,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12f87ae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:08:00, skipping insertion in model container [2022-02-20 16:08:00,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:08:00" (3/3) ... [2022-02-20 16:08:00,549 INFO L111 eAbstractionObserver]: Analyzing ICFG psyco_security.c [2022-02-20 16:08:00,567 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:08:00,567 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:08:00,632 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:08:00,639 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 16:08:00,639 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:08:00,669 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 76 states have (on average 1.9342105263157894) internal successors, (147), 77 states have internal predecessors, (147), 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 16:08:00,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 16:08:00,675 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:08:00,675 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:08:00,676 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:08:00,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:08:00,681 INFO L85 PathProgramCache]: Analyzing trace with hash 352571364, now seen corresponding path program 1 times [2022-02-20 16:08:00,690 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:08:00,690 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14351352] [2022-02-20 16:08:00,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:08:00,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:08:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:08:00,812 INFO L290 TraceCheckUtils]: 0: Hoare triple {81#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(17, 2);call #Ultimate.allocInit(12, 3);~m_initSign~0 := 1;~m_initVerify~0 := 2;~m_Signature~0 := 3;~m_sign~0 := 4;~m_verify~0 := 5;~m_update~0 := 6; {81#true} is VALID [2022-02-20 16:08:00,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {81#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~q~0#1, main_~method_id~0#1, main_~this_state~0#1;main_~q~0#1 := 0;havoc main_~method_id~0#1;main_~this_state~0#1 := 0; {81#true} is VALID [2022-02-20 16:08:00,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {81#true} goto; {81#true} is VALID [2022-02-20 16:08:00,813 INFO L290 TraceCheckUtils]: 3: Hoare triple {81#true} assume !false; {81#true} is VALID [2022-02-20 16:08:00,813 INFO L290 TraceCheckUtils]: 4: Hoare triple {81#true} assume 0 == main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {81#true} is VALID [2022-02-20 16:08:00,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {81#true} assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1; {81#true} is VALID [2022-02-20 16:08:00,814 INFO L290 TraceCheckUtils]: 6: Hoare triple {81#true} main_~method_id~0#1 := 3; {81#true} is VALID [2022-02-20 16:08:00,815 INFO L290 TraceCheckUtils]: 7: Hoare triple {81#true} assume false; {82#false} is VALID [2022-02-20 16:08:00,815 INFO L290 TraceCheckUtils]: 8: Hoare triple {82#false} assume !false; {82#false} is VALID [2022-02-20 16:08:00,817 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 16:08:00,817 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:08:00,817 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14351352] [2022-02-20 16:08:00,818 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14351352] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:08:00,818 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:08:00,819 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:08:00,820 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813078852] [2022-02-20 16:08:00,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:08:00,825 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) Word has length 9 [2022-02-20 16:08:00,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:08:00,829 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 16:08:00,841 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 16:08:00,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:08:00,842 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:08:00,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:08:00,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:08:00,866 INFO L87 Difference]: Start difference. First operand has 78 states, 76 states have (on average 1.9342105263157894) internal successors, (147), 77 states have internal predecessors, (147), 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 has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 16:08:01,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:08:01,011 INFO L93 Difference]: Finished difference Result 154 states and 292 transitions. [2022-02-20 16:08:01,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:08:01,011 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) Word has length 9 [2022-02-20 16:08:01,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:08:01,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 16:08:01,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 292 transitions. [2022-02-20 16:08:01,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 16:08:01,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 292 transitions. [2022-02-20 16:08:01,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 292 transitions. [2022-02-20 16:08:01,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 292 edges. 292 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:08:01,314 INFO L225 Difference]: With dead ends: 154 [2022-02-20 16:08:01,314 INFO L226 Difference]: Without dead ends: 74 [2022-02-20 16:08:01,317 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 16:08:01,323 INFO L933 BasicCegarLoop]: 120 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, 120 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 16:08:01,325 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:08:01,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-02-20 16:08:01,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-02-20 16:08:01,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:08:01,359 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 74 states, 73 states have (on average 1.4931506849315068) internal successors, (109), 73 states have internal predecessors, (109), 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 16:08:01,360 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 74 states, 73 states have (on average 1.4931506849315068) internal successors, (109), 73 states have internal predecessors, (109), 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 16:08:01,360 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 74 states, 73 states have (on average 1.4931506849315068) internal successors, (109), 73 states have internal predecessors, (109), 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 16:08:01,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:08:01,364 INFO L93 Difference]: Finished difference Result 74 states and 109 transitions. [2022-02-20 16:08:01,364 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 109 transitions. [2022-02-20 16:08:01,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:08:01,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:08:01,365 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 73 states have (on average 1.4931506849315068) internal successors, (109), 73 states have internal predecessors, (109), 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 74 states. [2022-02-20 16:08:01,366 INFO L87 Difference]: Start difference. First operand has 74 states, 73 states have (on average 1.4931506849315068) internal successors, (109), 73 states have internal predecessors, (109), 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 74 states. [2022-02-20 16:08:01,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:08:01,375 INFO L93 Difference]: Finished difference Result 74 states and 109 transitions. [2022-02-20 16:08:01,380 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 109 transitions. [2022-02-20 16:08:01,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:08:01,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:08:01,382 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:08:01,382 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:08:01,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.4931506849315068) internal successors, (109), 73 states have internal predecessors, (109), 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 16:08:01,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 109 transitions. [2022-02-20 16:08:01,391 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 109 transitions. Word has length 9 [2022-02-20 16:08:01,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:08:01,392 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 109 transitions. [2022-02-20 16:08:01,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 16:08:01,392 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 109 transitions. [2022-02-20 16:08:01,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:08:01,393 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:08:01,393 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:08:01,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:08:01,394 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:08:01,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:08:01,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1422697708, now seen corresponding path program 1 times [2022-02-20 16:08:01,395 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:08:01,395 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382297028] [2022-02-20 16:08:01,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:08:01,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:08:01,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:08:01,426 INFO L290 TraceCheckUtils]: 0: Hoare triple {472#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(17, 2);call #Ultimate.allocInit(12, 3);~m_initSign~0 := 1;~m_initVerify~0 := 2;~m_Signature~0 := 3;~m_sign~0 := 4;~m_verify~0 := 5;~m_update~0 := 6; {472#true} is VALID [2022-02-20 16:08:01,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {472#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~q~0#1, main_~method_id~0#1, main_~this_state~0#1;main_~q~0#1 := 0;havoc main_~method_id~0#1;main_~this_state~0#1 := 0; {474#(= |ULTIMATE.start_main_~q~0#1| 0)} is VALID [2022-02-20 16:08:01,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {474#(= |ULTIMATE.start_main_~q~0#1| 0)} goto; {474#(= |ULTIMATE.start_main_~q~0#1| 0)} is VALID [2022-02-20 16:08:01,440 INFO L290 TraceCheckUtils]: 3: Hoare triple {474#(= |ULTIMATE.start_main_~q~0#1| 0)} assume !false; {474#(= |ULTIMATE.start_main_~q~0#1| 0)} is VALID [2022-02-20 16:08:01,440 INFO L290 TraceCheckUtils]: 4: Hoare triple {474#(= |ULTIMATE.start_main_~q~0#1| 0)} assume !(0 == main_~q~0#1); {473#false} is VALID [2022-02-20 16:08:01,441 INFO L290 TraceCheckUtils]: 5: Hoare triple {473#false} assume 1 == main_~q~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {473#false} is VALID [2022-02-20 16:08:01,441 INFO L290 TraceCheckUtils]: 6: Hoare triple {473#false} assume 0 != main_#t~nondet5#1;havoc main_#t~nondet5#1; {473#false} is VALID [2022-02-20 16:08:01,441 INFO L290 TraceCheckUtils]: 7: Hoare triple {473#false} main_~method_id~0#1 := 4; {473#false} is VALID [2022-02-20 16:08:01,441 INFO L290 TraceCheckUtils]: 8: Hoare triple {473#false} assume 2 == main_~this_state~0#1; {473#false} is VALID [2022-02-20 16:08:01,442 INFO L290 TraceCheckUtils]: 9: Hoare triple {473#false} assume !false; {473#false} is VALID [2022-02-20 16:08:01,442 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 16:08:01,442 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:08:01,442 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382297028] [2022-02-20 16:08:01,443 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382297028] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:08:01,443 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:08:01,443 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:08:01,443 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478304098] [2022-02-20 16:08:01,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:08:01,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) Word has length 10 [2022-02-20 16:08:01,445 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:08:01,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 16:08:01,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:08:01,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:08:01,454 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:08:01,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:08:01,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:08:01,455 INFO L87 Difference]: Start difference. First operand 74 states and 109 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 16:08:01,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:08:01,586 INFO L93 Difference]: Finished difference Result 149 states and 220 transitions. [2022-02-20 16:08:01,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:08:01,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) Word has length 10 [2022-02-20 16:08:01,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:08:01,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 16:08:01,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 220 transitions. [2022-02-20 16:08:01,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 16:08:01,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 220 transitions. [2022-02-20 16:08:01,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 220 transitions. [2022-02-20 16:08:01,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 220 edges. 220 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:08:01,791 INFO L225 Difference]: With dead ends: 149 [2022-02-20 16:08:01,792 INFO L226 Difference]: Without dead ends: 77 [2022-02-20 16:08:01,792 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:08:01,794 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 4 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:08:01,794 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 190 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:08:01,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-02-20 16:08:01,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-02-20 16:08:01,800 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:08:01,800 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 77 states, 76 states have (on average 1.4736842105263157) internal successors, (112), 76 states have internal predecessors, (112), 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 16:08:01,800 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 77 states, 76 states have (on average 1.4736842105263157) internal successors, (112), 76 states have internal predecessors, (112), 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 16:08:01,801 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 77 states, 76 states have (on average 1.4736842105263157) internal successors, (112), 76 states have internal predecessors, (112), 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 16:08:01,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:08:01,803 INFO L93 Difference]: Finished difference Result 77 states and 112 transitions. [2022-02-20 16:08:01,804 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 112 transitions. [2022-02-20 16:08:01,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:08:01,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:08:01,805 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 76 states have (on average 1.4736842105263157) internal successors, (112), 76 states have internal predecessors, (112), 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 77 states. [2022-02-20 16:08:01,805 INFO L87 Difference]: Start difference. First operand has 77 states, 76 states have (on average 1.4736842105263157) internal successors, (112), 76 states have internal predecessors, (112), 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 77 states. [2022-02-20 16:08:01,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:08:01,808 INFO L93 Difference]: Finished difference Result 77 states and 112 transitions. [2022-02-20 16:08:01,808 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 112 transitions. [2022-02-20 16:08:01,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:08:01,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:08:01,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:08:01,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:08:01,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.4736842105263157) internal successors, (112), 76 states have internal predecessors, (112), 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 16:08:01,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 112 transitions. [2022-02-20 16:08:01,812 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 112 transitions. Word has length 10 [2022-02-20 16:08:01,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:08:01,812 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 112 transitions. [2022-02-20 16:08:01,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 16:08:01,813 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 112 transitions. [2022-02-20 16:08:01,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 16:08:01,814 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:08:01,814 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:08:01,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:08:01,814 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:08:01,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:08:01,815 INFO L85 PathProgramCache]: Analyzing trace with hash 658032583, now seen corresponding path program 1 times [2022-02-20 16:08:01,815 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:08:01,815 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156329239] [2022-02-20 16:08:01,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:08:01,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:08:01,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:08:01,882 INFO L290 TraceCheckUtils]: 0: Hoare triple {870#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(17, 2);call #Ultimate.allocInit(12, 3);~m_initSign~0 := 1;~m_initVerify~0 := 2;~m_Signature~0 := 3;~m_sign~0 := 4;~m_verify~0 := 5;~m_update~0 := 6; {870#true} is VALID [2022-02-20 16:08:01,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {870#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~q~0#1, main_~method_id~0#1, main_~this_state~0#1;main_~q~0#1 := 0;havoc main_~method_id~0#1;main_~this_state~0#1 := 0; {870#true} is VALID [2022-02-20 16:08:01,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {870#true} goto; {870#true} is VALID [2022-02-20 16:08:01,883 INFO L290 TraceCheckUtils]: 3: Hoare triple {870#true} assume !false; {870#true} is VALID [2022-02-20 16:08:01,883 INFO L290 TraceCheckUtils]: 4: Hoare triple {870#true} assume 0 == main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {870#true} is VALID [2022-02-20 16:08:01,884 INFO L290 TraceCheckUtils]: 5: Hoare triple {870#true} assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1; {870#true} is VALID [2022-02-20 16:08:01,884 INFO L290 TraceCheckUtils]: 6: Hoare triple {870#true} main_~method_id~0#1 := 3; {870#true} is VALID [2022-02-20 16:08:01,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {870#true} assume !false;main_~q~0#1 := 2;main_~this_state~0#1 := 0; {872#(= 2 |ULTIMATE.start_main_~q~0#1|)} is VALID [2022-02-20 16:08:01,885 INFO L290 TraceCheckUtils]: 8: Hoare triple {872#(= 2 |ULTIMATE.start_main_~q~0#1|)} assume !false; {872#(= 2 |ULTIMATE.start_main_~q~0#1|)} is VALID [2022-02-20 16:08:01,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {872#(= 2 |ULTIMATE.start_main_~q~0#1|)} assume !(0 == main_~q~0#1); {872#(= 2 |ULTIMATE.start_main_~q~0#1|)} is VALID [2022-02-20 16:08:01,886 INFO L290 TraceCheckUtils]: 10: Hoare triple {872#(= 2 |ULTIMATE.start_main_~q~0#1|)} assume 1 == main_~q~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {871#false} is VALID [2022-02-20 16:08:01,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {871#false} assume 0 != main_#t~nondet5#1;havoc main_#t~nondet5#1; {871#false} is VALID [2022-02-20 16:08:01,886 INFO L290 TraceCheckUtils]: 12: Hoare triple {871#false} main_~method_id~0#1 := 4; {871#false} is VALID [2022-02-20 16:08:01,887 INFO L290 TraceCheckUtils]: 13: Hoare triple {871#false} assume 2 == main_~this_state~0#1; {871#false} is VALID [2022-02-20 16:08:01,887 INFO L290 TraceCheckUtils]: 14: Hoare triple {871#false} assume !false; {871#false} is VALID [2022-02-20 16:08:01,887 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 16:08:01,887 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:08:01,888 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156329239] [2022-02-20 16:08:01,888 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156329239] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:08:01,888 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:08:01,888 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:08:01,888 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434325102] [2022-02-20 16:08:01,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:08:01,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) Word has length 15 [2022-02-20 16:08:01,889 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:08:01,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 16:08:01,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:08:01,901 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:08:01,901 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:08:01,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:08:01,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:08:01,902 INFO L87 Difference]: Start difference. First operand 77 states and 112 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 16:08:02,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:08:02,028 INFO L93 Difference]: Finished difference Result 157 states and 229 transitions. [2022-02-20 16:08:02,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:08:02,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) Word has length 15 [2022-02-20 16:08:02,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:08:02,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 16:08:02,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2022-02-20 16:08:02,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 16:08:02,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2022-02-20 16:08:02,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 224 transitions. [2022-02-20 16:08:02,214 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 224 edges. 224 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:08:02,216 INFO L225 Difference]: With dead ends: 157 [2022-02-20 16:08:02,216 INFO L226 Difference]: Without dead ends: 83 [2022-02-20 16:08:02,216 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:08:02,217 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 21 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:08:02,218 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 174 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:08:02,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-02-20 16:08:02,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2022-02-20 16:08:02,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:08:02,223 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 81 states, 80 states have (on average 1.45) internal successors, (116), 80 states have internal predecessors, (116), 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 16:08:02,223 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 81 states, 80 states have (on average 1.45) internal successors, (116), 80 states have internal predecessors, (116), 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 16:08:02,223 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 81 states, 80 states have (on average 1.45) internal successors, (116), 80 states have internal predecessors, (116), 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 16:08:02,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:08:02,226 INFO L93 Difference]: Finished difference Result 83 states and 117 transitions. [2022-02-20 16:08:02,226 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 117 transitions. [2022-02-20 16:08:02,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:08:02,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:08:02,235 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 80 states have (on average 1.45) internal successors, (116), 80 states have internal predecessors, (116), 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 83 states. [2022-02-20 16:08:02,236 INFO L87 Difference]: Start difference. First operand has 81 states, 80 states have (on average 1.45) internal successors, (116), 80 states have internal predecessors, (116), 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 83 states. [2022-02-20 16:08:02,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:08:02,240 INFO L93 Difference]: Finished difference Result 83 states and 117 transitions. [2022-02-20 16:08:02,240 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 117 transitions. [2022-02-20 16:08:02,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:08:02,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:08:02,244 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:08:02,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:08:02,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.45) internal successors, (116), 80 states have internal predecessors, (116), 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 16:08:02,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 116 transitions. [2022-02-20 16:08:02,253 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 116 transitions. Word has length 15 [2022-02-20 16:08:02,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:08:02,253 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 116 transitions. [2022-02-20 16:08:02,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 16:08:02,254 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 116 transitions. [2022-02-20 16:08:02,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 16:08:02,255 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:08:02,255 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:08:02,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:08:02,256 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:08:02,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:08:02,257 INFO L85 PathProgramCache]: Analyzing trace with hash 2066489199, now seen corresponding path program 1 times [2022-02-20 16:08:02,258 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:08:02,258 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300794811] [2022-02-20 16:08:02,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:08:02,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:08:02,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:08:02,333 INFO L290 TraceCheckUtils]: 0: Hoare triple {1296#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(17, 2);call #Ultimate.allocInit(12, 3);~m_initSign~0 := 1;~m_initVerify~0 := 2;~m_Signature~0 := 3;~m_sign~0 := 4;~m_verify~0 := 5;~m_update~0 := 6; {1296#true} is VALID [2022-02-20 16:08:02,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {1296#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~q~0#1, main_~method_id~0#1, main_~this_state~0#1;main_~q~0#1 := 0;havoc main_~method_id~0#1;main_~this_state~0#1 := 0; {1296#true} is VALID [2022-02-20 16:08:02,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {1296#true} goto; {1296#true} is VALID [2022-02-20 16:08:02,334 INFO L290 TraceCheckUtils]: 3: Hoare triple {1296#true} assume !false; {1296#true} is VALID [2022-02-20 16:08:02,334 INFO L290 TraceCheckUtils]: 4: Hoare triple {1296#true} assume 0 == main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {1296#true} is VALID [2022-02-20 16:08:02,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {1296#true} assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1; {1296#true} is VALID [2022-02-20 16:08:02,335 INFO L290 TraceCheckUtils]: 6: Hoare triple {1296#true} main_~method_id~0#1 := 3; {1296#true} is VALID [2022-02-20 16:08:02,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {1296#true} assume !false;main_~q~0#1 := 2;main_~this_state~0#1 := 0; {1298#(and (= 2 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~this_state~0#1| 0))} is VALID [2022-02-20 16:08:02,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {1298#(and (= 2 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~this_state~0#1| 0))} assume !false; {1298#(and (= 2 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~this_state~0#1| 0))} is VALID [2022-02-20 16:08:02,337 INFO L290 TraceCheckUtils]: 9: Hoare triple {1298#(and (= 2 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~this_state~0#1| 0))} assume !(0 == main_~q~0#1); {1299#(not (= |ULTIMATE.start_main_~this_state~0#1| 2))} is VALID [2022-02-20 16:08:02,337 INFO L290 TraceCheckUtils]: 10: Hoare triple {1299#(not (= |ULTIMATE.start_main_~this_state~0#1| 2))} assume !(1 == main_~q~0#1); {1299#(not (= |ULTIMATE.start_main_~this_state~0#1| 2))} is VALID [2022-02-20 16:08:02,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {1299#(not (= |ULTIMATE.start_main_~this_state~0#1| 2))} assume 2 == main_~q~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647; {1299#(not (= |ULTIMATE.start_main_~this_state~0#1| 2))} is VALID [2022-02-20 16:08:02,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {1299#(not (= |ULTIMATE.start_main_~this_state~0#1| 2))} assume !(0 != main_#t~nondet8#1);havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647; {1299#(not (= |ULTIMATE.start_main_~this_state~0#1| 2))} is VALID [2022-02-20 16:08:02,340 INFO L290 TraceCheckUtils]: 13: Hoare triple {1299#(not (= |ULTIMATE.start_main_~this_state~0#1| 2))} assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647; {1299#(not (= |ULTIMATE.start_main_~this_state~0#1| 2))} is VALID [2022-02-20 16:08:02,340 INFO L290 TraceCheckUtils]: 14: Hoare triple {1299#(not (= |ULTIMATE.start_main_~this_state~0#1| 2))} assume 0 != main_#t~nondet10#1;havoc main_#t~nondet10#1; {1299#(not (= |ULTIMATE.start_main_~this_state~0#1| 2))} is VALID [2022-02-20 16:08:02,344 INFO L290 TraceCheckUtils]: 15: Hoare triple {1299#(not (= |ULTIMATE.start_main_~this_state~0#1| 2))} main_~method_id~0#1 := 4; {1299#(not (= |ULTIMATE.start_main_~this_state~0#1| 2))} is VALID [2022-02-20 16:08:02,345 INFO L290 TraceCheckUtils]: 16: Hoare triple {1299#(not (= |ULTIMATE.start_main_~this_state~0#1| 2))} assume 2 == main_~this_state~0#1; {1297#false} is VALID [2022-02-20 16:08:02,345 INFO L290 TraceCheckUtils]: 17: Hoare triple {1297#false} assume !false; {1297#false} is VALID [2022-02-20 16:08:02,346 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 16:08:02,347 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:08:02,347 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300794811] [2022-02-20 16:08:02,348 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300794811] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:08:02,348 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:08:02,348 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:08:02,348 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471956347] [2022-02-20 16:08:02,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:08:02,349 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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) Word has length 18 [2022-02-20 16:08:02,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:08:02,350 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 16:08:02,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:08:02,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:08:02,363 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:08:02,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:08:02,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:08:02,365 INFO L87 Difference]: Start difference. First operand 81 states and 116 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 16:08:02,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:08:02,744 INFO L93 Difference]: Finished difference Result 254 states and 362 transitions. [2022-02-20 16:08:02,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:08:02,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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) Word has length 18 [2022-02-20 16:08:02,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:08:02,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 16:08:02,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 343 transitions. [2022-02-20 16:08:02,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 16:08:02,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 343 transitions. [2022-02-20 16:08:02,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 343 transitions. [2022-02-20 16:08:03,009 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 343 edges. 343 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:08:03,013 INFO L225 Difference]: With dead ends: 254 [2022-02-20 16:08:03,013 INFO L226 Difference]: Without dead ends: 164 [2022-02-20 16:08:03,013 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:08:03,015 INFO L933 BasicCegarLoop]: 155 mSDtfsCounter, 93 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:08:03,019 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 348 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:08:03,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-02-20 16:08:03,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 129. [2022-02-20 16:08:03,033 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:08:03,033 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 129 states, 128 states have (on average 1.515625) internal successors, (194), 128 states have internal predecessors, (194), 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 16:08:03,034 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 129 states, 128 states have (on average 1.515625) internal successors, (194), 128 states have internal predecessors, (194), 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 16:08:03,038 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 129 states, 128 states have (on average 1.515625) internal successors, (194), 128 states have internal predecessors, (194), 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 16:08:03,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:08:03,044 INFO L93 Difference]: Finished difference Result 164 states and 230 transitions. [2022-02-20 16:08:03,044 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 230 transitions. [2022-02-20 16:08:03,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:08:03,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:08:03,047 INFO L74 IsIncluded]: Start isIncluded. First operand has 129 states, 128 states have (on average 1.515625) internal successors, (194), 128 states have internal predecessors, (194), 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 164 states. [2022-02-20 16:08:03,048 INFO L87 Difference]: Start difference. First operand has 129 states, 128 states have (on average 1.515625) internal successors, (194), 128 states have internal predecessors, (194), 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 164 states. [2022-02-20 16:08:03,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:08:03,054 INFO L93 Difference]: Finished difference Result 164 states and 230 transitions. [2022-02-20 16:08:03,054 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 230 transitions. [2022-02-20 16:08:03,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:08:03,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:08:03,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:08:03,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:08:03,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 1.515625) internal successors, (194), 128 states have internal predecessors, (194), 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 16:08:03,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 194 transitions. [2022-02-20 16:08:03,060 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 194 transitions. Word has length 18 [2022-02-20 16:08:03,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:08:03,060 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 194 transitions. [2022-02-20 16:08:03,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 16:08:03,061 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 194 transitions. [2022-02-20 16:08:03,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 16:08:03,061 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:08:03,062 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:08:03,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 16:08:03,062 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:08:03,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:08:03,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1261026174, now seen corresponding path program 1 times [2022-02-20 16:08:03,066 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:08:03,067 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683130300] [2022-02-20 16:08:03,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:08:03,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:08:03,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:08:03,123 INFO L290 TraceCheckUtils]: 0: Hoare triple {2040#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(17, 2);call #Ultimate.allocInit(12, 3);~m_initSign~0 := 1;~m_initVerify~0 := 2;~m_Signature~0 := 3;~m_sign~0 := 4;~m_verify~0 := 5;~m_update~0 := 6; {2040#true} is VALID [2022-02-20 16:08:03,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {2040#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~q~0#1, main_~method_id~0#1, main_~this_state~0#1;main_~q~0#1 := 0;havoc main_~method_id~0#1;main_~this_state~0#1 := 0; {2040#true} is VALID [2022-02-20 16:08:03,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {2040#true} goto; {2040#true} is VALID [2022-02-20 16:08:03,126 INFO L290 TraceCheckUtils]: 3: Hoare triple {2040#true} assume !false; {2040#true} is VALID [2022-02-20 16:08:03,128 INFO L290 TraceCheckUtils]: 4: Hoare triple {2040#true} assume 0 == main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {2040#true} is VALID [2022-02-20 16:08:03,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {2040#true} assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1; {2040#true} is VALID [2022-02-20 16:08:03,128 INFO L290 TraceCheckUtils]: 6: Hoare triple {2040#true} main_~method_id~0#1 := 3; {2040#true} is VALID [2022-02-20 16:08:03,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {2040#true} assume !false;main_~q~0#1 := 2;main_~this_state~0#1 := 0; {2040#true} is VALID [2022-02-20 16:08:03,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {2040#true} assume !false; {2040#true} is VALID [2022-02-20 16:08:03,129 INFO L290 TraceCheckUtils]: 9: Hoare triple {2040#true} assume !(0 == main_~q~0#1); {2040#true} is VALID [2022-02-20 16:08:03,132 INFO L290 TraceCheckUtils]: 10: Hoare triple {2040#true} assume !(1 == main_~q~0#1); {2040#true} is VALID [2022-02-20 16:08:03,132 INFO L290 TraceCheckUtils]: 11: Hoare triple {2040#true} assume 2 == main_~q~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647; {2040#true} is VALID [2022-02-20 16:08:03,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {2040#true} assume 0 != main_#t~nondet8#1;havoc main_#t~nondet8#1; {2040#true} is VALID [2022-02-20 16:08:03,133 INFO L290 TraceCheckUtils]: 13: Hoare triple {2040#true} main_~method_id~0#1 := 1; {2040#true} is VALID [2022-02-20 16:08:03,133 INFO L290 TraceCheckUtils]: 14: Hoare triple {2040#true} assume !false;main_~q~0#1 := 3;main_~this_state~0#1 := 2; {2042#(= 3 |ULTIMATE.start_main_~q~0#1|)} is VALID [2022-02-20 16:08:03,134 INFO L290 TraceCheckUtils]: 15: Hoare triple {2042#(= 3 |ULTIMATE.start_main_~q~0#1|)} assume !false; {2042#(= 3 |ULTIMATE.start_main_~q~0#1|)} is VALID [2022-02-20 16:08:03,134 INFO L290 TraceCheckUtils]: 16: Hoare triple {2042#(= 3 |ULTIMATE.start_main_~q~0#1|)} assume !(0 == main_~q~0#1); {2042#(= 3 |ULTIMATE.start_main_~q~0#1|)} is VALID [2022-02-20 16:08:03,135 INFO L290 TraceCheckUtils]: 17: Hoare triple {2042#(= 3 |ULTIMATE.start_main_~q~0#1|)} assume 1 == main_~q~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {2041#false} is VALID [2022-02-20 16:08:03,135 INFO L290 TraceCheckUtils]: 18: Hoare triple {2041#false} assume 0 != main_#t~nondet5#1;havoc main_#t~nondet5#1; {2041#false} is VALID [2022-02-20 16:08:03,135 INFO L290 TraceCheckUtils]: 19: Hoare triple {2041#false} main_~method_id~0#1 := 4; {2041#false} is VALID [2022-02-20 16:08:03,135 INFO L290 TraceCheckUtils]: 20: Hoare triple {2041#false} assume 2 == main_~this_state~0#1; {2041#false} is VALID [2022-02-20 16:08:03,136 INFO L290 TraceCheckUtils]: 21: Hoare triple {2041#false} assume !false; {2041#false} is VALID [2022-02-20 16:08:03,136 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 16:08:03,138 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:08:03,138 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683130300] [2022-02-20 16:08:03,138 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683130300] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:08:03,138 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:08:03,139 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:08:03,139 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003802465] [2022-02-20 16:08:03,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:08:03,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) Word has length 22 [2022-02-20 16:08:03,142 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:08:03,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 16:08:03,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:08:03,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:08:03,156 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:08:03,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:08:03,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:08:03,157 INFO L87 Difference]: Start difference. First operand 129 states and 194 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 16:08:03,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:08:03,274 INFO L93 Difference]: Finished difference Result 233 states and 348 transitions. [2022-02-20 16:08:03,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:08:03,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) Word has length 22 [2022-02-20 16:08:03,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:08:03,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 16:08:03,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 217 transitions. [2022-02-20 16:08:03,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 16:08:03,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 217 transitions. [2022-02-20 16:08:03,280 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 217 transitions. [2022-02-20 16:08:03,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 217 edges. 217 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:08:03,433 INFO L225 Difference]: With dead ends: 233 [2022-02-20 16:08:03,433 INFO L226 Difference]: Without dead ends: 107 [2022-02-20 16:08:03,436 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:08:03,445 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 28 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:08:03,447 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 152 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:08:03,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-02-20 16:08:03,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2022-02-20 16:08:03,458 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:08:03,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 105 states, 104 states have (on average 1.4230769230769231) internal successors, (148), 104 states have internal predecessors, (148), 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 16:08:03,459 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 105 states, 104 states have (on average 1.4230769230769231) internal successors, (148), 104 states have internal predecessors, (148), 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 16:08:03,459 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 105 states, 104 states have (on average 1.4230769230769231) internal successors, (148), 104 states have internal predecessors, (148), 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 16:08:03,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:08:03,462 INFO L93 Difference]: Finished difference Result 107 states and 149 transitions. [2022-02-20 16:08:03,462 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 149 transitions. [2022-02-20 16:08:03,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:08:03,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:08:03,463 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 104 states have (on average 1.4230769230769231) internal successors, (148), 104 states have internal predecessors, (148), 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 107 states. [2022-02-20 16:08:03,463 INFO L87 Difference]: Start difference. First operand has 105 states, 104 states have (on average 1.4230769230769231) internal successors, (148), 104 states have internal predecessors, (148), 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 107 states. [2022-02-20 16:08:03,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:08:03,466 INFO L93 Difference]: Finished difference Result 107 states and 149 transitions. [2022-02-20 16:08:03,466 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 149 transitions. [2022-02-20 16:08:03,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:08:03,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:08:03,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:08:03,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:08:03,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.4230769230769231) internal successors, (148), 104 states have internal predecessors, (148), 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 16:08:03,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 148 transitions. [2022-02-20 16:08:03,470 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 148 transitions. Word has length 22 [2022-02-20 16:08:03,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:08:03,471 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 148 transitions. [2022-02-20 16:08:03,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 16:08:03,471 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 148 transitions. [2022-02-20 16:08:03,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 16:08:03,472 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:08:03,472 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:08:03,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 16:08:03,472 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:08:03,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:08:03,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1588216786, now seen corresponding path program 1 times [2022-02-20 16:08:03,473 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:08:03,474 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894453034] [2022-02-20 16:08:03,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:08:03,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:08:03,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:08:03,514 INFO L290 TraceCheckUtils]: 0: Hoare triple {2625#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(17, 2);call #Ultimate.allocInit(12, 3);~m_initSign~0 := 1;~m_initVerify~0 := 2;~m_Signature~0 := 3;~m_sign~0 := 4;~m_verify~0 := 5;~m_update~0 := 6; {2625#true} is VALID [2022-02-20 16:08:03,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {2625#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~q~0#1, main_~method_id~0#1, main_~this_state~0#1;main_~q~0#1 := 0;havoc main_~method_id~0#1;main_~this_state~0#1 := 0; {2625#true} is VALID [2022-02-20 16:08:03,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {2625#true} goto; {2625#true} is VALID [2022-02-20 16:08:03,514 INFO L290 TraceCheckUtils]: 3: Hoare triple {2625#true} assume !false; {2625#true} is VALID [2022-02-20 16:08:03,515 INFO L290 TraceCheckUtils]: 4: Hoare triple {2625#true} assume 0 == main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {2625#true} is VALID [2022-02-20 16:08:03,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {2625#true} assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1; {2625#true} is VALID [2022-02-20 16:08:03,515 INFO L290 TraceCheckUtils]: 6: Hoare triple {2625#true} main_~method_id~0#1 := 3; {2625#true} is VALID [2022-02-20 16:08:03,515 INFO L290 TraceCheckUtils]: 7: Hoare triple {2625#true} assume !false;main_~q~0#1 := 2;main_~this_state~0#1 := 0; {2625#true} is VALID [2022-02-20 16:08:03,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {2625#true} assume !false; {2625#true} is VALID [2022-02-20 16:08:03,515 INFO L290 TraceCheckUtils]: 9: Hoare triple {2625#true} assume !(0 == main_~q~0#1); {2625#true} is VALID [2022-02-20 16:08:03,516 INFO L290 TraceCheckUtils]: 10: Hoare triple {2625#true} assume !(1 == main_~q~0#1); {2625#true} is VALID [2022-02-20 16:08:03,516 INFO L290 TraceCheckUtils]: 11: Hoare triple {2625#true} assume 2 == main_~q~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647; {2625#true} is VALID [2022-02-20 16:08:03,516 INFO L290 TraceCheckUtils]: 12: Hoare triple {2625#true} assume !(0 != main_#t~nondet8#1);havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647; {2625#true} is VALID [2022-02-20 16:08:03,516 INFO L290 TraceCheckUtils]: 13: Hoare triple {2625#true} assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1; {2625#true} is VALID [2022-02-20 16:08:03,516 INFO L290 TraceCheckUtils]: 14: Hoare triple {2625#true} main_~method_id~0#1 := 2; {2625#true} is VALID [2022-02-20 16:08:03,518 INFO L290 TraceCheckUtils]: 15: Hoare triple {2625#true} assume !false;main_~q~0#1 := 4;main_~this_state~0#1 := 3; {2627#(<= 4 |ULTIMATE.start_main_~q~0#1|)} is VALID [2022-02-20 16:08:03,518 INFO L290 TraceCheckUtils]: 16: Hoare triple {2627#(<= 4 |ULTIMATE.start_main_~q~0#1|)} assume !false; {2627#(<= 4 |ULTIMATE.start_main_~q~0#1|)} is VALID [2022-02-20 16:08:03,518 INFO L290 TraceCheckUtils]: 17: Hoare triple {2627#(<= 4 |ULTIMATE.start_main_~q~0#1|)} assume !(0 == main_~q~0#1); {2627#(<= 4 |ULTIMATE.start_main_~q~0#1|)} is VALID [2022-02-20 16:08:03,519 INFO L290 TraceCheckUtils]: 18: Hoare triple {2627#(<= 4 |ULTIMATE.start_main_~q~0#1|)} assume 1 == main_~q~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {2626#false} is VALID [2022-02-20 16:08:03,519 INFO L290 TraceCheckUtils]: 19: Hoare triple {2626#false} assume !(0 != main_#t~nondet5#1);havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {2626#false} is VALID [2022-02-20 16:08:03,519 INFO L290 TraceCheckUtils]: 20: Hoare triple {2626#false} assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1; {2626#false} is VALID [2022-02-20 16:08:03,520 INFO L290 TraceCheckUtils]: 21: Hoare triple {2626#false} main_~method_id~0#1 := 5; {2626#false} is VALID [2022-02-20 16:08:03,520 INFO L290 TraceCheckUtils]: 22: Hoare triple {2626#false} assume 3 == main_~this_state~0#1; {2626#false} is VALID [2022-02-20 16:08:03,520 INFO L290 TraceCheckUtils]: 23: Hoare triple {2626#false} assume !false; {2626#false} is VALID [2022-02-20 16:08:03,520 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 16:08:03,521 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:08:03,522 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894453034] [2022-02-20 16:08:03,522 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894453034] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:08:03,522 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:08:03,522 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:08:03,524 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091372305] [2022-02-20 16:08:03,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:08:03,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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) Word has length 24 [2022-02-20 16:08:03,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:08:03,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 16:08:03,539 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:08:03,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:08:03,539 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:08:03,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:08:03,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:08:03,543 INFO L87 Difference]: Start difference. First operand 105 states and 148 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 16:08:03,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:08:03,640 INFO L93 Difference]: Finished difference Result 189 states and 268 transitions. [2022-02-20 16:08:03,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:08:03,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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) Word has length 24 [2022-02-20 16:08:03,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:08:03,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 16:08:03,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 192 transitions. [2022-02-20 16:08:03,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 16:08:03,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 192 transitions. [2022-02-20 16:08:03,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 192 transitions. [2022-02-20 16:08:03,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:08:03,780 INFO L225 Difference]: With dead ends: 189 [2022-02-20 16:08:03,780 INFO L226 Difference]: Without dead ends: 87 [2022-02-20 16:08:03,780 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:08:03,781 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 28 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:08:03,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 124 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:08:03,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-02-20 16:08:03,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2022-02-20 16:08:03,788 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:08:03,788 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 85 states, 84 states have (on average 1.4047619047619047) internal successors, (118), 84 states have internal predecessors, (118), 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 16:08:03,788 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 85 states, 84 states have (on average 1.4047619047619047) internal successors, (118), 84 states have internal predecessors, (118), 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 16:08:03,789 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 85 states, 84 states have (on average 1.4047619047619047) internal successors, (118), 84 states have internal predecessors, (118), 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 16:08:03,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:08:03,791 INFO L93 Difference]: Finished difference Result 87 states and 119 transitions. [2022-02-20 16:08:03,791 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 119 transitions. [2022-02-20 16:08:03,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:08:03,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:08:03,792 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 84 states have (on average 1.4047619047619047) internal successors, (118), 84 states have internal predecessors, (118), 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 87 states. [2022-02-20 16:08:03,792 INFO L87 Difference]: Start difference. First operand has 85 states, 84 states have (on average 1.4047619047619047) internal successors, (118), 84 states have internal predecessors, (118), 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 87 states. [2022-02-20 16:08:03,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:08:03,794 INFO L93 Difference]: Finished difference Result 87 states and 119 transitions. [2022-02-20 16:08:03,794 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 119 transitions. [2022-02-20 16:08:03,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:08:03,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:08:03,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:08:03,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:08:03,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.4047619047619047) internal successors, (118), 84 states have internal predecessors, (118), 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 16:08:03,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 118 transitions. [2022-02-20 16:08:03,797 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 118 transitions. Word has length 24 [2022-02-20 16:08:03,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:08:03,798 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 118 transitions. [2022-02-20 16:08:03,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 16:08:03,798 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 118 transitions. [2022-02-20 16:08:03,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 16:08:03,799 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:08:03,799 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:08:03,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 16:08:03,799 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:08:03,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:08:03,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1712893632, now seen corresponding path program 1 times [2022-02-20 16:08:03,800 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:08:03,800 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489302453] [2022-02-20 16:08:03,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:08:03,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:08:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:08:03,834 INFO L290 TraceCheckUtils]: 0: Hoare triple {3103#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(17, 2);call #Ultimate.allocInit(12, 3);~m_initSign~0 := 1;~m_initVerify~0 := 2;~m_Signature~0 := 3;~m_sign~0 := 4;~m_verify~0 := 5;~m_update~0 := 6; {3103#true} is VALID [2022-02-20 16:08:03,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {3103#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~q~0#1, main_~method_id~0#1, main_~this_state~0#1;main_~q~0#1 := 0;havoc main_~method_id~0#1;main_~this_state~0#1 := 0; {3103#true} is VALID [2022-02-20 16:08:03,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {3103#true} goto; {3103#true} is VALID [2022-02-20 16:08:03,835 INFO L290 TraceCheckUtils]: 3: Hoare triple {3103#true} assume !false; {3103#true} is VALID [2022-02-20 16:08:03,835 INFO L290 TraceCheckUtils]: 4: Hoare triple {3103#true} assume 0 == main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {3103#true} is VALID [2022-02-20 16:08:03,835 INFO L290 TraceCheckUtils]: 5: Hoare triple {3103#true} assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1; {3103#true} is VALID [2022-02-20 16:08:03,835 INFO L290 TraceCheckUtils]: 6: Hoare triple {3103#true} main_~method_id~0#1 := 3; {3103#true} is VALID [2022-02-20 16:08:03,835 INFO L290 TraceCheckUtils]: 7: Hoare triple {3103#true} assume !false;main_~q~0#1 := 2;main_~this_state~0#1 := 0; {3103#true} is VALID [2022-02-20 16:08:03,836 INFO L290 TraceCheckUtils]: 8: Hoare triple {3103#true} assume !false; {3103#true} is VALID [2022-02-20 16:08:03,836 INFO L290 TraceCheckUtils]: 9: Hoare triple {3103#true} assume !(0 == main_~q~0#1); {3103#true} is VALID [2022-02-20 16:08:03,836 INFO L290 TraceCheckUtils]: 10: Hoare triple {3103#true} assume !(1 == main_~q~0#1); {3103#true} is VALID [2022-02-20 16:08:03,836 INFO L290 TraceCheckUtils]: 11: Hoare triple {3103#true} assume 2 == main_~q~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647; {3103#true} is VALID [2022-02-20 16:08:03,836 INFO L290 TraceCheckUtils]: 12: Hoare triple {3103#true} assume 0 != main_#t~nondet8#1;havoc main_#t~nondet8#1; {3103#true} is VALID [2022-02-20 16:08:03,837 INFO L290 TraceCheckUtils]: 13: Hoare triple {3103#true} main_~method_id~0#1 := 1; {3103#true} is VALID [2022-02-20 16:08:03,837 INFO L290 TraceCheckUtils]: 14: Hoare triple {3103#true} assume !false;main_~q~0#1 := 3;main_~this_state~0#1 := 2; {3105#(= |ULTIMATE.start_main_~this_state~0#1| 2)} is VALID [2022-02-20 16:08:03,837 INFO L290 TraceCheckUtils]: 15: Hoare triple {3105#(= |ULTIMATE.start_main_~this_state~0#1| 2)} assume !false; {3105#(= |ULTIMATE.start_main_~this_state~0#1| 2)} is VALID [2022-02-20 16:08:03,838 INFO L290 TraceCheckUtils]: 16: Hoare triple {3105#(= |ULTIMATE.start_main_~this_state~0#1| 2)} assume !(0 == main_~q~0#1); {3105#(= |ULTIMATE.start_main_~this_state~0#1| 2)} is VALID [2022-02-20 16:08:03,838 INFO L290 TraceCheckUtils]: 17: Hoare triple {3105#(= |ULTIMATE.start_main_~this_state~0#1| 2)} assume !(1 == main_~q~0#1); {3105#(= |ULTIMATE.start_main_~this_state~0#1| 2)} is VALID [2022-02-20 16:08:03,839 INFO L290 TraceCheckUtils]: 18: Hoare triple {3105#(= |ULTIMATE.start_main_~this_state~0#1| 2)} assume !(2 == main_~q~0#1); {3105#(= |ULTIMATE.start_main_~this_state~0#1| 2)} is VALID [2022-02-20 16:08:03,839 INFO L290 TraceCheckUtils]: 19: Hoare triple {3105#(= |ULTIMATE.start_main_~this_state~0#1| 2)} assume 3 == main_~q~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {3105#(= |ULTIMATE.start_main_~this_state~0#1| 2)} is VALID [2022-02-20 16:08:03,839 INFO L290 TraceCheckUtils]: 20: Hoare triple {3105#(= |ULTIMATE.start_main_~this_state~0#1| 2)} assume !(0 != main_#t~nondet13#1);havoc main_#t~nondet13#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647; {3105#(= |ULTIMATE.start_main_~this_state~0#1| 2)} is VALID [2022-02-20 16:08:03,840 INFO L290 TraceCheckUtils]: 21: Hoare triple {3105#(= |ULTIMATE.start_main_~this_state~0#1| 2)} assume !(0 != main_#t~nondet14#1);havoc main_#t~nondet14#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647; {3105#(= |ULTIMATE.start_main_~this_state~0#1| 2)} is VALID [2022-02-20 16:08:03,840 INFO L290 TraceCheckUtils]: 22: Hoare triple {3105#(= |ULTIMATE.start_main_~this_state~0#1| 2)} assume 0 != main_#t~nondet15#1;havoc main_#t~nondet15#1; {3105#(= |ULTIMATE.start_main_~this_state~0#1| 2)} is VALID [2022-02-20 16:08:03,841 INFO L290 TraceCheckUtils]: 23: Hoare triple {3105#(= |ULTIMATE.start_main_~this_state~0#1| 2)} main_~method_id~0#1 := 4; {3105#(= |ULTIMATE.start_main_~this_state~0#1| 2)} is VALID [2022-02-20 16:08:03,841 INFO L290 TraceCheckUtils]: 24: Hoare triple {3105#(= |ULTIMATE.start_main_~this_state~0#1| 2)} assume 2 != main_~this_state~0#1; {3104#false} is VALID [2022-02-20 16:08:03,841 INFO L290 TraceCheckUtils]: 25: Hoare triple {3104#false} assume !false; {3104#false} is VALID [2022-02-20 16:08:03,842 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 16:08:03,842 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:08:03,842 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489302453] [2022-02-20 16:08:03,842 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489302453] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:08:03,842 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:08:03,843 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:08:03,843 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41491895] [2022-02-20 16:08:03,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:08:03,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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) Word has length 26 [2022-02-20 16:08:03,844 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:08:03,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 16:08:03,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:08:03,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:08:03,868 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:08:03,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:08:03,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:08:03,869 INFO L87 Difference]: Start difference. First operand 85 states and 118 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 16:08:03,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:08:03,955 INFO L93 Difference]: Finished difference Result 132 states and 185 transitions. [2022-02-20 16:08:03,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:08:03,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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) Word has length 26 [2022-02-20 16:08:03,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:08:03,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 16:08:03,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2022-02-20 16:08:03,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 16:08:03,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2022-02-20 16:08:03,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 151 transitions. [2022-02-20 16:08:04,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:08:04,071 INFO L225 Difference]: With dead ends: 132 [2022-02-20 16:08:04,071 INFO L226 Difference]: Without dead ends: 66 [2022-02-20 16:08:04,072 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:08:04,072 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 14 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:08:04,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 114 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:08:04,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-02-20 16:08:04,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-02-20 16:08:04,080 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:08:04,080 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 66 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 65 states have internal predecessors, (84), 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 16:08:04,080 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 66 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 65 states have internal predecessors, (84), 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 16:08:04,081 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 66 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 65 states have internal predecessors, (84), 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 16:08:04,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:08:04,082 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2022-02-20 16:08:04,083 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2022-02-20 16:08:04,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:08:04,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:08:04,083 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 65 states have internal predecessors, (84), 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 66 states. [2022-02-20 16:08:04,084 INFO L87 Difference]: Start difference. First operand has 66 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 65 states have internal predecessors, (84), 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 66 states. [2022-02-20 16:08:04,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:08:04,085 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2022-02-20 16:08:04,085 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2022-02-20 16:08:04,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:08:04,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:08:04,086 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:08:04,086 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:08:04,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 65 states have internal predecessors, (84), 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 16:08:04,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2022-02-20 16:08:04,088 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 26 [2022-02-20 16:08:04,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:08:04,088 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2022-02-20 16:08:04,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 16:08:04,089 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2022-02-20 16:08:04,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 16:08:04,089 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:08:04,089 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:08:04,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 16:08:04,091 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:08:04,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:08:04,092 INFO L85 PathProgramCache]: Analyzing trace with hash -583473182, now seen corresponding path program 1 times [2022-02-20 16:08:04,092 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:08:04,092 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278030105] [2022-02-20 16:08:04,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:08:04,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:08:04,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:08:04,138 INFO L290 TraceCheckUtils]: 0: Hoare triple {3457#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(17, 2);call #Ultimate.allocInit(12, 3);~m_initSign~0 := 1;~m_initVerify~0 := 2;~m_Signature~0 := 3;~m_sign~0 := 4;~m_verify~0 := 5;~m_update~0 := 6; {3457#true} is VALID [2022-02-20 16:08:04,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {3457#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~q~0#1, main_~method_id~0#1, main_~this_state~0#1;main_~q~0#1 := 0;havoc main_~method_id~0#1;main_~this_state~0#1 := 0; {3457#true} is VALID [2022-02-20 16:08:04,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {3457#true} goto; {3457#true} is VALID [2022-02-20 16:08:04,139 INFO L290 TraceCheckUtils]: 3: Hoare triple {3457#true} assume !false; {3457#true} is VALID [2022-02-20 16:08:04,140 INFO L290 TraceCheckUtils]: 4: Hoare triple {3457#true} assume 0 == main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {3457#true} is VALID [2022-02-20 16:08:04,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {3457#true} assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1; {3457#true} is VALID [2022-02-20 16:08:04,140 INFO L290 TraceCheckUtils]: 6: Hoare triple {3457#true} main_~method_id~0#1 := 3; {3457#true} is VALID [2022-02-20 16:08:04,140 INFO L290 TraceCheckUtils]: 7: Hoare triple {3457#true} assume !false;main_~q~0#1 := 2;main_~this_state~0#1 := 0; {3457#true} is VALID [2022-02-20 16:08:04,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {3457#true} assume !false; {3457#true} is VALID [2022-02-20 16:08:04,141 INFO L290 TraceCheckUtils]: 9: Hoare triple {3457#true} assume !(0 == main_~q~0#1); {3457#true} is VALID [2022-02-20 16:08:04,141 INFO L290 TraceCheckUtils]: 10: Hoare triple {3457#true} assume !(1 == main_~q~0#1); {3457#true} is VALID [2022-02-20 16:08:04,141 INFO L290 TraceCheckUtils]: 11: Hoare triple {3457#true} assume 2 == main_~q~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647; {3457#true} is VALID [2022-02-20 16:08:04,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {3457#true} assume !(0 != main_#t~nondet8#1);havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647; {3457#true} is VALID [2022-02-20 16:08:04,141 INFO L290 TraceCheckUtils]: 13: Hoare triple {3457#true} assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1; {3457#true} is VALID [2022-02-20 16:08:04,142 INFO L290 TraceCheckUtils]: 14: Hoare triple {3457#true} main_~method_id~0#1 := 2; {3457#true} is VALID [2022-02-20 16:08:04,142 INFO L290 TraceCheckUtils]: 15: Hoare triple {3457#true} assume !false;main_~q~0#1 := 4;main_~this_state~0#1 := 3; {3459#(= |ULTIMATE.start_main_~this_state~0#1| 3)} is VALID [2022-02-20 16:08:04,142 INFO L290 TraceCheckUtils]: 16: Hoare triple {3459#(= |ULTIMATE.start_main_~this_state~0#1| 3)} assume !false; {3459#(= |ULTIMATE.start_main_~this_state~0#1| 3)} is VALID [2022-02-20 16:08:04,143 INFO L290 TraceCheckUtils]: 17: Hoare triple {3459#(= |ULTIMATE.start_main_~this_state~0#1| 3)} assume !(0 == main_~q~0#1); {3459#(= |ULTIMATE.start_main_~this_state~0#1| 3)} is VALID [2022-02-20 16:08:04,143 INFO L290 TraceCheckUtils]: 18: Hoare triple {3459#(= |ULTIMATE.start_main_~this_state~0#1| 3)} assume !(1 == main_~q~0#1); {3459#(= |ULTIMATE.start_main_~this_state~0#1| 3)} is VALID [2022-02-20 16:08:04,144 INFO L290 TraceCheckUtils]: 19: Hoare triple {3459#(= |ULTIMATE.start_main_~this_state~0#1| 3)} assume !(2 == main_~q~0#1); {3459#(= |ULTIMATE.start_main_~this_state~0#1| 3)} is VALID [2022-02-20 16:08:04,144 INFO L290 TraceCheckUtils]: 20: Hoare triple {3459#(= |ULTIMATE.start_main_~this_state~0#1| 3)} assume !(3 == main_~q~0#1); {3459#(= |ULTIMATE.start_main_~this_state~0#1| 3)} is VALID [2022-02-20 16:08:04,144 INFO L290 TraceCheckUtils]: 21: Hoare triple {3459#(= |ULTIMATE.start_main_~this_state~0#1| 3)} assume 4 == main_~q~0#1;assume -2147483648 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 2147483647; {3459#(= |ULTIMATE.start_main_~this_state~0#1| 3)} is VALID [2022-02-20 16:08:04,145 INFO L290 TraceCheckUtils]: 22: Hoare triple {3459#(= |ULTIMATE.start_main_~this_state~0#1| 3)} assume !(0 != main_#t~nondet19#1);havoc main_#t~nondet19#1;assume -2147483648 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 2147483647; {3459#(= |ULTIMATE.start_main_~this_state~0#1| 3)} is VALID [2022-02-20 16:08:04,145 INFO L290 TraceCheckUtils]: 23: Hoare triple {3459#(= |ULTIMATE.start_main_~this_state~0#1| 3)} assume !(0 != main_#t~nondet20#1);havoc main_#t~nondet20#1;assume -2147483648 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 2147483647; {3459#(= |ULTIMATE.start_main_~this_state~0#1| 3)} is VALID [2022-02-20 16:08:04,146 INFO L290 TraceCheckUtils]: 24: Hoare triple {3459#(= |ULTIMATE.start_main_~this_state~0#1| 3)} assume !(0 != main_#t~nondet21#1);havoc main_#t~nondet21#1;assume -2147483648 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 2147483647; {3459#(= |ULTIMATE.start_main_~this_state~0#1| 3)} is VALID [2022-02-20 16:08:04,146 INFO L290 TraceCheckUtils]: 25: Hoare triple {3459#(= |ULTIMATE.start_main_~this_state~0#1| 3)} assume 0 != main_#t~nondet22#1;havoc main_#t~nondet22#1; {3459#(= |ULTIMATE.start_main_~this_state~0#1| 3)} is VALID [2022-02-20 16:08:04,147 INFO L290 TraceCheckUtils]: 26: Hoare triple {3459#(= |ULTIMATE.start_main_~this_state~0#1| 3)} main_~method_id~0#1 := 5; {3459#(= |ULTIMATE.start_main_~this_state~0#1| 3)} is VALID [2022-02-20 16:08:04,148 INFO L290 TraceCheckUtils]: 27: Hoare triple {3459#(= |ULTIMATE.start_main_~this_state~0#1| 3)} assume 3 != main_~this_state~0#1; {3458#false} is VALID [2022-02-20 16:08:04,148 INFO L290 TraceCheckUtils]: 28: Hoare triple {3458#false} assume !false; {3458#false} is VALID [2022-02-20 16:08:04,149 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 16:08:04,149 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:08:04,149 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278030105] [2022-02-20 16:08:04,149 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278030105] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:08:04,149 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:08:04,149 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:08:04,150 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202279251] [2022-02-20 16:08:04,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:08:04,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) Word has length 29 [2022-02-20 16:08:04,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:08:04,151 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 16:08:04,167 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 16:08:04,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:08:04,168 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:08:04,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:08:04,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:08:04,169 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 16:08:04,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:08:04,236 INFO L93 Difference]: Finished difference Result 107 states and 139 transitions. [2022-02-20 16:08:04,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:08:04,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) Word has length 29 [2022-02-20 16:08:04,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:08:04,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 16:08:04,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2022-02-20 16:08:04,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 16:08:04,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2022-02-20 16:08:04,241 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 131 transitions. [2022-02-20 16:08:04,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:08:04,321 INFO L225 Difference]: With dead ends: 107 [2022-02-20 16:08:04,321 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:08:04,321 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:08:04,322 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 13 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:08:04,322 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 104 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:08:04,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:08:04,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:08:04,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:08:04,323 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 16:08:04,323 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 16:08:04,324 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 16:08:04,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:08:04,324 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:08:04,324 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:08:04,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:08:04,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:08:04,324 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 16:08:04,325 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 16:08:04,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:08:04,325 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:08:04,325 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:08:04,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:08:04,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:08:04,326 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:08:04,326 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:08:04,326 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 16:08:04,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:08:04,326 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2022-02-20 16:08:04,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:08:04,326 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:08:04,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 16:08:04,327 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:08:04,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:08:04,329 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:08:04,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 16:08:04,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 16:08:04,384 INFO L858 garLoopResultBuilder]: For program point L250(lines 250 265) no Hoare annotation was computed. [2022-02-20 16:08:04,384 INFO L858 garLoopResultBuilder]: For program point L118(lines 118 133) no Hoare annotation was computed. [2022-02-20 16:08:04,384 INFO L858 garLoopResultBuilder]: For program point L52(lines 52 63) no Hoare annotation was computed. [2022-02-20 16:08:04,384 INFO L858 garLoopResultBuilder]: For program point L366(lines 366 381) no Hoare annotation was computed. [2022-02-20 16:08:04,384 INFO L858 garLoopResultBuilder]: For program point L234(lines 234 249) no Hoare annotation was computed. [2022-02-20 16:08:04,384 INFO L858 garLoopResultBuilder]: For program point L168(lines 168 179) no Hoare annotation was computed. [2022-02-20 16:08:04,384 INFO L858 garLoopResultBuilder]: For program point L102(lines 102 117) no Hoare annotation was computed. [2022-02-20 16:08:04,384 INFO L858 garLoopResultBuilder]: For program point L36(lines 36 38) no Hoare annotation was computed. [2022-02-20 16:08:04,384 INFO L854 garLoopResultBuilder]: At program point L383(lines 24 387) the Hoare annotation is: (or (and (= |ULTIMATE.start_main_~this_state~0#1| 3) (<= 4 |ULTIMATE.start_main_~q~0#1|)) (and (= 2 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~this_state~0#1| 0)) (= |ULTIMATE.start_main_~q~0#1| 0) (and (= 3 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~this_state~0#1| 2))) [2022-02-20 16:08:04,385 INFO L858 garLoopResultBuilder]: For program point L350(lines 350 365) no Hoare annotation was computed. [2022-02-20 16:08:04,385 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 16:08:04,385 INFO L858 garLoopResultBuilder]: For program point L218(lines 218 233) no Hoare annotation was computed. [2022-02-20 16:08:04,385 INFO L858 garLoopResultBuilder]: For program point L185(lines 185 284) no Hoare annotation was computed. [2022-02-20 16:08:04,385 INFO L858 garLoopResultBuilder]: For program point L152(lines 152 163) no Hoare annotation was computed. [2022-02-20 16:08:04,385 INFO L858 garLoopResultBuilder]: For program point L334(lines 334 349) no Hoare annotation was computed. [2022-02-20 16:08:04,385 INFO L858 garLoopResultBuilder]: For program point L268(lines 268 279) no Hoare annotation was computed. [2022-02-20 16:08:04,385 INFO L858 garLoopResultBuilder]: For program point L202(lines 202 217) no Hoare annotation was computed. [2022-02-20 16:08:04,385 INFO L858 garLoopResultBuilder]: For program point L136(lines 136 147) no Hoare annotation was computed. [2022-02-20 16:08:04,385 INFO L858 garLoopResultBuilder]: For program point L318(lines 318 333) no Hoare annotation was computed. [2022-02-20 16:08:04,385 INFO L858 garLoopResultBuilder]: For program point L285(lines 285 384) no Hoare annotation was computed. [2022-02-20 16:08:04,385 INFO L858 garLoopResultBuilder]: For program point L252(lines 252 263) no Hoare annotation was computed. [2022-02-20 16:08:04,385 INFO L858 garLoopResultBuilder]: For program point L186(lines 186 201) no Hoare annotation was computed. [2022-02-20 16:08:04,385 INFO L858 garLoopResultBuilder]: For program point L120(lines 120 131) no Hoare annotation was computed. [2022-02-20 16:08:04,385 INFO L858 garLoopResultBuilder]: For program point L368(lines 368 379) no Hoare annotation was computed. [2022-02-20 16:08:04,386 INFO L858 garLoopResultBuilder]: For program point L302(lines 302 317) no Hoare annotation was computed. [2022-02-20 16:08:04,386 INFO L858 garLoopResultBuilder]: For program point L236(lines 236 247) no Hoare annotation was computed. [2022-02-20 16:08:04,386 INFO L858 garLoopResultBuilder]: For program point L104(lines 104 115) no Hoare annotation was computed. [2022-02-20 16:08:04,386 INFO L858 garLoopResultBuilder]: For program point L352(lines 352 363) no Hoare annotation was computed. [2022-02-20 16:08:04,386 INFO L858 garLoopResultBuilder]: For program point L286(lines 286 301) no Hoare annotation was computed. [2022-02-20 16:08:04,386 INFO L858 garLoopResultBuilder]: For program point L220(lines 220 231) no Hoare annotation was computed. [2022-02-20 16:08:04,386 INFO L858 garLoopResultBuilder]: For program point L88(lines 88 90) no Hoare annotation was computed. [2022-02-20 16:08:04,386 INFO L858 garLoopResultBuilder]: For program point L336(lines 336 347) no Hoare annotation was computed. [2022-02-20 16:08:04,386 INFO L858 garLoopResultBuilder]: For program point L204(lines 204 215) no Hoare annotation was computed. [2022-02-20 16:08:04,386 INFO L858 garLoopResultBuilder]: For program point L72(lines 72 74) no Hoare annotation was computed. [2022-02-20 16:08:04,386 INFO L858 garLoopResultBuilder]: For program point L320(lines 320 331) no Hoare annotation was computed. [2022-02-20 16:08:04,386 INFO L858 garLoopResultBuilder]: For program point L188(lines 188 199) no Hoare annotation was computed. [2022-02-20 16:08:04,386 INFO L858 garLoopResultBuilder]: For program point L56(lines 56 58) no Hoare annotation was computed. [2022-02-20 16:08:04,387 INFO L858 garLoopResultBuilder]: For program point L304(lines 304 315) no Hoare annotation was computed. [2022-02-20 16:08:04,387 INFO L858 garLoopResultBuilder]: For program point L172(lines 172 174) no Hoare annotation was computed. [2022-02-20 16:08:04,387 INFO L858 garLoopResultBuilder]: For program point L288(lines 288 299) no Hoare annotation was computed. [2022-02-20 16:08:04,387 INFO L858 garLoopResultBuilder]: For program point L156(lines 156 158) no Hoare annotation was computed. [2022-02-20 16:08:04,387 INFO L854 garLoopResultBuilder]: At program point L24-2(lines 24 387) the Hoare annotation is: (or (and (= |ULTIMATE.start_main_~this_state~0#1| 3) (<= 4 |ULTIMATE.start_main_~q~0#1|)) (and (= |ULTIMATE.start_main_~q~0#1| 0) (not (= |ULTIMATE.start_main_~this_state~0#1| 2)))) [2022-02-20 16:08:04,387 INFO L858 garLoopResultBuilder]: For program point L24-3(lines 24 387) no Hoare annotation was computed. [2022-02-20 16:08:04,387 INFO L858 garLoopResultBuilder]: For program point L272(lines 272 274) no Hoare annotation was computed. [2022-02-20 16:08:04,387 INFO L858 garLoopResultBuilder]: For program point L140(lines 140 142) no Hoare annotation was computed. [2022-02-20 16:08:04,387 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 16:08:04,387 INFO L858 garLoopResultBuilder]: For program point L256(lines 256 258) no Hoare annotation was computed. [2022-02-20 16:08:04,388 INFO L858 garLoopResultBuilder]: For program point L124(lines 124 126) no Hoare annotation was computed. [2022-02-20 16:08:04,388 INFO L858 garLoopResultBuilder]: For program point L372(lines 372 374) no Hoare annotation was computed. [2022-02-20 16:08:04,388 INFO L858 garLoopResultBuilder]: For program point L240(lines 240 242) no Hoare annotation was computed. [2022-02-20 16:08:04,388 INFO L858 garLoopResultBuilder]: For program point L108(lines 108 110) no Hoare annotation was computed. [2022-02-20 16:08:04,388 INFO L858 garLoopResultBuilder]: For program point L356(lines 356 358) no Hoare annotation was computed. [2022-02-20 16:08:04,388 INFO L858 garLoopResultBuilder]: For program point L224(lines 224 226) no Hoare annotation was computed. [2022-02-20 16:08:04,388 INFO L854 garLoopResultBuilder]: At program point L373(lines 15 392) the Hoare annotation is: false [2022-02-20 16:08:04,388 INFO L858 garLoopResultBuilder]: For program point L340(lines 340 342) no Hoare annotation was computed. [2022-02-20 16:08:04,388 INFO L858 garLoopResultBuilder]: For program point L208(lines 208 210) no Hoare annotation was computed. [2022-02-20 16:08:04,389 INFO L858 garLoopResultBuilder]: For program point L324(lines 324 326) no Hoare annotation was computed. [2022-02-20 16:08:04,389 INFO L858 garLoopResultBuilder]: For program point L192(lines 192 194) no Hoare annotation was computed. [2022-02-20 16:08:04,389 INFO L858 garLoopResultBuilder]: For program point L308(lines 308 310) no Hoare annotation was computed. [2022-02-20 16:08:04,389 INFO L858 garLoopResultBuilder]: For program point L292(lines 292 294) no Hoare annotation was computed. [2022-02-20 16:08:04,389 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 16:08:04,389 INFO L858 garLoopResultBuilder]: For program point L29(lines 29 48) no Hoare annotation was computed. [2022-02-20 16:08:04,389 INFO L858 garLoopResultBuilder]: For program point L30(lines 30 45) no Hoare annotation was computed. [2022-02-20 16:08:04,389 INFO L861 garLoopResultBuilder]: At program point L15(lines 15 392) the Hoare annotation is: true [2022-02-20 16:08:04,389 INFO L858 garLoopResultBuilder]: For program point L32(lines 32 43) no Hoare annotation was computed. [2022-02-20 16:08:04,389 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:08:04,390 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 391) no Hoare annotation was computed. [2022-02-20 16:08:04,390 INFO L858 garLoopResultBuilder]: For program point L82(lines 82 97) no Hoare annotation was computed. [2022-02-20 16:08:04,390 INFO L858 garLoopResultBuilder]: For program point L49(lines 49 100) no Hoare annotation was computed. [2022-02-20 16:08:04,390 INFO L858 garLoopResultBuilder]: For program point L66(lines 66 81) no Hoare annotation was computed. [2022-02-20 16:08:04,390 INFO L858 garLoopResultBuilder]: For program point L50(lines 50 65) no Hoare annotation was computed. [2022-02-20 16:08:04,390 INFO L858 garLoopResultBuilder]: For program point L166(lines 166 181) no Hoare annotation was computed. [2022-02-20 16:08:04,390 INFO L858 garLoopResultBuilder]: For program point L150(lines 150 165) no Hoare annotation was computed. [2022-02-20 16:08:04,390 INFO L858 garLoopResultBuilder]: For program point L84(lines 84 95) no Hoare annotation was computed. [2022-02-20 16:08:04,390 INFO L858 garLoopResultBuilder]: For program point L266(lines 266 281) no Hoare annotation was computed. [2022-02-20 16:08:04,390 INFO L858 garLoopResultBuilder]: For program point L134(lines 134 149) no Hoare annotation was computed. [2022-02-20 16:08:04,391 INFO L858 garLoopResultBuilder]: For program point L101(lines 101 184) no Hoare annotation was computed. [2022-02-20 16:08:04,391 INFO L858 garLoopResultBuilder]: For program point L68(lines 68 79) no Hoare annotation was computed. [2022-02-20 16:08:04,397 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:08:04,400 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:08:04,403 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:08:04,404 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:08:04,406 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-02-20 16:08:04,406 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-02-20 16:08:04,406 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-02-20 16:08:04,407 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-02-20 16:08:04,407 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-02-20 16:08:04,407 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-02-20 16:08:04,407 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:08:04,407 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-02-20 16:08:04,407 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-02-20 16:08:04,407 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-02-20 16:08:04,407 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-02-20 16:08:04,407 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:08:04,408 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-02-20 16:08:04,408 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-02-20 16:08:04,408 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-02-20 16:08:04,408 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-02-20 16:08:04,408 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2022-02-20 16:08:04,408 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2022-02-20 16:08:04,408 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:08:04,408 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:08:04,408 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-02-20 16:08:04,409 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-02-20 16:08:04,409 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-02-20 16:08:04,409 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-02-20 16:08:04,409 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2022-02-20 16:08:04,409 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2022-02-20 16:08:04,409 WARN L170 areAnnotationChecker]: L185 has no Hoare annotation [2022-02-20 16:08:04,409 WARN L170 areAnnotationChecker]: L185 has no Hoare annotation [2022-02-20 16:08:04,409 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2022-02-20 16:08:04,410 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2022-02-20 16:08:04,410 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2022-02-20 16:08:04,410 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-02-20 16:08:04,410 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-02-20 16:08:04,410 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2022-02-20 16:08:04,410 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2022-02-20 16:08:04,410 WARN L170 areAnnotationChecker]: L104 has no Hoare annotation [2022-02-20 16:08:04,410 WARN L170 areAnnotationChecker]: L104 has no Hoare annotation [2022-02-20 16:08:04,410 WARN L170 areAnnotationChecker]: L118 has no Hoare annotation [2022-02-20 16:08:04,411 WARN L170 areAnnotationChecker]: L118 has no Hoare annotation [2022-02-20 16:08:04,411 WARN L170 areAnnotationChecker]: L186 has no Hoare annotation [2022-02-20 16:08:04,411 WARN L170 areAnnotationChecker]: L186 has no Hoare annotation [2022-02-20 16:08:04,411 WARN L170 areAnnotationChecker]: L285 has no Hoare annotation [2022-02-20 16:08:04,411 WARN L170 areAnnotationChecker]: L285 has no Hoare annotation [2022-02-20 16:08:04,411 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:08:04,411 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:08:04,411 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2022-02-20 16:08:04,412 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2022-02-20 16:08:04,412 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2022-02-20 16:08:04,412 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2022-02-20 16:08:04,412 WARN L170 areAnnotationChecker]: L120 has no Hoare annotation [2022-02-20 16:08:04,412 WARN L170 areAnnotationChecker]: L120 has no Hoare annotation [2022-02-20 16:08:04,412 WARN L170 areAnnotationChecker]: L134 has no Hoare annotation [2022-02-20 16:08:04,412 WARN L170 areAnnotationChecker]: L134 has no Hoare annotation [2022-02-20 16:08:04,412 WARN L170 areAnnotationChecker]: L188 has no Hoare annotation [2022-02-20 16:08:04,412 WARN L170 areAnnotationChecker]: L188 has no Hoare annotation [2022-02-20 16:08:04,413 WARN L170 areAnnotationChecker]: L202 has no Hoare annotation [2022-02-20 16:08:04,413 WARN L170 areAnnotationChecker]: L202 has no Hoare annotation [2022-02-20 16:08:04,413 WARN L170 areAnnotationChecker]: L286 has no Hoare annotation [2022-02-20 16:08:04,413 WARN L170 areAnnotationChecker]: L286 has no Hoare annotation [2022-02-20 16:08:04,413 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-02-20 16:08:04,413 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-02-20 16:08:04,413 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-02-20 16:08:04,413 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-02-20 16:08:04,413 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2022-02-20 16:08:04,414 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2022-02-20 16:08:04,414 WARN L170 areAnnotationChecker]: L150 has no Hoare annotation [2022-02-20 16:08:04,414 WARN L170 areAnnotationChecker]: L150 has no Hoare annotation [2022-02-20 16:08:04,414 WARN L170 areAnnotationChecker]: L192 has no Hoare annotation [2022-02-20 16:08:04,414 WARN L170 areAnnotationChecker]: L192 has no Hoare annotation [2022-02-20 16:08:04,414 WARN L170 areAnnotationChecker]: L204 has no Hoare annotation [2022-02-20 16:08:04,414 WARN L170 areAnnotationChecker]: L204 has no Hoare annotation [2022-02-20 16:08:04,414 WARN L170 areAnnotationChecker]: L218 has no Hoare annotation [2022-02-20 16:08:04,414 WARN L170 areAnnotationChecker]: L218 has no Hoare annotation [2022-02-20 16:08:04,415 WARN L170 areAnnotationChecker]: L288 has no Hoare annotation [2022-02-20 16:08:04,415 WARN L170 areAnnotationChecker]: L288 has no Hoare annotation [2022-02-20 16:08:04,415 WARN L170 areAnnotationChecker]: L302 has no Hoare annotation [2022-02-20 16:08:04,415 WARN L170 areAnnotationChecker]: L302 has no Hoare annotation [2022-02-20 16:08:04,415 WARN L170 areAnnotationChecker]: L140 has no Hoare annotation [2022-02-20 16:08:04,415 WARN L170 areAnnotationChecker]: L140 has no Hoare annotation [2022-02-20 16:08:04,415 WARN L170 areAnnotationChecker]: L152 has no Hoare annotation [2022-02-20 16:08:04,415 WARN L170 areAnnotationChecker]: L152 has no Hoare annotation [2022-02-20 16:08:04,416 WARN L170 areAnnotationChecker]: L166 has no Hoare annotation [2022-02-20 16:08:04,416 WARN L170 areAnnotationChecker]: L166 has no Hoare annotation [2022-02-20 16:08:04,416 WARN L170 areAnnotationChecker]: L208 has no Hoare annotation [2022-02-20 16:08:04,416 WARN L170 areAnnotationChecker]: L208 has no Hoare annotation [2022-02-20 16:08:04,416 WARN L170 areAnnotationChecker]: L220 has no Hoare annotation [2022-02-20 16:08:04,416 WARN L170 areAnnotationChecker]: L220 has no Hoare annotation [2022-02-20 16:08:04,416 WARN L170 areAnnotationChecker]: L234 has no Hoare annotation [2022-02-20 16:08:04,416 WARN L170 areAnnotationChecker]: L234 has no Hoare annotation [2022-02-20 16:08:04,416 WARN L170 areAnnotationChecker]: L292 has no Hoare annotation [2022-02-20 16:08:04,417 WARN L170 areAnnotationChecker]: L292 has no Hoare annotation [2022-02-20 16:08:04,417 WARN L170 areAnnotationChecker]: L304 has no Hoare annotation [2022-02-20 16:08:04,417 WARN L170 areAnnotationChecker]: L304 has no Hoare annotation [2022-02-20 16:08:04,417 WARN L170 areAnnotationChecker]: L318 has no Hoare annotation [2022-02-20 16:08:04,417 WARN L170 areAnnotationChecker]: L318 has no Hoare annotation [2022-02-20 16:08:04,417 WARN L170 areAnnotationChecker]: L156 has no Hoare annotation [2022-02-20 16:08:04,417 WARN L170 areAnnotationChecker]: L156 has no Hoare annotation [2022-02-20 16:08:04,417 WARN L170 areAnnotationChecker]: L168 has no Hoare annotation [2022-02-20 16:08:04,417 WARN L170 areAnnotationChecker]: L168 has no Hoare annotation [2022-02-20 16:08:04,418 WARN L170 areAnnotationChecker]: L224 has no Hoare annotation [2022-02-20 16:08:04,418 WARN L170 areAnnotationChecker]: L224 has no Hoare annotation [2022-02-20 16:08:04,418 WARN L170 areAnnotationChecker]: L236 has no Hoare annotation [2022-02-20 16:08:04,418 WARN L170 areAnnotationChecker]: L236 has no Hoare annotation [2022-02-20 16:08:04,418 WARN L170 areAnnotationChecker]: L250 has no Hoare annotation [2022-02-20 16:08:04,418 WARN L170 areAnnotationChecker]: L250 has no Hoare annotation [2022-02-20 16:08:04,418 WARN L170 areAnnotationChecker]: L308 has no Hoare annotation [2022-02-20 16:08:04,418 WARN L170 areAnnotationChecker]: L308 has no Hoare annotation [2022-02-20 16:08:04,418 WARN L170 areAnnotationChecker]: L320 has no Hoare annotation [2022-02-20 16:08:04,419 WARN L170 areAnnotationChecker]: L320 has no Hoare annotation [2022-02-20 16:08:04,419 WARN L170 areAnnotationChecker]: L334 has no Hoare annotation [2022-02-20 16:08:04,419 WARN L170 areAnnotationChecker]: L334 has no Hoare annotation [2022-02-20 16:08:04,419 WARN L170 areAnnotationChecker]: L172 has no Hoare annotation [2022-02-20 16:08:04,419 WARN L170 areAnnotationChecker]: L172 has no Hoare annotation [2022-02-20 16:08:04,419 WARN L170 areAnnotationChecker]: L240 has no Hoare annotation [2022-02-20 16:08:04,419 WARN L170 areAnnotationChecker]: L240 has no Hoare annotation [2022-02-20 16:08:04,419 WARN L170 areAnnotationChecker]: L252 has no Hoare annotation [2022-02-20 16:08:04,419 WARN L170 areAnnotationChecker]: L252 has no Hoare annotation [2022-02-20 16:08:04,420 WARN L170 areAnnotationChecker]: L266 has no Hoare annotation [2022-02-20 16:08:04,420 WARN L170 areAnnotationChecker]: L266 has no Hoare annotation [2022-02-20 16:08:04,420 WARN L170 areAnnotationChecker]: L324 has no Hoare annotation [2022-02-20 16:08:04,420 WARN L170 areAnnotationChecker]: L324 has no Hoare annotation [2022-02-20 16:08:04,420 WARN L170 areAnnotationChecker]: L336 has no Hoare annotation [2022-02-20 16:08:04,420 WARN L170 areAnnotationChecker]: L336 has no Hoare annotation [2022-02-20 16:08:04,420 WARN L170 areAnnotationChecker]: L350 has no Hoare annotation [2022-02-20 16:08:04,420 WARN L170 areAnnotationChecker]: L350 has no Hoare annotation [2022-02-20 16:08:04,420 WARN L170 areAnnotationChecker]: L256 has no Hoare annotation [2022-02-20 16:08:04,421 WARN L170 areAnnotationChecker]: L256 has no Hoare annotation [2022-02-20 16:08:04,421 WARN L170 areAnnotationChecker]: L268 has no Hoare annotation [2022-02-20 16:08:04,421 WARN L170 areAnnotationChecker]: L268 has no Hoare annotation [2022-02-20 16:08:04,421 WARN L170 areAnnotationChecker]: L340 has no Hoare annotation [2022-02-20 16:08:04,421 WARN L170 areAnnotationChecker]: L340 has no Hoare annotation [2022-02-20 16:08:04,421 WARN L170 areAnnotationChecker]: L352 has no Hoare annotation [2022-02-20 16:08:04,421 WARN L170 areAnnotationChecker]: L352 has no Hoare annotation [2022-02-20 16:08:04,421 WARN L170 areAnnotationChecker]: L366 has no Hoare annotation [2022-02-20 16:08:04,421 WARN L170 areAnnotationChecker]: L366 has no Hoare annotation [2022-02-20 16:08:04,421 WARN L170 areAnnotationChecker]: L272 has no Hoare annotation [2022-02-20 16:08:04,422 WARN L170 areAnnotationChecker]: L272 has no Hoare annotation [2022-02-20 16:08:04,422 WARN L170 areAnnotationChecker]: L356 has no Hoare annotation [2022-02-20 16:08:04,422 WARN L170 areAnnotationChecker]: L356 has no Hoare annotation [2022-02-20 16:08:04,422 WARN L170 areAnnotationChecker]: L368 has no Hoare annotation [2022-02-20 16:08:04,422 WARN L170 areAnnotationChecker]: L368 has no Hoare annotation [2022-02-20 16:08:04,422 WARN L170 areAnnotationChecker]: L372 has no Hoare annotation [2022-02-20 16:08:04,422 WARN L170 areAnnotationChecker]: L372 has no Hoare annotation [2022-02-20 16:08:04,422 INFO L163 areAnnotationChecker]: CFG has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:08:04,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:08:04 BoogieIcfgContainer [2022-02-20 16:08:04,432 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:08:04,433 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:08:04,433 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:08:04,433 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:08:04,434 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:08:00" (3/4) ... [2022-02-20 16:08:04,436 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 16:08:04,446 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-02-20 16:08:04,446 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 16:08:04,446 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 16:08:04,447 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 16:08:04,469 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:08:04,469 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:08:04,470 INFO L158 Benchmark]: Toolchain (without parser) took 4856.53ms. Allocated memory was 102.8MB in the beginning and 123.7MB in the end (delta: 21.0MB). Free memory was 73.6MB in the beginning and 85.7MB in the end (delta: -12.2MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2022-02-20 16:08:04,470 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 102.8MB. Free memory is still 60.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:08:04,471 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.58ms. Allocated memory is still 102.8MB. Free memory was 73.4MB in the beginning and 75.5MB in the end (delta: -2.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 16:08:04,471 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.14ms. Allocated memory is still 102.8MB. Free memory was 75.5MB in the beginning and 73.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:08:04,471 INFO L158 Benchmark]: Boogie Preprocessor took 39.86ms. Allocated memory is still 102.8MB. Free memory was 73.0MB in the beginning and 71.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:08:04,471 INFO L158 Benchmark]: RCFGBuilder took 489.63ms. Allocated memory is still 102.8MB. Free memory was 71.3MB in the beginning and 52.7MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-02-20 16:08:04,472 INFO L158 Benchmark]: TraceAbstraction took 3905.80ms. Allocated memory was 102.8MB in the beginning and 123.7MB in the end (delta: 21.0MB). Free memory was 52.4MB in the beginning and 87.8MB in the end (delta: -35.4MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. [2022-02-20 16:08:04,472 INFO L158 Benchmark]: Witness Printer took 36.20ms. Allocated memory is still 123.7MB. Free memory was 87.8MB in the beginning and 85.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:08:04,474 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.17ms. Allocated memory is still 102.8MB. Free memory is still 60.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 310.58ms. Allocated memory is still 102.8MB. Free memory was 73.4MB in the beginning and 75.5MB in the end (delta: -2.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.14ms. Allocated memory is still 102.8MB. Free memory was 75.5MB in the beginning and 73.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.86ms. Allocated memory is still 102.8MB. Free memory was 73.0MB in the beginning and 71.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 489.63ms. Allocated memory is still 102.8MB. Free memory was 71.3MB in the beginning and 52.7MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3905.80ms. Allocated memory was 102.8MB in the beginning and 123.7MB in the end (delta: 21.0MB). Free memory was 52.4MB in the beginning and 87.8MB in the end (delta: -35.4MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. * Witness Printer took 36.20ms. Allocated memory is still 123.7MB. Free memory was 87.8MB in the beginning and 85.7MB in the end (delta: 2.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: 391]: 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 1 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 201 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 201 mSDsluCounter, 1326 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 507 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 243 IncrementalHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 819 mSDtfsCounter, 243 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=4, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 41 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 11 NumberOfFragments, 43 HoareAnnotationTreeSize, 4 FomulaSimplifications, 16 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 153 NumberOfCodeBlocks, 153 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 145 ConstructedInterpolants, 0 QuantifiedInterpolants, 246 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 34/34 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: 24]: Loop Invariant Derived loop invariant: (((this_state == 3 && 4 <= q) || (2 == q && this_state == 0)) || q == 0) || (3 == q && this_state == 2) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: (this_state == 3 && 4 <= q) || (q == 0 && !(this_state == 2)) - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2022-02-20 16:08:04,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE