./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/transmitter.01.cil.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/systemc/transmitter.01.cil.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 ea17b00cb6ed3e05e0ac7861fb220a62ceca6ba97bc4fe703ce3eb0d0ec5cbfe --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 18:16:36,785 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 18:16:36,791 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 18:16:36,838 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 18:16:36,839 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 18:16:36,839 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 18:16:36,844 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 18:16:36,847 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 18:16:36,849 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 18:16:36,854 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 18:16:36,855 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 18:16:36,856 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 18:16:36,857 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 18:16:36,858 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 18:16:36,859 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 18:16:36,861 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 18:16:36,863 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 18:16:36,864 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 18:16:36,866 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 18:16:36,872 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 18:16:36,876 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 18:16:36,877 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 18:16:36,878 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 18:16:36,879 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 18:16:36,880 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 18:16:36,883 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 18:16:36,884 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 18:16:36,885 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 18:16:36,886 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 18:16:36,886 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 18:16:36,887 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 18:16:36,888 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 18:16:36,889 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 18:16:36,889 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 18:16:36,890 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 18:16:36,891 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 18:16:36,891 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 18:16:36,892 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 18:16:36,892 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 18:16:36,892 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 18:16:36,893 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 18:16:36,895 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 18:16:36,896 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 18:16:36,927 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 18:16:36,928 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 18:16:36,928 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 18:16:36,928 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 18:16:36,930 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 18:16:36,930 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 18:16:36,930 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 18:16:36,931 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 18:16:36,931 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 18:16:36,932 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 18:16:36,932 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 18:16:36,932 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 18:16:36,932 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 18:16:36,932 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 18:16:36,933 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 18:16:36,933 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 18:16:36,933 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 18:16:36,933 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 18:16:36,935 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 18:16:36,935 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 18:16:36,935 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 18:16:36,935 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 18:16:36,935 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 18:16:36,936 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 18:16:36,936 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 18:16:36,936 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 18:16:36,936 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 18:16:36,937 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 18:16:36,937 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 18:16:36,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 18:16:36,937 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 18:16:36,937 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 18:16:36,938 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 18:16:36,938 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 -> ea17b00cb6ed3e05e0ac7861fb220a62ceca6ba97bc4fe703ce3eb0d0ec5cbfe [2022-07-13 18:16:37,161 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 18:16:37,178 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 18:16:37,181 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 18:16:37,182 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 18:16:37,182 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 18:16:37,183 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.01.cil.c [2022-07-13 18:16:37,251 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8c5e5c90/15b5e98f3e1a489892bc2c138b51daea/FLAGb9e856908 [2022-07-13 18:16:37,665 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 18:16:37,668 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.01.cil.c [2022-07-13 18:16:37,681 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8c5e5c90/15b5e98f3e1a489892bc2c138b51daea/FLAGb9e856908 [2022-07-13 18:16:38,048 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8c5e5c90/15b5e98f3e1a489892bc2c138b51daea [2022-07-13 18:16:38,050 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 18:16:38,052 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 18:16:38,053 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 18:16:38,053 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 18:16:38,057 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 18:16:38,057 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 06:16:38" (1/1) ... [2022-07-13 18:16:38,058 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c9210c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:16:38, skipping insertion in model container [2022-07-13 18:16:38,058 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 06:16:38" (1/1) ... [2022-07-13 18:16:38,064 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 18:16:38,101 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 18:16:38,262 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/systemc/transmitter.01.cil.c[706,719] [2022-07-13 18:16:38,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 18:16:38,340 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 18:16:38,352 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.01.cil.c[706,719] [2022-07-13 18:16:38,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 18:16:38,402 INFO L208 MainTranslator]: Completed translation [2022-07-13 18:16:38,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:16:38 WrapperNode [2022-07-13 18:16:38,403 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 18:16:38,404 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 18:16:38,405 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 18:16:38,405 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 18:16:38,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:16:38" (1/1) ... [2022-07-13 18:16:38,426 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:16:38" (1/1) ... [2022-07-13 18:16:38,455 INFO L137 Inliner]: procedures = 30, calls = 33, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 209 [2022-07-13 18:16:38,456 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 18:16:38,458 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 18:16:38,458 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 18:16:38,458 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 18:16:38,467 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:16:38" (1/1) ... [2022-07-13 18:16:38,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:16:38" (1/1) ... [2022-07-13 18:16:38,475 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:16:38" (1/1) ... [2022-07-13 18:16:38,476 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:16:38" (1/1) ... [2022-07-13 18:16:38,483 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:16:38" (1/1) ... [2022-07-13 18:16:38,489 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:16:38" (1/1) ... [2022-07-13 18:16:38,497 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:16:38" (1/1) ... [2022-07-13 18:16:38,502 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 18:16:38,505 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 18:16:38,505 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 18:16:38,506 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 18:16:38,507 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:16:38" (1/1) ... [2022-07-13 18:16:38,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 18:16:38,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:16:38,537 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 18:16:38,563 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 18:16:38,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 18:16:38,580 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-07-13 18:16:38,580 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-07-13 18:16:38,580 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-07-13 18:16:38,580 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-07-13 18:16:38,581 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-07-13 18:16:38,581 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-07-13 18:16:38,581 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-07-13 18:16:38,581 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-07-13 18:16:38,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 18:16:38,581 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-07-13 18:16:38,582 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-07-13 18:16:38,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 18:16:38,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 18:16:38,659 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 18:16:38,661 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 18:16:38,916 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 18:16:38,922 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 18:16:38,923 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-13 18:16:38,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:16:38 BoogieIcfgContainer [2022-07-13 18:16:38,925 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 18:16:38,926 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 18:16:38,926 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 18:16:38,933 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 18:16:38,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 06:16:38" (1/3) ... [2022-07-13 18:16:38,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31f76555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 06:16:38, skipping insertion in model container [2022-07-13 18:16:38,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:16:38" (2/3) ... [2022-07-13 18:16:38,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31f76555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 06:16:38, skipping insertion in model container [2022-07-13 18:16:38,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:16:38" (3/3) ... [2022-07-13 18:16:38,937 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.01.cil.c [2022-07-13 18:16:38,950 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 18:16:38,951 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 18:16:39,022 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 18:16:39,030 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@77139504, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@79a20f24 [2022-07-13 18:16:39,031 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 18:16:39,036 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 80 states have (on average 1.525) internal successors, (122), 82 states have internal predecessors, (122), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-13 18:16:39,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-13 18:16:39,059 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:39,060 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:16:39,061 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:39,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:39,066 INFO L85 PathProgramCache]: Analyzing trace with hash -20293138, now seen corresponding path program 1 times [2022-07-13 18:16:39,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:39,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140975132] [2022-07-13 18:16:39,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:39,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:39,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:39,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:16:39,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:39,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:16:39,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:39,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:16:39,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:39,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-13 18:16:39,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:39,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 18:16:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:39,432 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 18:16:39,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:39,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140975132] [2022-07-13 18:16:39,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140975132] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:39,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:39,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 18:16:39,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799616309] [2022-07-13 18:16:39,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:39,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 18:16:39,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:39,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 18:16:39,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:16:39,471 INFO L87 Difference]: Start difference. First operand has 100 states, 80 states have (on average 1.525) internal successors, (122), 82 states have internal predecessors, (122), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 18:16:39,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:39,974 INFO L93 Difference]: Finished difference Result 210 states and 318 transitions. [2022-07-13 18:16:39,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 18:16:39,979 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-07-13 18:16:39,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:39,988 INFO L225 Difference]: With dead ends: 210 [2022-07-13 18:16:39,989 INFO L226 Difference]: Without dead ends: 115 [2022-07-13 18:16:39,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-07-13 18:16:39,997 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 197 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:39,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 357 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 18:16:40,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-13 18:16:40,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 95. [2022-07-13 18:16:40,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 76 states have (on average 1.381578947368421) internal successors, (105), 77 states have internal predecessors, (105), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-13 18:16:40,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 131 transitions. [2022-07-13 18:16:40,044 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 131 transitions. Word has length 55 [2022-07-13 18:16:40,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:40,044 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 131 transitions. [2022-07-13 18:16:40,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 18:16:40,045 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 131 transitions. [2022-07-13 18:16:40,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-13 18:16:40,047 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:40,047 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:16:40,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 18:16:40,048 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:40,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:40,049 INFO L85 PathProgramCache]: Analyzing trace with hash -917686416, now seen corresponding path program 1 times [2022-07-13 18:16:40,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:40,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341240975] [2022-07-13 18:16:40,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:40,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:40,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:40,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:16:40,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:40,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:16:40,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:40,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:16:40,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:40,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-13 18:16:40,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:40,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 18:16:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:40,154 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 18:16:40,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:40,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341240975] [2022-07-13 18:16:40,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341240975] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:40,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:40,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 18:16:40,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120454636] [2022-07-13 18:16:40,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:40,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 18:16:40,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:40,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 18:16:40,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:16:40,158 INFO L87 Difference]: Start difference. First operand 95 states and 131 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 18:16:40,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:40,803 INFO L93 Difference]: Finished difference Result 334 states and 477 transitions. [2022-07-13 18:16:40,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 18:16:40,804 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-07-13 18:16:40,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:40,811 INFO L225 Difference]: With dead ends: 334 [2022-07-13 18:16:40,811 INFO L226 Difference]: Without dead ends: 248 [2022-07-13 18:16:40,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-07-13 18:16:40,814 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 336 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:40,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 635 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 18:16:40,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-07-13 18:16:40,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 175. [2022-07-13 18:16:40,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 140 states have (on average 1.3928571428571428) internal successors, (195), 143 states have internal predecessors, (195), 22 states have call successors, (22), 10 states have call predecessors, (22), 12 states have return successors, (29), 23 states have call predecessors, (29), 22 states have call successors, (29) [2022-07-13 18:16:40,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 246 transitions. [2022-07-13 18:16:40,859 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 246 transitions. Word has length 55 [2022-07-13 18:16:40,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:40,860 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 246 transitions. [2022-07-13 18:16:40,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 18:16:40,860 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 246 transitions. [2022-07-13 18:16:40,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-13 18:16:40,864 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:40,865 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:16:40,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 18:16:40,866 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:40,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:40,867 INFO L85 PathProgramCache]: Analyzing trace with hash -669539922, now seen corresponding path program 1 times [2022-07-13 18:16:40,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:40,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765290155] [2022-07-13 18:16:40,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:40,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:40,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:40,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:16:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:40,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:16:40,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:40,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:16:40,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:40,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-13 18:16:40,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:40,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 18:16:40,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:40,966 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 18:16:40,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:40,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765290155] [2022-07-13 18:16:40,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765290155] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:40,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:40,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 18:16:40,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789675691] [2022-07-13 18:16:40,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:40,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 18:16:40,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:40,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 18:16:40,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 18:16:40,969 INFO L87 Difference]: Start difference. First operand 175 states and 246 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 18:16:41,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:41,364 INFO L93 Difference]: Finished difference Result 457 states and 644 transitions. [2022-07-13 18:16:41,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 18:16:41,365 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-07-13 18:16:41,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:41,370 INFO L225 Difference]: With dead ends: 457 [2022-07-13 18:16:41,371 INFO L226 Difference]: Without dead ends: 293 [2022-07-13 18:16:41,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-07-13 18:16:41,376 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 344 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:41,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 517 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 18:16:41,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-07-13 18:16:41,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 244. [2022-07-13 18:16:41,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 195 states have (on average 1.3743589743589744) internal successors, (268), 199 states have internal predecessors, (268), 31 states have call successors, (31), 15 states have call predecessors, (31), 17 states have return successors, (38), 31 states have call predecessors, (38), 31 states have call successors, (38) [2022-07-13 18:16:41,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 337 transitions. [2022-07-13 18:16:41,431 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 337 transitions. Word has length 55 [2022-07-13 18:16:41,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:41,432 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 337 transitions. [2022-07-13 18:16:41,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 18:16:41,432 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 337 transitions. [2022-07-13 18:16:41,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-13 18:16:41,438 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:41,439 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:16:41,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 18:16:41,440 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:41,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:41,440 INFO L85 PathProgramCache]: Analyzing trace with hash 455720047, now seen corresponding path program 1 times [2022-07-13 18:16:41,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:41,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078492137] [2022-07-13 18:16:41,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:41,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:41,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:41,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:16:41,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:41,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:16:41,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:41,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:16:41,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:41,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-13 18:16:41,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:41,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 18:16:41,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:41,569 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 18:16:41,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:41,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078492137] [2022-07-13 18:16:41,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078492137] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:41,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:41,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 18:16:41,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834107385] [2022-07-13 18:16:41,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:41,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 18:16:41,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:41,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 18:16:41,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:16:41,576 INFO L87 Difference]: Start difference. First operand 244 states and 337 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 18:16:41,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:41,948 INFO L93 Difference]: Finished difference Result 519 states and 731 transitions. [2022-07-13 18:16:41,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 18:16:41,949 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-07-13 18:16:41,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:41,951 INFO L225 Difference]: With dead ends: 519 [2022-07-13 18:16:41,951 INFO L226 Difference]: Without dead ends: 286 [2022-07-13 18:16:41,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-07-13 18:16:41,954 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 155 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:41,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 455 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 18:16:41,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-07-13 18:16:41,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 247. [2022-07-13 18:16:41,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 198 states have (on average 1.3585858585858586) internal successors, (269), 202 states have internal predecessors, (269), 31 states have call successors, (31), 15 states have call predecessors, (31), 17 states have return successors, (38), 31 states have call predecessors, (38), 31 states have call successors, (38) [2022-07-13 18:16:41,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 338 transitions. [2022-07-13 18:16:41,986 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 338 transitions. Word has length 55 [2022-07-13 18:16:41,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:41,987 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 338 transitions. [2022-07-13 18:16:41,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 18:16:41,987 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 338 transitions. [2022-07-13 18:16:41,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-13 18:16:41,989 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:41,989 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:16:41,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 18:16:41,989 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:41,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:41,990 INFO L85 PathProgramCache]: Analyzing trace with hash 383333489, now seen corresponding path program 1 times [2022-07-13 18:16:41,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:41,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038134423] [2022-07-13 18:16:41,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:41,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:42,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:42,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:16:42,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:42,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:16:42,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:42,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:16:42,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:42,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-13 18:16:42,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:42,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 18:16:42,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:42,066 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 18:16:42,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:42,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038134423] [2022-07-13 18:16:42,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038134423] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:42,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:42,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 18:16:42,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293893118] [2022-07-13 18:16:42,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:42,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 18:16:42,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:42,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 18:16:42,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:16:42,069 INFO L87 Difference]: Start difference. First operand 247 states and 338 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 18:16:42,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:42,425 INFO L93 Difference]: Finished difference Result 531 states and 743 transitions. [2022-07-13 18:16:42,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 18:16:42,426 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-07-13 18:16:42,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:42,428 INFO L225 Difference]: With dead ends: 531 [2022-07-13 18:16:42,428 INFO L226 Difference]: Without dead ends: 295 [2022-07-13 18:16:42,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-07-13 18:16:42,433 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 119 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:42,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 449 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 18:16:42,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-07-13 18:16:42,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 256. [2022-07-13 18:16:42,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 207 states have (on average 1.3429951690821256) internal successors, (278), 211 states have internal predecessors, (278), 31 states have call successors, (31), 15 states have call predecessors, (31), 17 states have return successors, (38), 31 states have call predecessors, (38), 31 states have call successors, (38) [2022-07-13 18:16:42,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 347 transitions. [2022-07-13 18:16:42,466 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 347 transitions. Word has length 55 [2022-07-13 18:16:42,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:42,467 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 347 transitions. [2022-07-13 18:16:42,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 18:16:42,467 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 347 transitions. [2022-07-13 18:16:42,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-13 18:16:42,470 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:42,470 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:16:42,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 18:16:42,471 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:42,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:42,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1988405773, now seen corresponding path program 1 times [2022-07-13 18:16:42,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:42,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499489951] [2022-07-13 18:16:42,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:42,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:42,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:42,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:16:42,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:42,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:16:42,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:42,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:16:42,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:42,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-13 18:16:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:42,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 18:16:42,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:42,559 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 18:16:42,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:42,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499489951] [2022-07-13 18:16:42,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499489951] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:42,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:42,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 18:16:42,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990455332] [2022-07-13 18:16:42,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:42,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 18:16:42,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:42,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 18:16:42,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:16:42,562 INFO L87 Difference]: Start difference. First operand 256 states and 347 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 18:16:42,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:42,955 INFO L93 Difference]: Finished difference Result 654 states and 887 transitions. [2022-07-13 18:16:42,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 18:16:42,956 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-07-13 18:16:42,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:42,959 INFO L225 Difference]: With dead ends: 654 [2022-07-13 18:16:42,959 INFO L226 Difference]: Without dead ends: 476 [2022-07-13 18:16:42,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-07-13 18:16:42,961 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 366 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:42,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 402 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 18:16:42,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-07-13 18:16:42,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 411. [2022-07-13 18:16:42,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 337 states have (on average 1.3293768545994065) internal successors, (448), 343 states have internal predecessors, (448), 45 states have call successors, (45), 25 states have call predecessors, (45), 28 states have return successors, (50), 44 states have call predecessors, (50), 45 states have call successors, (50) [2022-07-13 18:16:42,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 543 transitions. [2022-07-13 18:16:42,988 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 543 transitions. Word has length 55 [2022-07-13 18:16:42,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:42,988 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 543 transitions. [2022-07-13 18:16:42,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 18:16:42,989 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 543 transitions. [2022-07-13 18:16:42,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-13 18:16:42,989 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:42,990 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:16:42,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 18:16:42,990 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:42,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:42,991 INFO L85 PathProgramCache]: Analyzing trace with hash 501123189, now seen corresponding path program 1 times [2022-07-13 18:16:42,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:42,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965306504] [2022-07-13 18:16:42,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:42,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:43,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:43,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:16:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:43,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:16:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:43,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:16:43,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:43,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-13 18:16:43,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:43,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 18:16:43,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:43,055 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 18:16:43,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:43,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965306504] [2022-07-13 18:16:43,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965306504] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:43,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:43,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 18:16:43,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333535557] [2022-07-13 18:16:43,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:43,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 18:16:43,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:43,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 18:16:43,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:16:43,058 INFO L87 Difference]: Start difference. First operand 411 states and 543 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 18:16:43,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:43,290 INFO L93 Difference]: Finished difference Result 848 states and 1126 transitions. [2022-07-13 18:16:43,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 18:16:43,290 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-07-13 18:16:43,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:43,294 INFO L225 Difference]: With dead ends: 848 [2022-07-13 18:16:43,294 INFO L226 Difference]: Without dead ends: 448 [2022-07-13 18:16:43,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-13 18:16:43,299 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 220 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:43,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 319 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 18:16:43,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2022-07-13 18:16:43,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 410. [2022-07-13 18:16:43,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 336 states have (on average 1.2946428571428572) internal successors, (435), 342 states have internal predecessors, (435), 45 states have call successors, (45), 25 states have call predecessors, (45), 28 states have return successors, (50), 44 states have call predecessors, (50), 45 states have call successors, (50) [2022-07-13 18:16:43,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 530 transitions. [2022-07-13 18:16:43,339 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 530 transitions. Word has length 55 [2022-07-13 18:16:43,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:43,339 INFO L495 AbstractCegarLoop]: Abstraction has 410 states and 530 transitions. [2022-07-13 18:16:43,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 18:16:43,340 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 530 transitions. [2022-07-13 18:16:43,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-13 18:16:43,340 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:43,341 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:16:43,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 18:16:43,341 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:43,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:43,342 INFO L85 PathProgramCache]: Analyzing trace with hash 719977907, now seen corresponding path program 1 times [2022-07-13 18:16:43,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:43,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180055959] [2022-07-13 18:16:43,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:43,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:43,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:16:43,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:43,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:16:43,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:43,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:16:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:43,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-13 18:16:43,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:43,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 18:16:43,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:43,419 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 18:16:43,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:43,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180055959] [2022-07-13 18:16:43,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180055959] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:43,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:43,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 18:16:43,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342480974] [2022-07-13 18:16:43,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:43,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 18:16:43,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:43,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 18:16:43,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 18:16:43,422 INFO L87 Difference]: Start difference. First operand 410 states and 530 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 18:16:43,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:43,684 INFO L93 Difference]: Finished difference Result 1248 states and 1632 transitions. [2022-07-13 18:16:43,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 18:16:43,685 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-07-13 18:16:43,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:43,689 INFO L225 Difference]: With dead ends: 1248 [2022-07-13 18:16:43,689 INFO L226 Difference]: Without dead ends: 849 [2022-07-13 18:16:43,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-07-13 18:16:43,691 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 324 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:43,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 291 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 18:16:43,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2022-07-13 18:16:43,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 787. [2022-07-13 18:16:43,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 644 states have (on average 1.2763975155279503) internal successors, (822), 655 states have internal predecessors, (822), 85 states have call successors, (85), 50 states have call predecessors, (85), 57 states have return successors, (113), 85 states have call predecessors, (113), 85 states have call successors, (113) [2022-07-13 18:16:43,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1020 transitions. [2022-07-13 18:16:43,746 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1020 transitions. Word has length 55 [2022-07-13 18:16:43,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:43,747 INFO L495 AbstractCegarLoop]: Abstraction has 787 states and 1020 transitions. [2022-07-13 18:16:43,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 18:16:43,747 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1020 transitions. [2022-07-13 18:16:43,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-13 18:16:43,748 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:43,748 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:16:43,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 18:16:43,749 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:43,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:43,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1595512707, now seen corresponding path program 1 times [2022-07-13 18:16:43,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:43,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443177396] [2022-07-13 18:16:43,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:43,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:43,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:43,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:16:43,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:43,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:16:43,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:43,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:16:43,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:43,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-13 18:16:43,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:43,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 18:16:43,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:43,794 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 18:16:43,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:43,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443177396] [2022-07-13 18:16:43,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443177396] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:43,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:43,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 18:16:43,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574501301] [2022-07-13 18:16:43,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:43,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 18:16:43,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:43,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 18:16:43,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 18:16:43,797 INFO L87 Difference]: Start difference. First operand 787 states and 1020 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-13 18:16:44,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:44,053 INFO L93 Difference]: Finished difference Result 2374 states and 3066 transitions. [2022-07-13 18:16:44,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 18:16:44,054 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 56 [2022-07-13 18:16:44,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:44,061 INFO L225 Difference]: With dead ends: 2374 [2022-07-13 18:16:44,061 INFO L226 Difference]: Without dead ends: 1601 [2022-07-13 18:16:44,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-13 18:16:44,065 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 264 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:44,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 276 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 18:16:44,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2022-07-13 18:16:44,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1471. [2022-07-13 18:16:44,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1471 states, 1193 states have (on average 1.2514668901927912) internal successors, (1493), 1213 states have internal predecessors, (1493), 163 states have call successors, (163), 100 states have call predecessors, (163), 114 states have return successors, (217), 161 states have call predecessors, (217), 163 states have call successors, (217) [2022-07-13 18:16:44,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 1873 transitions. [2022-07-13 18:16:44,171 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 1873 transitions. Word has length 56 [2022-07-13 18:16:44,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:44,172 INFO L495 AbstractCegarLoop]: Abstraction has 1471 states and 1873 transitions. [2022-07-13 18:16:44,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-13 18:16:44,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 1873 transitions. [2022-07-13 18:16:44,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-13 18:16:44,174 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:44,174 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:16:44,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 18:16:44,174 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:44,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:44,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1907953452, now seen corresponding path program 1 times [2022-07-13 18:16:44,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:44,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805791155] [2022-07-13 18:16:44,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:44,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:44,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:44,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:16:44,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:44,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:16:44,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:44,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:16:44,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:44,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-13 18:16:44,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:44,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 18:16:44,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:44,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 18:16:44,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:44,229 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 18:16:44,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:44,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805791155] [2022-07-13 18:16:44,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805791155] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:44,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:44,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 18:16:44,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374205000] [2022-07-13 18:16:44,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:44,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 18:16:44,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:44,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 18:16:44,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 18:16:44,232 INFO L87 Difference]: Start difference. First operand 1471 states and 1873 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 18:16:44,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:44,820 INFO L93 Difference]: Finished difference Result 4511 states and 5775 transitions. [2022-07-13 18:16:44,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 18:16:44,821 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 73 [2022-07-13 18:16:44,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:44,832 INFO L225 Difference]: With dead ends: 4511 [2022-07-13 18:16:44,833 INFO L226 Difference]: Without dead ends: 2340 [2022-07-13 18:16:44,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2022-07-13 18:16:44,840 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 500 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:44,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 529 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 18:16:44,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2340 states. [2022-07-13 18:16:44,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2340 to 2209. [2022-07-13 18:16:44,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2209 states, 1786 states have (on average 1.232922732362822) internal successors, (2202), 1825 states have internal predecessors, (2202), 241 states have call successors, (241), 150 states have call predecessors, (241), 181 states have return successors, (375), 237 states have call predecessors, (375), 241 states have call successors, (375) [2022-07-13 18:16:45,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2209 states to 2209 states and 2818 transitions. [2022-07-13 18:16:45,006 INFO L78 Accepts]: Start accepts. Automaton has 2209 states and 2818 transitions. Word has length 73 [2022-07-13 18:16:45,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:45,006 INFO L495 AbstractCegarLoop]: Abstraction has 2209 states and 2818 transitions. [2022-07-13 18:16:45,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 18:16:45,007 INFO L276 IsEmpty]: Start isEmpty. Operand 2209 states and 2818 transitions. [2022-07-13 18:16:45,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-13 18:16:45,010 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:45,010 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:16:45,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 18:16:45,010 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:45,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:45,011 INFO L85 PathProgramCache]: Analyzing trace with hash 175805213, now seen corresponding path program 1 times [2022-07-13 18:16:45,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:45,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418681436] [2022-07-13 18:16:45,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:45,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:45,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 18:16:45,032 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 18:16:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 18:16:45,077 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 18:16:45,077 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 18:16:45,078 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 18:16:45,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 18:16:45,083 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:16:45,086 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 18:16:45,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 06:16:45 BoogieIcfgContainer [2022-07-13 18:16:45,173 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 18:16:45,173 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 18:16:45,174 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 18:16:45,174 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 18:16:45,174 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:16:38" (3/4) ... [2022-07-13 18:16:45,176 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-13 18:16:45,244 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 18:16:45,245 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 18:16:45,245 INFO L158 Benchmark]: Toolchain (without parser) took 7193.24ms. Allocated memory was 90.2MB in the beginning and 161.5MB in the end (delta: 71.3MB). Free memory was 56.5MB in the beginning and 53.9MB in the end (delta: 2.6MB). Peak memory consumption was 73.8MB. Max. memory is 16.1GB. [2022-07-13 18:16:45,246 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 90.2MB. Free memory was 59.8MB in the beginning and 59.8MB in the end (delta: 26.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 18:16:45,246 INFO L158 Benchmark]: CACSL2BoogieTranslator took 350.54ms. Allocated memory was 90.2MB in the beginning and 111.1MB in the end (delta: 21.0MB). Free memory was 56.2MB in the beginning and 85.9MB in the end (delta: -29.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 18:16:45,246 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.06ms. Allocated memory is still 111.1MB. Free memory was 85.9MB in the beginning and 84.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 18:16:45,247 INFO L158 Benchmark]: Boogie Preprocessor took 46.28ms. Allocated memory is still 111.1MB. Free memory was 84.0MB in the beginning and 82.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 18:16:45,247 INFO L158 Benchmark]: RCFGBuilder took 420.16ms. Allocated memory is still 111.1MB. Free memory was 82.4MB in the beginning and 67.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-13 18:16:45,247 INFO L158 Benchmark]: TraceAbstraction took 6246.76ms. Allocated memory was 111.1MB in the beginning and 161.5MB in the end (delta: 50.3MB). Free memory was 67.2MB in the beginning and 60.2MB in the end (delta: 6.9MB). Peak memory consumption was 60.0MB. Max. memory is 16.1GB. [2022-07-13 18:16:45,247 INFO L158 Benchmark]: Witness Printer took 71.39ms. Allocated memory is still 161.5MB. Free memory was 60.2MB in the beginning and 53.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-13 18:16:45,249 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.19ms. Allocated memory is still 90.2MB. Free memory was 59.8MB in the beginning and 59.8MB in the end (delta: 26.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 350.54ms. Allocated memory was 90.2MB in the beginning and 111.1MB in the end (delta: 21.0MB). Free memory was 56.2MB in the beginning and 85.9MB in the end (delta: -29.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.06ms. Allocated memory is still 111.1MB. Free memory was 85.9MB in the beginning and 84.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.28ms. Allocated memory is still 111.1MB. Free memory was 84.0MB in the beginning and 82.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 420.16ms. Allocated memory is still 111.1MB. Free memory was 82.4MB in the beginning and 67.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6246.76ms. Allocated memory was 111.1MB in the beginning and 161.5MB in the end (delta: 50.3MB). Free memory was 67.2MB in the beginning and 60.2MB in the end (delta: 6.9MB). Peak memory consumption was 60.0MB. Max. memory is 16.1GB. * Witness Printer took 71.39ms. Allocated memory is still 161.5MB. Free memory was 60.2MB in the beginning and 53.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int m_pc = 0; [L26] int t1_pc = 0; [L27] int m_st ; [L28] int t1_st ; [L29] int m_i ; [L30] int t1_i ; [L31] int M_E = 2; [L32] int T1_E = 2; [L33] int E_1 = 2; VAL [E_1=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0] [L449] int __retres1 ; [L453] CALL init_model() [L364] m_i = 1 [L365] t1_i = 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L453] RET init_model() [L454] CALL start_simulation() [L390] int kernel_st ; [L391] int tmp ; [L392] int tmp___0 ; [L396] kernel_st = 0 VAL [E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L397] FCALL update_channels() VAL [E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L398] CALL init_threads() [L161] COND TRUE m_i == 1 [L162] m_st = 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L166] COND TRUE t1_i == 1 [L167] t1_st = 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L398] RET init_threads() [L399] CALL fire_delta_events() VAL [\old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L250] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L255] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L260] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L399] RET fire_delta_events() VAL [E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L400] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L293] int tmp ; [L294] int tmp___0 ; [L298] CALL, EXPR is_master_triggered() [L112] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L115] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L125] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L127] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L298] RET, EXPR is_master_triggered() [L298] tmp = is_master_triggered() [L300] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0] [L306] CALL, EXPR is_transmit1_triggered() [L131] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L134] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L144] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L146] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L306] RET, EXPR is_transmit1_triggered() [L306] tmp___0 = is_transmit1_triggered() [L308] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0] [L400] RET activate_threads() VAL [E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L401] CALL reset_delta_events() VAL [\old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L273] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L278] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L283] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L401] RET reset_delta_events() VAL [E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L404] COND TRUE 1 VAL [E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L407] kernel_st = 1 [L408] CALL eval() [L197] int tmp ; VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L201] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L204] CALL, EXPR exists_runnable_thread() VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L176] int __retres1 ; VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L179] COND TRUE m_st == 0 [L180] __retres1 = 1 VAL [__retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L192] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L204] RET, EXPR exists_runnable_thread() VAL [E_1=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L204] tmp = exists_runnable_thread() [L206] COND TRUE \read(tmp) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1] [L211] COND TRUE m_st == 0 [L212] int tmp_ndt_1; [L213] tmp_ndt_1 = __VERIFIER_nondet_int() [L214] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0] [L225] COND TRUE t1_st == 0 [L226] int tmp_ndt_2; [L227] tmp_ndt_2 = __VERIFIER_nondet_int() [L228] COND TRUE \read(tmp_ndt_2) [L230] t1_st = 1 [L231] CALL transmit1() [L82] COND TRUE t1_pc == 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L93] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L95] t1_pc = 1 [L96] t1_st = 2 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L231] RET transmit1() [L201] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L204] CALL, EXPR exists_runnable_thread() VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L176] int __retres1 ; VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L179] COND TRUE m_st == 0 [L180] __retres1 = 1 VAL [__retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L192] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L204] RET, EXPR exists_runnable_thread() VAL [E_1=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L204] tmp = exists_runnable_thread() [L206] COND TRUE \read(tmp) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L211] COND TRUE m_st == 0 [L212] int tmp_ndt_1; [L213] tmp_ndt_1 = __VERIFIER_nondet_int() [L214] COND TRUE \read(tmp_ndt_1) [L216] m_st = 1 [L217] CALL master() [L41] COND TRUE m_pc == 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L52] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L55] E_1 = 1 [L56] CALL immediate_notify() [L322] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L293] int tmp ; [L294] int tmp___0 ; [L298] CALL, EXPR is_master_triggered() [L112] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L115] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L125] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=0, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L127] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=0, __retres1=0, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L298] RET, EXPR is_master_triggered() [L298] tmp = is_master_triggered() [L300] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0] [L306] CALL, EXPR is_transmit1_triggered() [L131] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L134] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L135] COND TRUE E_1 == 1 [L136] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=1, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L146] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=1, __retres1=1, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L306] RET, EXPR is_transmit1_triggered() [L306] tmp___0 = is_transmit1_triggered() [L308] COND TRUE \read(tmp___0) [L309] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1] [L322] RET activate_threads() VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L56] RET immediate_notify() [L57] E_1 = 2 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L60] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L62] m_pc = 1 [L63] m_st = 2 VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L217] RET master() [L225] COND TRUE t1_st == 0 [L226] int tmp_ndt_2; [L227] tmp_ndt_2 = __VERIFIER_nondet_int() [L228] COND TRUE \read(tmp_ndt_2) [L230] t1_st = 1 [L231] CALL transmit1() [L82] COND FALSE !(t1_pc == 0) VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L85] COND TRUE t1_pc == 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L101] CALL error() [L21] reach_error() VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2914 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2825 mSDsluCounter, 4230 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2766 mSDsCounter, 631 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3115 IncrementalHoareTripleChecker+Invalid, 3746 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 631 mSolverCounterUnsat, 1464 mSDtfsCounter, 3115 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 250 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2209occurred in iteration=10, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 10 MinimizatonAttempts, 646 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 664 NumberOfCodeBlocks, 664 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 559 ConstructedInterpolants, 0 QuantifiedInterpolants, 1169 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 14/14 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 RESULT: Ultimate proved your program to be incorrect! [2022-07-13 18:16:45,289 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE