./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_7.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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/locks/test_locks_7.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 05c715fd95d2209519e9aa0425ca71b72050ac0ff5d332c8a9deb8ead8471230 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 11:32:36,848 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 11:32:36,850 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 11:32:36,883 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 11:32:36,884 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 11:32:36,885 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 11:32:36,886 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 11:32:36,888 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 11:32:36,889 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 11:32:36,893 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 11:32:36,893 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 11:32:36,895 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 11:32:36,895 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 11:32:36,897 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 11:32:36,898 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 11:32:36,900 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 11:32:36,901 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 11:32:36,902 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 11:32:36,903 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 11:32:36,907 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 11:32:36,908 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 11:32:36,909 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 11:32:36,910 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 11:32:36,910 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 11:32:36,911 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 11:32:36,924 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 11:32:36,924 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 11:32:36,925 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 11:32:36,925 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 11:32:36,926 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 11:32:36,927 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 11:32:36,927 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 11:32:36,928 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 11:32:36,929 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 11:32:36,929 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 11:32:36,930 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 11:32:36,931 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 11:32:36,931 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 11:32:36,931 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 11:32:36,931 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 11:32:36,932 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 11:32:36,933 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 11:32:36,934 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 11:32:36,956 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 11:32:36,957 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 11:32:36,957 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 11:32:36,957 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 11:32:36,958 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 11:32:36,958 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 11:32:36,959 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 11:32:36,959 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 11:32:36,959 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 11:32:36,960 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 11:32:36,960 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 11:32:36,960 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 11:32:36,960 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 11:32:36,960 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 11:32:36,960 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 11:32:36,961 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 11:32:36,961 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 11:32:36,961 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 11:32:36,961 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 11:32:36,962 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 11:32:36,962 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 11:32:36,962 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 11:32:36,962 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 11:32:36,963 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 11:32:36,963 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:32:36,963 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 11:32:36,963 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 11:32:36,963 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 11:32:36,963 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 11:32:36,963 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 11:32:36,964 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 11:32:36,964 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 11:32:36,964 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 11:32:36,964 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 -> 05c715fd95d2209519e9aa0425ca71b72050ac0ff5d332c8a9deb8ead8471230 [2022-07-13 11:32:37,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 11:32:37,155 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 11:32:37,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 11:32:37,158 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 11:32:37,159 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 11:32:37,159 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_7.c [2022-07-13 11:32:37,205 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/038215f33/931c279cd5474126b11efb49a7f1a69d/FLAG06aeb5aab [2022-07-13 11:32:37,563 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 11:32:37,564 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_7.c [2022-07-13 11:32:37,570 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/038215f33/931c279cd5474126b11efb49a7f1a69d/FLAG06aeb5aab [2022-07-13 11:32:37,580 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/038215f33/931c279cd5474126b11efb49a7f1a69d [2022-07-13 11:32:37,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 11:32:37,583 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 11:32:37,586 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 11:32:37,586 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 11:32:37,588 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 11:32:37,588 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:32:37" (1/1) ... [2022-07-13 11:32:37,589 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bf2e21d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:32:37, skipping insertion in model container [2022-07-13 11:32:37,589 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:32:37" (1/1) ... [2022-07-13 11:32:37,594 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 11:32:37,608 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:32:37,723 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/locks/test_locks_7.c[2881,2894] [2022-07-13 11:32:37,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:32:37,730 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 11:32:37,750 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/locks/test_locks_7.c[2881,2894] [2022-07-13 11:32:37,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:32:37,758 INFO L208 MainTranslator]: Completed translation [2022-07-13 11:32:37,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:32:37 WrapperNode [2022-07-13 11:32:37,759 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 11:32:37,760 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 11:32:37,760 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 11:32:37,760 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 11:32:37,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:32:37" (1/1) ... [2022-07-13 11:32:37,768 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:32:37" (1/1) ... [2022-07-13 11:32:37,783 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 105 [2022-07-13 11:32:37,784 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 11:32:37,784 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 11:32:37,784 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 11:32:37,784 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 11:32:37,789 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:32:37" (1/1) ... [2022-07-13 11:32:37,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:32:37" (1/1) ... [2022-07-13 11:32:37,791 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:32:37" (1/1) ... [2022-07-13 11:32:37,791 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:32:37" (1/1) ... [2022-07-13 11:32:37,793 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:32:37" (1/1) ... [2022-07-13 11:32:37,795 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:32:37" (1/1) ... [2022-07-13 11:32:37,796 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:32:37" (1/1) ... [2022-07-13 11:32:37,797 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 11:32:37,797 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 11:32:37,798 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 11:32:37,798 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 11:32:37,819 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:32:37" (1/1) ... [2022-07-13 11:32:37,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:32:37,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:32:37,839 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-07-13 11:32:37,844 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-07-13 11:32:37,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 11:32:37,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 11:32:37,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 11:32:37,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 11:32:37,907 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 11:32:37,909 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 11:32:38,024 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 11:32:38,037 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 11:32:38,038 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 11:32:38,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:32:38 BoogieIcfgContainer [2022-07-13 11:32:38,039 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 11:32:38,045 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 11:32:38,046 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 11:32:38,055 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 11:32:38,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:32:37" (1/3) ... [2022-07-13 11:32:38,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31508783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:32:38, skipping insertion in model container [2022-07-13 11:32:38,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:32:37" (2/3) ... [2022-07-13 11:32:38,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31508783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:32:38, skipping insertion in model container [2022-07-13 11:32:38,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:32:38" (3/3) ... [2022-07-13 11:32:38,057 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2022-07-13 11:32:38,067 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 11:32:38,067 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 11:32:38,105 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 11:32:38,117 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@67a1e289, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@31bb9c3a [2022-07-13 11:32:38,117 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 11:32:38,121 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 30 states have internal predecessors, (54), 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-07-13 11:32:38,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-13 11:32:38,125 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:38,126 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:38,126 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:38,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:38,130 INFO L85 PathProgramCache]: Analyzing trace with hash -882170869, now seen corresponding path program 1 times [2022-07-13 11:32:38,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:38,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122085040] [2022-07-13 11:32:38,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:38,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:38,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:38,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:32:38,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:38,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122085040] [2022-07-13 11:32:38,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122085040] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:38,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:38,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:38,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963464806] [2022-07-13 11:32:38,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:38,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:38,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:38,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:38,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:38,319 INFO L87 Difference]: Start difference. First operand has 31 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 30 states have internal predecessors, (54), 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 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-07-13 11:32:38,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:38,362 INFO L93 Difference]: Finished difference Result 65 states and 109 transitions. [2022-07-13 11:32:38,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:38,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2022-07-13 11:32:38,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:38,378 INFO L225 Difference]: With dead ends: 65 [2022-07-13 11:32:38,378 INFO L226 Difference]: Without dead ends: 51 [2022-07-13 11:32:38,381 INFO L412 NwaCegarLoop]: 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-07-13 11:32:38,385 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 37 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:38,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 103 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:32:38,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-13 11:32:38,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 35. [2022-07-13 11:32:38,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 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-07-13 11:32:38,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 62 transitions. [2022-07-13 11:32:38,414 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 62 transitions. Word has length 14 [2022-07-13 11:32:38,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:38,415 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 62 transitions. [2022-07-13 11:32:38,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-07-13 11:32:38,415 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 62 transitions. [2022-07-13 11:32:38,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-13 11:32:38,416 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:38,416 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:38,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 11:32:38,417 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:38,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:38,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1275197879, now seen corresponding path program 1 times [2022-07-13 11:32:38,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:38,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068442312] [2022-07-13 11:32:38,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:38,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:38,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:38,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:32:38,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:38,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068442312] [2022-07-13 11:32:38,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068442312] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:38,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:38,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:38,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558307779] [2022-07-13 11:32:38,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:38,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:38,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:38,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:38,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:38,479 INFO L87 Difference]: Start difference. First operand 35 states and 62 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-07-13 11:32:38,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:38,506 INFO L93 Difference]: Finished difference Result 84 states and 149 transitions. [2022-07-13 11:32:38,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:38,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2022-07-13 11:32:38,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:38,507 INFO L225 Difference]: With dead ends: 84 [2022-07-13 11:32:38,507 INFO L226 Difference]: Without dead ends: 51 [2022-07-13 11:32:38,508 INFO L412 NwaCegarLoop]: 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-07-13 11:32:38,509 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 33 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:38,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 101 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:32:38,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-13 11:32:38,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2022-07-13 11:32:38,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.7916666666666667) internal successors, (86), 48 states have internal predecessors, (86), 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-07-13 11:32:38,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 86 transitions. [2022-07-13 11:32:38,517 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 86 transitions. Word has length 14 [2022-07-13 11:32:38,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:38,518 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 86 transitions. [2022-07-13 11:32:38,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-07-13 11:32:38,518 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 86 transitions. [2022-07-13 11:32:38,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-13 11:32:38,520 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:38,520 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:38,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 11:32:38,522 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:38,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:38,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1577278843, now seen corresponding path program 1 times [2022-07-13 11:32:38,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:38,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232436364] [2022-07-13 11:32:38,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:38,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:38,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:38,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:32:38,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:38,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232436364] [2022-07-13 11:32:38,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232436364] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:38,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:38,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:38,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542750895] [2022-07-13 11:32:38,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:38,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:38,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:38,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:38,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:38,553 INFO L87 Difference]: Start difference. First operand 49 states and 86 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-07-13 11:32:38,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:38,563 INFO L93 Difference]: Finished difference Result 78 states and 132 transitions. [2022-07-13 11:32:38,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:38,563 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-07-13 11:32:38,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:38,564 INFO L225 Difference]: With dead ends: 78 [2022-07-13 11:32:38,564 INFO L226 Difference]: Without dead ends: 54 [2022-07-13 11:32:38,565 INFO L412 NwaCegarLoop]: 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-07-13 11:32:38,565 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 35 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:38,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 112 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:32:38,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-13 11:32:38,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2022-07-13 11:32:38,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.7254901960784315) internal successors, (88), 51 states have internal predecessors, (88), 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-07-13 11:32:38,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 88 transitions. [2022-07-13 11:32:38,571 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 88 transitions. Word has length 15 [2022-07-13 11:32:38,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:38,571 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 88 transitions. [2022-07-13 11:32:38,572 INFO L496 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-07-13 11:32:38,572 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 88 transitions. [2022-07-13 11:32:38,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-13 11:32:38,572 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:38,572 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:38,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 11:32:38,573 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:38,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:38,573 INFO L85 PathProgramCache]: Analyzing trace with hash -876214265, now seen corresponding path program 1 times [2022-07-13 11:32:38,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:38,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295566887] [2022-07-13 11:32:38,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:38,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:38,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:38,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:32:38,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:38,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295566887] [2022-07-13 11:32:38,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295566887] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:38,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:38,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:38,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241714694] [2022-07-13 11:32:38,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:38,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:38,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:38,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:38,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:38,599 INFO L87 Difference]: Start difference. First operand 52 states and 88 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-07-13 11:32:38,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:38,609 INFO L93 Difference]: Finished difference Result 97 states and 165 transitions. [2022-07-13 11:32:38,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:38,610 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-07-13 11:32:38,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:38,612 INFO L225 Difference]: With dead ends: 97 [2022-07-13 11:32:38,612 INFO L226 Difference]: Without dead ends: 95 [2022-07-13 11:32:38,612 INFO L412 NwaCegarLoop]: 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-07-13 11:32:38,614 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 30 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:38,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 89 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:32:38,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-13 11:32:38,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 69. [2022-07-13 11:32:38,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.7205882352941178) internal successors, (117), 68 states have internal predecessors, (117), 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-07-13 11:32:38,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 117 transitions. [2022-07-13 11:32:38,621 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 117 transitions. Word has length 15 [2022-07-13 11:32:38,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:38,621 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 117 transitions. [2022-07-13 11:32:38,622 INFO L496 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-07-13 11:32:38,622 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 117 transitions. [2022-07-13 11:32:38,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-13 11:32:38,624 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:38,625 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:38,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 11:32:38,625 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:38,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:38,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1269241275, now seen corresponding path program 1 times [2022-07-13 11:32:38,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:38,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362130001] [2022-07-13 11:32:38,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:38,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:38,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:38,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:32:38,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:38,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362130001] [2022-07-13 11:32:38,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362130001] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:38,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:38,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:38,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497340923] [2022-07-13 11:32:38,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:38,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:38,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:38,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:38,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:38,660 INFO L87 Difference]: Start difference. First operand 69 states and 117 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-07-13 11:32:38,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:38,684 INFO L93 Difference]: Finished difference Result 161 states and 275 transitions. [2022-07-13 11:32:38,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:38,685 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-07-13 11:32:38,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:38,685 INFO L225 Difference]: With dead ends: 161 [2022-07-13 11:32:38,685 INFO L226 Difference]: Without dead ends: 97 [2022-07-13 11:32:38,686 INFO L412 NwaCegarLoop]: 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-07-13 11:32:38,687 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 32 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:38,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 102 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:32:38,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-13 11:32:38,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2022-07-13 11:32:38,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.6914893617021276) internal successors, (159), 94 states have internal predecessors, (159), 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-07-13 11:32:38,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 159 transitions. [2022-07-13 11:32:38,692 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 159 transitions. Word has length 15 [2022-07-13 11:32:38,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:38,693 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 159 transitions. [2022-07-13 11:32:38,693 INFO L496 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-07-13 11:32:38,693 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 159 transitions. [2022-07-13 11:32:38,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 11:32:38,693 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:38,693 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:38,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 11:32:38,694 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:38,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:38,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1392623778, now seen corresponding path program 1 times [2022-07-13 11:32:38,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:38,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136866559] [2022-07-13 11:32:38,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:38,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:38,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:38,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:32:38,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:38,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136866559] [2022-07-13 11:32:38,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136866559] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:38,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:38,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:38,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869801534] [2022-07-13 11:32:38,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:38,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:38,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:38,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:38,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:38,730 INFO L87 Difference]: Start difference. First operand 95 states and 159 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-07-13 11:32:38,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:38,750 INFO L93 Difference]: Finished difference Result 144 states and 238 transitions. [2022-07-13 11:32:38,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:38,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2022-07-13 11:32:38,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:38,752 INFO L225 Difference]: With dead ends: 144 [2022-07-13 11:32:38,752 INFO L226 Difference]: Without dead ends: 99 [2022-07-13 11:32:38,752 INFO L412 NwaCegarLoop]: 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-07-13 11:32:38,753 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 34 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:38,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 108 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:32:38,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-13 11:32:38,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2022-07-13 11:32:38,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.65625) internal successors, (159), 96 states have internal predecessors, (159), 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-07-13 11:32:38,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 159 transitions. [2022-07-13 11:32:38,760 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 159 transitions. Word has length 16 [2022-07-13 11:32:38,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:38,760 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 159 transitions. [2022-07-13 11:32:38,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-07-13 11:32:38,761 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 159 transitions. [2022-07-13 11:32:38,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 11:32:38,761 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:38,761 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:38,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 11:32:38,762 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:38,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:38,777 INFO L85 PathProgramCache]: Analyzing trace with hash -691559200, now seen corresponding path program 1 times [2022-07-13 11:32:38,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:38,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569412135] [2022-07-13 11:32:38,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:38,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:38,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:32:38,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:38,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569412135] [2022-07-13 11:32:38,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569412135] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:38,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:38,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:38,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189533225] [2022-07-13 11:32:38,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:38,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:38,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:38,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:38,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:38,801 INFO L87 Difference]: Start difference. First operand 97 states and 159 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-07-13 11:32:38,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:38,810 INFO L93 Difference]: Finished difference Result 273 states and 449 transitions. [2022-07-13 11:32:38,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:38,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2022-07-13 11:32:38,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:38,811 INFO L225 Difference]: With dead ends: 273 [2022-07-13 11:32:38,811 INFO L226 Difference]: Without dead ends: 183 [2022-07-13 11:32:38,812 INFO L412 NwaCegarLoop]: 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-07-13 11:32:38,812 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 32 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:38,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 91 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:32:38,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-07-13 11:32:38,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2022-07-13 11:32:38,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.6166666666666667) internal successors, (291), 180 states have internal predecessors, (291), 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-07-13 11:32:38,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 291 transitions. [2022-07-13 11:32:38,821 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 291 transitions. Word has length 16 [2022-07-13 11:32:38,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:38,821 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 291 transitions. [2022-07-13 11:32:38,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-07-13 11:32:38,821 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 291 transitions. [2022-07-13 11:32:38,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 11:32:38,822 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:38,822 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:38,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 11:32:38,822 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:38,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:38,823 INFO L85 PathProgramCache]: Analyzing trace with hash -298532190, now seen corresponding path program 1 times [2022-07-13 11:32:38,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:38,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838313920] [2022-07-13 11:32:38,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:38,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:38,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:38,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:32:38,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:38,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838313920] [2022-07-13 11:32:38,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838313920] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:38,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:38,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:38,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88185764] [2022-07-13 11:32:38,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:38,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:38,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:38,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:38,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:38,849 INFO L87 Difference]: Start difference. First operand 181 states and 291 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-07-13 11:32:38,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:38,861 INFO L93 Difference]: Finished difference Result 225 states and 365 transitions. [2022-07-13 11:32:38,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:38,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2022-07-13 11:32:38,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:38,863 INFO L225 Difference]: With dead ends: 225 [2022-07-13 11:32:38,863 INFO L226 Difference]: Without dead ends: 223 [2022-07-13 11:32:38,864 INFO L412 NwaCegarLoop]: 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-07-13 11:32:38,864 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 27 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:38,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 116 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:32:38,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-07-13 11:32:38,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 181. [2022-07-13 11:32:38,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.5944444444444446) internal successors, (287), 180 states have internal predecessors, (287), 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-07-13 11:32:38,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 287 transitions. [2022-07-13 11:32:38,875 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 287 transitions. Word has length 16 [2022-07-13 11:32:38,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:38,875 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 287 transitions. [2022-07-13 11:32:38,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-07-13 11:32:38,876 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 287 transitions. [2022-07-13 11:32:38,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-13 11:32:38,877 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:38,877 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:38,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 11:32:38,878 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:38,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:38,878 INFO L85 PathProgramCache]: Analyzing trace with hash 36716282, now seen corresponding path program 1 times [2022-07-13 11:32:38,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:38,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467687026] [2022-07-13 11:32:38,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:38,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:38,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:38,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:32:38,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:38,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467687026] [2022-07-13 11:32:38,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467687026] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:38,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:38,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:38,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390183009] [2022-07-13 11:32:38,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:38,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:38,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:38,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:38,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:38,899 INFO L87 Difference]: Start difference. First operand 181 states and 287 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-07-13 11:32:38,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:38,909 INFO L93 Difference]: Finished difference Result 325 states and 521 transitions. [2022-07-13 11:32:38,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:38,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2022-07-13 11:32:38,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:38,911 INFO L225 Difference]: With dead ends: 325 [2022-07-13 11:32:38,911 INFO L226 Difference]: Without dead ends: 323 [2022-07-13 11:32:38,912 INFO L412 NwaCegarLoop]: 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-07-13 11:32:38,912 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 24 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:38,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 85 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:32:38,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-07-13 11:32:38,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 257. [2022-07-13 11:32:38,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 1.55859375) internal successors, (399), 256 states have internal predecessors, (399), 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-07-13 11:32:38,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 399 transitions. [2022-07-13 11:32:38,927 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 399 transitions. Word has length 17 [2022-07-13 11:32:38,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:38,927 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 399 transitions. [2022-07-13 11:32:38,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-07-13 11:32:38,927 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 399 transitions. [2022-07-13 11:32:38,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-13 11:32:38,929 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:38,929 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:38,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 11:32:38,929 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:38,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:38,930 INFO L85 PathProgramCache]: Analyzing trace with hash -356310728, now seen corresponding path program 1 times [2022-07-13 11:32:38,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:38,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263415532] [2022-07-13 11:32:38,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:38,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:38,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:38,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:32:38,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:38,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263415532] [2022-07-13 11:32:38,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263415532] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:38,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:38,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:38,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875529928] [2022-07-13 11:32:38,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:38,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:38,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:38,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:38,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:38,958 INFO L87 Difference]: Start difference. First operand 257 states and 399 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-07-13 11:32:38,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:38,971 INFO L93 Difference]: Finished difference Result 597 states and 929 transitions. [2022-07-13 11:32:38,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:38,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2022-07-13 11:32:38,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:38,972 INFO L225 Difference]: With dead ends: 597 [2022-07-13 11:32:38,972 INFO L226 Difference]: Without dead ends: 347 [2022-07-13 11:32:38,973 INFO L412 NwaCegarLoop]: 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-07-13 11:32:38,974 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 30 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:38,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 104 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:32:38,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-07-13 11:32:38,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 345. [2022-07-13 11:32:38,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 344 states have (on average 1.5203488372093024) internal successors, (523), 344 states have internal predecessors, (523), 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-07-13 11:32:38,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 523 transitions. [2022-07-13 11:32:38,989 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 523 transitions. Word has length 17 [2022-07-13 11:32:38,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:38,989 INFO L495 AbstractCegarLoop]: Abstraction has 345 states and 523 transitions. [2022-07-13 11:32:38,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-07-13 11:32:38,989 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 523 transitions. [2022-07-13 11:32:38,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-13 11:32:38,990 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:38,990 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:38,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 11:32:38,991 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:38,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:38,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1138420085, now seen corresponding path program 1 times [2022-07-13 11:32:38,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:38,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237169060] [2022-07-13 11:32:38,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:38,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:38,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:39,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:32:39,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:39,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237169060] [2022-07-13 11:32:39,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237169060] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:39,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:39,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:39,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938723998] [2022-07-13 11:32:39,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:39,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:39,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:39,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:39,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:39,012 INFO L87 Difference]: Start difference. First operand 345 states and 523 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-07-13 11:32:39,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:39,025 INFO L93 Difference]: Finished difference Result 525 states and 793 transitions. [2022-07-13 11:32:39,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:39,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-07-13 11:32:39,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:39,027 INFO L225 Difference]: With dead ends: 525 [2022-07-13 11:32:39,027 INFO L226 Difference]: Without dead ends: 359 [2022-07-13 11:32:39,027 INFO L412 NwaCegarLoop]: 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-07-13 11:32:39,028 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 32 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:39,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 100 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:32:39,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-07-13 11:32:39,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 357. [2022-07-13 11:32:39,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 1.4915730337078652) internal successors, (531), 356 states have internal predecessors, (531), 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-07-13 11:32:39,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 531 transitions. [2022-07-13 11:32:39,045 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 531 transitions. Word has length 18 [2022-07-13 11:32:39,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:39,045 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 531 transitions. [2022-07-13 11:32:39,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-07-13 11:32:39,046 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 531 transitions. [2022-07-13 11:32:39,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-13 11:32:39,050 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:39,050 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:39,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 11:32:39,051 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:39,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:39,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1839484663, now seen corresponding path program 1 times [2022-07-13 11:32:39,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:39,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263976154] [2022-07-13 11:32:39,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:39,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:39,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:39,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:32:39,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:39,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263976154] [2022-07-13 11:32:39,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263976154] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:39,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:39,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:39,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192752317] [2022-07-13 11:32:39,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:39,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:39,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:39,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:39,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:39,083 INFO L87 Difference]: Start difference. First operand 357 states and 531 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-07-13 11:32:39,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:39,095 INFO L93 Difference]: Finished difference Result 617 states and 925 transitions. [2022-07-13 11:32:39,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:39,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-07-13 11:32:39,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:39,099 INFO L225 Difference]: With dead ends: 617 [2022-07-13 11:32:39,099 INFO L226 Difference]: Without dead ends: 615 [2022-07-13 11:32:39,099 INFO L412 NwaCegarLoop]: 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-07-13 11:32:39,100 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 21 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:39,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 83 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:32:39,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2022-07-13 11:32:39,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 517. [2022-07-13 11:32:39,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 516 states have (on average 1.447674418604651) internal successors, (747), 516 states have internal predecessors, (747), 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-07-13 11:32:39,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 747 transitions. [2022-07-13 11:32:39,109 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 747 transitions. Word has length 18 [2022-07-13 11:32:39,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:39,109 INFO L495 AbstractCegarLoop]: Abstraction has 517 states and 747 transitions. [2022-07-13 11:32:39,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-07-13 11:32:39,110 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 747 transitions. [2022-07-13 11:32:39,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-13 11:32:39,110 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:39,111 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:39,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 11:32:39,111 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:39,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:39,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1446457653, now seen corresponding path program 1 times [2022-07-13 11:32:39,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:39,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692852226] [2022-07-13 11:32:39,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:39,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:39,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:39,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:32:39,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:39,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692852226] [2022-07-13 11:32:39,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692852226] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:39,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:39,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:39,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778088287] [2022-07-13 11:32:39,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:39,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:39,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:39,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:39,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:39,131 INFO L87 Difference]: Start difference. First operand 517 states and 747 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-07-13 11:32:39,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:39,144 INFO L93 Difference]: Finished difference Result 1177 states and 1693 transitions. [2022-07-13 11:32:39,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:39,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-07-13 11:32:39,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:39,146 INFO L225 Difference]: With dead ends: 1177 [2022-07-13 11:32:39,146 INFO L226 Difference]: Without dead ends: 679 [2022-07-13 11:32:39,147 INFO L412 NwaCegarLoop]: 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-07-13 11:32:39,148 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 29 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:39,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 105 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:32:39,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2022-07-13 11:32:39,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 677. [2022-07-13 11:32:39,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 676 states have (on average 1.400887573964497) internal successors, (947), 676 states have internal predecessors, (947), 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-07-13 11:32:39,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 947 transitions. [2022-07-13 11:32:39,162 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 947 transitions. Word has length 18 [2022-07-13 11:32:39,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:39,163 INFO L495 AbstractCegarLoop]: Abstraction has 677 states and 947 transitions. [2022-07-13 11:32:39,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-07-13 11:32:39,164 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 947 transitions. [2022-07-13 11:32:39,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-13 11:32:39,164 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:39,164 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:39,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 11:32:39,165 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:39,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:39,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1189665389, now seen corresponding path program 1 times [2022-07-13 11:32:39,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:39,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394148488] [2022-07-13 11:32:39,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:39,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:39,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:39,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:32:39,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:39,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394148488] [2022-07-13 11:32:39,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394148488] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:39,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:39,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:39,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465948894] [2022-07-13 11:32:39,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:39,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:39,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:39,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:39,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:39,178 INFO L87 Difference]: Start difference. First operand 677 states and 947 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-07-13 11:32:39,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:39,193 INFO L93 Difference]: Finished difference Result 1017 states and 1413 transitions. [2022-07-13 11:32:39,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:39,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2022-07-13 11:32:39,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:39,196 INFO L225 Difference]: With dead ends: 1017 [2022-07-13 11:32:39,198 INFO L226 Difference]: Without dead ends: 695 [2022-07-13 11:32:39,198 INFO L412 NwaCegarLoop]: 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-07-13 11:32:39,199 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 31 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:39,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 96 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:32:39,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2022-07-13 11:32:39,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 693. [2022-07-13 11:32:39,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 692 states have (on average 1.3684971098265897) internal successors, (947), 692 states have internal predecessors, (947), 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-07-13 11:32:39,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 947 transitions. [2022-07-13 11:32:39,211 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 947 transitions. Word has length 19 [2022-07-13 11:32:39,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:39,212 INFO L495 AbstractCegarLoop]: Abstraction has 693 states and 947 transitions. [2022-07-13 11:32:39,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-07-13 11:32:39,212 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 947 transitions. [2022-07-13 11:32:39,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-13 11:32:39,213 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:39,213 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:39,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 11:32:39,213 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:39,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:39,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1890729967, now seen corresponding path program 1 times [2022-07-13 11:32:39,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:39,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492436143] [2022-07-13 11:32:39,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:39,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:39,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:39,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:32:39,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:39,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492436143] [2022-07-13 11:32:39,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492436143] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:39,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:39,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:39,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165248168] [2022-07-13 11:32:39,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:39,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:39,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:39,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:39,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:39,238 INFO L87 Difference]: Start difference. First operand 693 states and 947 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-07-13 11:32:39,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:39,262 INFO L93 Difference]: Finished difference Result 1161 states and 1589 transitions. [2022-07-13 11:32:39,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:39,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2022-07-13 11:32:39,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:39,266 INFO L225 Difference]: With dead ends: 1161 [2022-07-13 11:32:39,266 INFO L226 Difference]: Without dead ends: 1159 [2022-07-13 11:32:39,267 INFO L412 NwaCegarLoop]: 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-07-13 11:32:39,268 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 18 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:39,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 81 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:32:39,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2022-07-13 11:32:39,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1029. [2022-07-13 11:32:39,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 1028 states have (on average 1.325875486381323) internal successors, (1363), 1028 states have internal predecessors, (1363), 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-07-13 11:32:39,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1363 transitions. [2022-07-13 11:32:39,288 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1363 transitions. Word has length 19 [2022-07-13 11:32:39,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:39,288 INFO L495 AbstractCegarLoop]: Abstraction has 1029 states and 1363 transitions. [2022-07-13 11:32:39,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-07-13 11:32:39,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1363 transitions. [2022-07-13 11:32:39,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-13 11:32:39,290 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:39,291 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:39,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-13 11:32:39,291 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:39,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:39,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1497702957, now seen corresponding path program 1 times [2022-07-13 11:32:39,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:39,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240451950] [2022-07-13 11:32:39,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:39,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:39,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:39,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:32:39,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:39,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240451950] [2022-07-13 11:32:39,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240451950] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:39,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:39,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:39,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337307257] [2022-07-13 11:32:39,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:39,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:39,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:39,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:39,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:39,333 INFO L87 Difference]: Start difference. First operand 1029 states and 1363 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-07-13 11:32:39,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:39,358 INFO L93 Difference]: Finished difference Result 2313 states and 3029 transitions. [2022-07-13 11:32:39,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:39,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2022-07-13 11:32:39,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:39,374 INFO L225 Difference]: With dead ends: 2313 [2022-07-13 11:32:39,374 INFO L226 Difference]: Without dead ends: 1319 [2022-07-13 11:32:39,375 INFO L412 NwaCegarLoop]: 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-07-13 11:32:39,376 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 28 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:39,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 106 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:32:39,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2022-07-13 11:32:39,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1317. [2022-07-13 11:32:39,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1317 states, 1316 states have (on average 1.2667173252279635) internal successors, (1667), 1316 states have internal predecessors, (1667), 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-07-13 11:32:39,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1667 transitions. [2022-07-13 11:32:39,405 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1667 transitions. Word has length 19 [2022-07-13 11:32:39,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:39,405 INFO L495 AbstractCegarLoop]: Abstraction has 1317 states and 1667 transitions. [2022-07-13 11:32:39,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-07-13 11:32:39,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1667 transitions. [2022-07-13 11:32:39,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 11:32:39,406 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:39,407 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:39,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 11:32:39,407 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:39,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:39,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1516697142, now seen corresponding path program 1 times [2022-07-13 11:32:39,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:39,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599158552] [2022-07-13 11:32:39,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:39,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:39,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:32:39,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:39,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599158552] [2022-07-13 11:32:39,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599158552] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:39,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:39,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:39,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572117592] [2022-07-13 11:32:39,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:39,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:39,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:39,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:39,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:39,431 INFO L87 Difference]: Start difference. First operand 1317 states and 1667 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-07-13 11:32:39,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:39,449 INFO L93 Difference]: Finished difference Result 1977 states and 2485 transitions. [2022-07-13 11:32:39,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:39,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2022-07-13 11:32:39,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:39,453 INFO L225 Difference]: With dead ends: 1977 [2022-07-13 11:32:39,454 INFO L226 Difference]: Without dead ends: 1351 [2022-07-13 11:32:39,454 INFO L412 NwaCegarLoop]: 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-07-13 11:32:39,455 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 30 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:39,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 92 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:32:39,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2022-07-13 11:32:39,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1349. [2022-07-13 11:32:39,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1349 states, 1348 states have (on average 1.236646884272997) internal successors, (1667), 1348 states have internal predecessors, (1667), 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-07-13 11:32:39,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 1667 transitions. [2022-07-13 11:32:39,480 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 1667 transitions. Word has length 20 [2022-07-13 11:32:39,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:39,480 INFO L495 AbstractCegarLoop]: Abstraction has 1349 states and 1667 transitions. [2022-07-13 11:32:39,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-07-13 11:32:39,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 1667 transitions. [2022-07-13 11:32:39,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 11:32:39,481 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:39,481 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:39,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 11:32:39,481 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:39,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:39,482 INFO L85 PathProgramCache]: Analyzing trace with hash -815632564, now seen corresponding path program 1 times [2022-07-13 11:32:39,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:39,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433017551] [2022-07-13 11:32:39,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:39,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:39,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:39,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:32:39,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:39,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433017551] [2022-07-13 11:32:39,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433017551] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:39,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:39,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:39,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859592521] [2022-07-13 11:32:39,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:39,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:39,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:39,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:39,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:39,508 INFO L87 Difference]: Start difference. First operand 1349 states and 1667 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-07-13 11:32:39,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:39,540 INFO L93 Difference]: Finished difference Result 2183 states and 2660 transitions. [2022-07-13 11:32:39,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:39,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2022-07-13 11:32:39,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:39,545 INFO L225 Difference]: With dead ends: 2183 [2022-07-13 11:32:39,545 INFO L226 Difference]: Without dead ends: 2181 [2022-07-13 11:32:39,545 INFO L412 NwaCegarLoop]: 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-07-13 11:32:39,546 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 14 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:39,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 78 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:32:39,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2181 states. [2022-07-13 11:32:39,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2181 to 2053. [2022-07-13 11:32:39,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2053 states, 2052 states have (on average 1.2022417153996101) internal successors, (2467), 2052 states have internal predecessors, (2467), 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-07-13 11:32:39,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 2467 transitions. [2022-07-13 11:32:39,582 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 2467 transitions. Word has length 20 [2022-07-13 11:32:39,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:39,583 INFO L495 AbstractCegarLoop]: Abstraction has 2053 states and 2467 transitions. [2022-07-13 11:32:39,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-07-13 11:32:39,583 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 2467 transitions. [2022-07-13 11:32:39,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 11:32:39,585 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:39,585 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:39,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-13 11:32:39,585 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:39,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:39,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1208659574, now seen corresponding path program 1 times [2022-07-13 11:32:39,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:39,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136632657] [2022-07-13 11:32:39,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:39,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:39,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:39,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:32:39,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:39,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136632657] [2022-07-13 11:32:39,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136632657] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:39,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:39,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:39,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953133476] [2022-07-13 11:32:39,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:39,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:39,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:39,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:39,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:39,624 INFO L87 Difference]: Start difference. First operand 2053 states and 2467 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-07-13 11:32:39,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:39,661 INFO L93 Difference]: Finished difference Result 4549 states and 5347 transitions. [2022-07-13 11:32:39,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:39,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2022-07-13 11:32:39,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:39,662 INFO L225 Difference]: With dead ends: 4549 [2022-07-13 11:32:39,662 INFO L226 Difference]: Without dead ends: 0 [2022-07-13 11:32:39,665 INFO L412 NwaCegarLoop]: 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-07-13 11:32:39,666 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 26 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:39,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 105 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:32:39,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-13 11:32:39,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-13 11:32:39,667 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-07-13 11:32:39,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-13 11:32:39,667 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2022-07-13 11:32:39,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:39,667 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 11:32:39,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-07-13 11:32:39,667 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-13 11:32:39,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-13 11:32:39,669 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 11:32:39,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-13 11:32:39,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-13 11:32:39,681 INFO L899 garLoopResultBuilder]: For program point L93-1(lines 32 118) no Hoare annotation was computed. [2022-07-13 11:32:39,683 INFO L899 garLoopResultBuilder]: For program point L77-1(lines 32 118) no Hoare annotation was computed. [2022-07-13 11:32:39,683 INFO L899 garLoopResultBuilder]: For program point L69-1(lines 32 118) no Hoare annotation was computed. [2022-07-13 11:32:39,683 INFO L899 garLoopResultBuilder]: For program point L94(line 94) no Hoare annotation was computed. [2022-07-13 11:32:39,683 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-13 11:32:39,683 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-13 11:32:39,683 INFO L899 garLoopResultBuilder]: For program point L61-1(lines 32 118) no Hoare annotation was computed. [2022-07-13 11:32:39,684 INFO L902 garLoopResultBuilder]: At program point L119(lines 7 123) the Hoare annotation is: true [2022-07-13 11:32:39,684 INFO L899 garLoopResultBuilder]: For program point L53(lines 53 55) no Hoare annotation was computed. [2022-07-13 11:32:39,684 INFO L899 garLoopResultBuilder]: For program point L53-2(lines 32 118) no Hoare annotation was computed. [2022-07-13 11:32:39,684 INFO L899 garLoopResultBuilder]: For program point L103-1(lines 32 118) no Hoare annotation was computed. [2022-07-13 11:32:39,684 INFO L899 garLoopResultBuilder]: For program point L104(line 104) no Hoare annotation was computed. [2022-07-13 11:32:39,684 INFO L899 garLoopResultBuilder]: For program point L88-1(lines 32 118) no Hoare annotation was computed. [2022-07-13 11:32:39,684 INFO L902 garLoopResultBuilder]: At program point L113-1(lines 32 118) the Hoare annotation is: true [2022-07-13 11:32:39,684 INFO L902 garLoopResultBuilder]: At program point L122(lines 6 123) the Hoare annotation is: true [2022-07-13 11:32:39,684 INFO L899 garLoopResultBuilder]: For program point L89(line 89) no Hoare annotation was computed. [2022-07-13 11:32:39,684 INFO L899 garLoopResultBuilder]: For program point L114(line 114) no Hoare annotation was computed. [2022-07-13 11:32:39,684 INFO L895 garLoopResultBuilder]: At program point L114-1(lines 7 123) the Hoare annotation is: false [2022-07-13 11:32:39,684 INFO L899 garLoopResultBuilder]: For program point L73-1(lines 32 118) no Hoare annotation was computed. [2022-07-13 11:32:39,685 INFO L899 garLoopResultBuilder]: For program point L98-1(lines 32 118) no Hoare annotation was computed. [2022-07-13 11:32:39,685 INFO L899 garLoopResultBuilder]: For program point L65-1(lines 32 118) no Hoare annotation was computed. [2022-07-13 11:32:39,685 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-13 11:32:39,686 INFO L899 garLoopResultBuilder]: For program point L57-1(lines 32 118) no Hoare annotation was computed. [2022-07-13 11:32:39,686 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 121) no Hoare annotation was computed. [2022-07-13 11:32:39,686 INFO L899 garLoopResultBuilder]: For program point L99(line 99) no Hoare annotation was computed. [2022-07-13 11:32:39,686 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-13 11:32:39,686 INFO L899 garLoopResultBuilder]: For program point L83-1(lines 32 118) no Hoare annotation was computed. [2022-07-13 11:32:39,686 INFO L899 garLoopResultBuilder]: For program point L108-1(lines 32 118) no Hoare annotation was computed. [2022-07-13 11:32:39,686 INFO L899 garLoopResultBuilder]: For program point L34(lines 34 36) no Hoare annotation was computed. [2022-07-13 11:32:39,686 INFO L899 garLoopResultBuilder]: For program point L84(line 84) no Hoare annotation was computed. [2022-07-13 11:32:39,686 INFO L899 garLoopResultBuilder]: For program point L109(line 109) no Hoare annotation was computed. [2022-07-13 11:32:39,689 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:39,692 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 11:32:39,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 11:32:39 BoogieIcfgContainer [2022-07-13 11:32:39,701 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 11:32:39,701 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 11:32:39,701 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 11:32:39,701 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 11:32:39,702 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:32:38" (3/4) ... [2022-07-13 11:32:39,705 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-13 11:32:39,714 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-07-13 11:32:39,714 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-13 11:32:39,715 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-13 11:32:39,715 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-13 11:32:39,747 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 11:32:39,747 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 11:32:39,747 INFO L158 Benchmark]: Toolchain (without parser) took 2164.05ms. Allocated memory was 94.4MB in the beginning and 144.7MB in the end (delta: 50.3MB). Free memory was 63.5MB in the beginning and 66.6MB in the end (delta: -3.2MB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB. [2022-07-13 11:32:39,748 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 94.4MB. Free memory was 50.7MB in the beginning and 50.7MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 11:32:39,748 INFO L158 Benchmark]: CACSL2BoogieTranslator took 173.33ms. Allocated memory was 94.4MB in the beginning and 119.5MB in the end (delta: 25.2MB). Free memory was 63.2MB in the beginning and 95.4MB in the end (delta: -32.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 11:32:39,748 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.12ms. Allocated memory is still 119.5MB. Free memory was 95.4MB in the beginning and 93.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 11:32:39,749 INFO L158 Benchmark]: Boogie Preprocessor took 12.95ms. Allocated memory is still 119.5MB. Free memory was 93.7MB in the beginning and 92.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 11:32:39,749 INFO L158 Benchmark]: RCFGBuilder took 241.93ms. Allocated memory is still 119.5MB. Free memory was 92.4MB in the beginning and 81.6MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 11:32:39,750 INFO L158 Benchmark]: TraceAbstraction took 1655.23ms. Allocated memory was 119.5MB in the beginning and 144.7MB in the end (delta: 25.2MB). Free memory was 81.2MB in the beginning and 69.8MB in the end (delta: 11.4MB). Peak memory consumption was 39.1MB. Max. memory is 16.1GB. [2022-07-13 11:32:39,750 INFO L158 Benchmark]: Witness Printer took 45.70ms. Allocated memory is still 144.7MB. Free memory was 68.7MB in the beginning and 66.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 11:32:39,753 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 94.4MB. Free memory was 50.7MB in the beginning and 50.7MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 173.33ms. Allocated memory was 94.4MB in the beginning and 119.5MB in the end (delta: 25.2MB). Free memory was 63.2MB in the beginning and 95.4MB in the end (delta: -32.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.12ms. Allocated memory is still 119.5MB. Free memory was 95.4MB in the beginning and 93.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 12.95ms. Allocated memory is still 119.5MB. Free memory was 93.7MB in the beginning and 92.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 241.93ms. Allocated memory is still 119.5MB. Free memory was 92.4MB in the beginning and 81.6MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1655.23ms. Allocated memory was 119.5MB in the beginning and 144.7MB in the end (delta: 25.2MB). Free memory was 81.2MB in the beginning and 69.8MB in the end (delta: 11.4MB). Peak memory consumption was 39.1MB. Max. memory is 16.1GB. * Witness Printer took 45.70ms. Allocated memory is still 144.7MB. Free memory was 68.7MB in the beginning and 66.6MB 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: 121]: 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, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 543 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 543 mSDsluCounter, 1857 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 729 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 101 IncrementalHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 1128 mSDtfsCounter, 101 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2053occurred in iteration=18, InterpolantAutomatonStates: 57, 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, 19 MinimizatonAttempts, 528 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 137 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 326 NumberOfCodeBlocks, 326 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 307 ConstructedInterpolants, 0 QuantifiedInterpolants, 622 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 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: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-07-13 11:32:39,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE