./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/kundu1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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/kundu1.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 c114a15ea6b1c9b012290758a6a9559b9c02a944706c9768958a3bd9c86822a7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 05:11:11,135 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 05:11:11,137 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 05:11:11,175 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 05:11:11,175 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 05:11:11,176 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 05:11:11,177 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 05:11:11,178 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 05:11:11,180 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 05:11:11,180 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 05:11:11,181 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 05:11:11,182 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 05:11:11,182 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 05:11:11,183 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 05:11:11,184 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 05:11:11,185 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 05:11:11,185 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 05:11:11,186 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 05:11:11,187 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 05:11:11,190 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 05:11:11,193 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 05:11:11,193 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 05:11:11,195 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 05:11:11,196 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 05:11:11,197 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 05:11:11,200 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 05:11:11,205 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 05:11:11,205 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 05:11:11,206 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 05:11:11,206 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 05:11:11,207 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 05:11:11,208 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 05:11:11,209 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 05:11:11,209 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 05:11:11,210 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 05:11:11,212 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 05:11:11,212 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 05:11:11,213 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 05:11:11,214 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 05:11:11,215 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 05:11:11,215 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 05:11:11,219 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 05:11:11,223 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 05:11:11,258 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 05:11:11,259 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 05:11:11,259 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 05:11:11,259 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 05:11:11,260 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 05:11:11,260 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 05:11:11,261 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 05:11:11,261 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 05:11:11,261 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 05:11:11,262 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 05:11:11,262 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 05:11:11,262 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 05:11:11,263 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 05:11:11,263 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 05:11:11,263 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 05:11:11,263 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 05:11:11,263 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 05:11:11,264 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 05:11:11,264 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 05:11:11,264 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 05:11:11,264 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 05:11:11,265 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 05:11:11,265 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 05:11:11,265 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 05:11:11,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 05:11:11,265 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 05:11:11,266 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 05:11:11,266 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 05:11:11,266 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 05:11:11,266 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 05:11:11,266 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 05:11:11,267 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 05:11:11,267 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 05:11:11,267 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 -> c114a15ea6b1c9b012290758a6a9559b9c02a944706c9768958a3bd9c86822a7 [2022-07-21 05:11:11,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 05:11:11,593 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 05:11:11,595 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 05:11:11,596 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 05:11:11,597 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 05:11:11,598 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/kundu1.cil.c [2022-07-21 05:11:11,653 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af9976d3e/4dceb921684c485386d68c88db2b95d1/FLAGd7c01136b [2022-07-21 05:11:12,047 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 05:11:12,050 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/kundu1.cil.c [2022-07-21 05:11:12,061 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af9976d3e/4dceb921684c485386d68c88db2b95d1/FLAGd7c01136b [2022-07-21 05:11:12,078 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af9976d3e/4dceb921684c485386d68c88db2b95d1 [2022-07-21 05:11:12,081 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 05:11:12,082 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 05:11:12,083 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 05:11:12,083 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 05:11:12,086 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 05:11:12,086 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:11:12" (1/1) ... [2022-07-21 05:11:12,087 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10aaf9cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:11:12, skipping insertion in model container [2022-07-21 05:11:12,087 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:11:12" (1/1) ... [2022-07-21 05:11:12,094 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 05:11:12,130 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 05:11:12,277 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/kundu1.cil.c[636,649] [2022-07-21 05:11:12,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 05:11:12,391 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 05:11:12,403 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/kundu1.cil.c[636,649] [2022-07-21 05:11:12,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 05:11:12,457 INFO L208 MainTranslator]: Completed translation [2022-07-21 05:11:12,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:11:12 WrapperNode [2022-07-21 05:11:12,458 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 05:11:12,459 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 05:11:12,459 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 05:11:12,459 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 05:11:12,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:11:12" (1/1) ... [2022-07-21 05:11:12,482 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:11:12" (1/1) ... [2022-07-21 05:11:12,517 INFO L137 Inliner]: procedures = 32, calls = 36, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 257 [2022-07-21 05:11:12,517 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 05:11:12,518 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 05:11:12,519 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 05:11:12,519 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 05:11:12,525 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:11:12" (1/1) ... [2022-07-21 05:11:12,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:11:12" (1/1) ... [2022-07-21 05:11:12,537 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:11:12" (1/1) ... [2022-07-21 05:11:12,538 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:11:12" (1/1) ... [2022-07-21 05:11:12,545 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:11:12" (1/1) ... [2022-07-21 05:11:12,557 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:11:12" (1/1) ... [2022-07-21 05:11:12,560 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:11:12" (1/1) ... [2022-07-21 05:11:12,563 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 05:11:12,564 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 05:11:12,568 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 05:11:12,569 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 05:11:12,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:11:12" (1/1) ... [2022-07-21 05:11:12,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 05:11:12,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:11:12,597 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-21 05:11:12,603 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-21 05:11:12,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 05:11:12,633 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-07-21 05:11:12,633 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-07-21 05:11:12,633 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-07-21 05:11:12,633 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-07-21 05:11:12,633 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-07-21 05:11:12,634 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-07-21 05:11:12,634 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-07-21 05:11:12,634 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-07-21 05:11:12,634 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-07-21 05:11:12,634 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-07-21 05:11:12,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 05:11:12,635 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-07-21 05:11:12,635 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-07-21 05:11:12,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 05:11:12,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 05:11:12,733 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 05:11:12,734 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 05:11:13,037 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 05:11:13,045 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 05:11:13,045 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-21 05:11:13,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:11:13 BoogieIcfgContainer [2022-07-21 05:11:13,047 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 05:11:13,048 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 05:11:13,049 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 05:11:13,051 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 05:11:13,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 05:11:12" (1/3) ... [2022-07-21 05:11:13,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38b47f7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:11:13, skipping insertion in model container [2022-07-21 05:11:13,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:11:12" (2/3) ... [2022-07-21 05:11:13,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38b47f7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:11:13, skipping insertion in model container [2022-07-21 05:11:13,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:11:13" (3/3) ... [2022-07-21 05:11:13,053 INFO L111 eAbstractionObserver]: Analyzing ICFG kundu1.cil.c [2022-07-21 05:11:13,064 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 05:11:13,065 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 05:11:13,107 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 05:11:13,114 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@393528eb, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@fd7610d [2022-07-21 05:11:13,114 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 05:11:13,118 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 85 states have (on average 1.4941176470588236) internal successors, (127), 89 states have internal predecessors, (127), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-21 05:11:13,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-21 05:11:13,130 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:11:13,131 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] [2022-07-21 05:11:13,132 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:11:13,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:11:13,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1847694624, now seen corresponding path program 1 times [2022-07-21 05:11:13,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:11:13,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468516159] [2022-07-21 05:11:13,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:11:13,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:11:13,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:13,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:11:13,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:13,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:11:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:13,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 05:11:13,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:13,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 05:11:13,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:13,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 05:11:13,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:13,452 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-21 05:11:13,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:11:13,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468516159] [2022-07-21 05:11:13,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468516159] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:11:13,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:11:13,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 05:11:13,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728242403] [2022-07-21 05:11:13,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:11:13,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 05:11:13,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:11:13,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 05:11:13,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 05:11:13,491 INFO L87 Difference]: Start difference. First operand has 108 states, 85 states have (on average 1.4941176470588236) internal successors, (127), 89 states have internal predecessors, (127), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 05:11:13,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:11:13,796 INFO L93 Difference]: Finished difference Result 317 states and 469 transitions. [2022-07-21 05:11:13,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 05:11:13,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2022-07-21 05:11:13,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:11:13,813 INFO L225 Difference]: With dead ends: 317 [2022-07-21 05:11:13,814 INFO L226 Difference]: Without dead ends: 211 [2022-07-21 05:11:13,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-21 05:11:13,820 INFO L413 NwaCegarLoop]: 286 mSDtfsCounter, 295 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 05:11:13,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 656 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 05:11:13,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-07-21 05:11:13,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 180. [2022-07-21 05:11:13,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 146 states have (on average 1.404109589041096) internal successors, (205), 149 states have internal predecessors, (205), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-07-21 05:11:13,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 248 transitions. [2022-07-21 05:11:13,886 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 248 transitions. Word has length 51 [2022-07-21 05:11:13,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:11:13,887 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 248 transitions. [2022-07-21 05:11:13,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 05:11:13,887 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 248 transitions. [2022-07-21 05:11:13,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-21 05:11:13,890 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:11:13,890 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] [2022-07-21 05:11:13,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 05:11:13,890 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:11:13,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:11:13,895 INFO L85 PathProgramCache]: Analyzing trace with hash 682456063, now seen corresponding path program 1 times [2022-07-21 05:11:13,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:11:13,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333881717] [2022-07-21 05:11:13,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:11:13,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:11:13,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:13,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:11:13,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:13,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:11:13,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:13,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 05:11:13,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:14,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 05:11:14,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:14,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 05:11:14,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:14,006 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-21 05:11:14,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:11:14,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333881717] [2022-07-21 05:11:14,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333881717] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:11:14,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:11:14,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 05:11:14,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081616747] [2022-07-21 05:11:14,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:11:14,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 05:11:14,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:11:14,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 05:11:14,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 05:11:14,010 INFO L87 Difference]: Start difference. First operand 180 states and 248 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 05:11:14,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:11:14,230 INFO L93 Difference]: Finished difference Result 381 states and 534 transitions. [2022-07-21 05:11:14,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 05:11:14,231 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2022-07-21 05:11:14,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:11:14,236 INFO L225 Difference]: With dead ends: 381 [2022-07-21 05:11:14,237 INFO L226 Difference]: Without dead ends: 211 [2022-07-21 05:11:14,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-07-21 05:11:14,246 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 117 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 05:11:14,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 637 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 05:11:14,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-07-21 05:11:14,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 183. [2022-07-21 05:11:14,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 149 states have (on average 1.389261744966443) internal successors, (207), 152 states have internal predecessors, (207), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-07-21 05:11:14,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 250 transitions. [2022-07-21 05:11:14,289 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 250 transitions. Word has length 51 [2022-07-21 05:11:14,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:11:14,290 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 250 transitions. [2022-07-21 05:11:14,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 05:11:14,290 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 250 transitions. [2022-07-21 05:11:14,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-21 05:11:14,293 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:11:14,293 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] [2022-07-21 05:11:14,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 05:11:14,294 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:11:14,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:11:14,295 INFO L85 PathProgramCache]: Analyzing trace with hash 957215677, now seen corresponding path program 1 times [2022-07-21 05:11:14,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:11:14,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418201115] [2022-07-21 05:11:14,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:11:14,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:11:14,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:14,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:11:14,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:14,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:11:14,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:14,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 05:11:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:14,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 05:11:14,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:14,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 05:11:14,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:14,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 05:11:14,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:11:14,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418201115] [2022-07-21 05:11:14,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418201115] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:11:14,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:11:14,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 05:11:14,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208030858] [2022-07-21 05:11:14,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:11:14,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 05:11:14,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:11:14,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 05:11:14,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 05:11:14,433 INFO L87 Difference]: Start difference. First operand 183 states and 250 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 05:11:14,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:11:14,842 INFO L93 Difference]: Finished difference Result 719 states and 999 transitions. [2022-07-21 05:11:14,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 05:11:14,843 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2022-07-21 05:11:14,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:11:14,847 INFO L225 Difference]: With dead ends: 719 [2022-07-21 05:11:14,847 INFO L226 Difference]: Without dead ends: 546 [2022-07-21 05:11:14,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-07-21 05:11:14,849 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 566 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 05:11:14,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 702 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 05:11:14,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2022-07-21 05:11:14,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 333. [2022-07-21 05:11:14,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 273 states have (on average 1.36996336996337) internal successors, (374), 276 states have internal predecessors, (374), 39 states have call successors, (39), 21 states have call predecessors, (39), 20 states have return successors, (38), 36 states have call predecessors, (38), 36 states have call successors, (38) [2022-07-21 05:11:14,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 451 transitions. [2022-07-21 05:11:14,892 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 451 transitions. Word has length 51 [2022-07-21 05:11:14,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:11:14,892 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 451 transitions. [2022-07-21 05:11:14,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 05:11:14,893 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 451 transitions. [2022-07-21 05:11:14,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-21 05:11:14,894 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:11:14,895 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] [2022-07-21 05:11:14,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 05:11:14,895 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:11:14,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:11:14,896 INFO L85 PathProgramCache]: Analyzing trace with hash 758872208, now seen corresponding path program 1 times [2022-07-21 05:11:14,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:11:14,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569664260] [2022-07-21 05:11:14,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:11:14,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:11:14,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:14,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:11:14,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:14,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:11:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:14,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 05:11:14,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:14,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 05:11:14,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:14,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 05:11:14,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:14,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 05:11:14,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:11:14,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569664260] [2022-07-21 05:11:14,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569664260] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:11:14,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:11:14,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 05:11:14,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040058024] [2022-07-21 05:11:14,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:11:14,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 05:11:14,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:11:14,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 05:11:14,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 05:11:14,960 INFO L87 Difference]: Start difference. First operand 333 states and 451 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 05:11:15,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:11:15,229 INFO L93 Difference]: Finished difference Result 1182 states and 1638 transitions. [2022-07-21 05:11:15,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 05:11:15,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2022-07-21 05:11:15,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:11:15,235 INFO L225 Difference]: With dead ends: 1182 [2022-07-21 05:11:15,235 INFO L226 Difference]: Without dead ends: 859 [2022-07-21 05:11:15,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-21 05:11:15,237 INFO L413 NwaCegarLoop]: 285 mSDtfsCounter, 294 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 05:11:15,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 732 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 05:11:15,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2022-07-21 05:11:15,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 758. [2022-07-21 05:11:15,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 620 states have (on average 1.320967741935484) internal successors, (819), 623 states have internal predecessors, (819), 87 states have call successors, (87), 51 states have call predecessors, (87), 50 states have return successors, (98), 84 states have call predecessors, (98), 84 states have call successors, (98) [2022-07-21 05:11:15,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1004 transitions. [2022-07-21 05:11:15,302 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1004 transitions. Word has length 52 [2022-07-21 05:11:15,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:11:15,303 INFO L495 AbstractCegarLoop]: Abstraction has 758 states and 1004 transitions. [2022-07-21 05:11:15,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 05:11:15,303 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1004 transitions. [2022-07-21 05:11:15,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-21 05:11:15,304 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:11:15,305 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] [2022-07-21 05:11:15,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 05:11:15,305 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:11:15,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:11:15,306 INFO L85 PathProgramCache]: Analyzing trace with hash 701727983, now seen corresponding path program 1 times [2022-07-21 05:11:15,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:11:15,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843731969] [2022-07-21 05:11:15,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:11:15,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:11:15,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:15,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:11:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:15,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:11:15,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:15,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 05:11:15,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:15,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 05:11:15,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:15,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 05:11:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:15,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 05:11:15,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:11:15,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843731969] [2022-07-21 05:11:15,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843731969] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:11:15,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:11:15,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 05:11:15,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22459028] [2022-07-21 05:11:15,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:11:15,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 05:11:15,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:11:15,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 05:11:15,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 05:11:15,398 INFO L87 Difference]: Start difference. First operand 758 states and 1004 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 05:11:15,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:11:15,620 INFO L93 Difference]: Finished difference Result 1587 states and 2170 transitions. [2022-07-21 05:11:15,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 05:11:15,620 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2022-07-21 05:11:15,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:11:15,625 INFO L225 Difference]: With dead ends: 1587 [2022-07-21 05:11:15,625 INFO L226 Difference]: Without dead ends: 839 [2022-07-21 05:11:15,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-07-21 05:11:15,629 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 58 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 05:11:15,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 578 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 05:11:15,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2022-07-21 05:11:15,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 776. [2022-07-21 05:11:15,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 638 states have (on average 1.3056426332288402) internal successors, (833), 641 states have internal predecessors, (833), 87 states have call successors, (87), 51 states have call predecessors, (87), 50 states have return successors, (98), 84 states have call predecessors, (98), 84 states have call successors, (98) [2022-07-21 05:11:15,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1018 transitions. [2022-07-21 05:11:15,717 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1018 transitions. Word has length 52 [2022-07-21 05:11:15,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:11:15,718 INFO L495 AbstractCegarLoop]: Abstraction has 776 states and 1018 transitions. [2022-07-21 05:11:15,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 05:11:15,718 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1018 transitions. [2022-07-21 05:11:15,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-21 05:11:15,722 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:11:15,722 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] [2022-07-21 05:11:15,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 05:11:15,722 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:11:15,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:11:15,723 INFO L85 PathProgramCache]: Analyzing trace with hash 763767597, now seen corresponding path program 1 times [2022-07-21 05:11:15,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:11:15,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917792246] [2022-07-21 05:11:15,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:11:15,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:11:15,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:15,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:11:15,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:15,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:11:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:15,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 05:11:15,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:15,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 05:11:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:15,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 05:11:15,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:15,808 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-21 05:11:15,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:11:15,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917792246] [2022-07-21 05:11:15,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917792246] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:11:15,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:11:15,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 05:11:15,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578584615] [2022-07-21 05:11:15,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:11:15,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 05:11:15,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:11:15,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 05:11:15,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 05:11:15,812 INFO L87 Difference]: Start difference. First operand 776 states and 1018 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-21 05:11:16,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:11:16,118 INFO L93 Difference]: Finished difference Result 2629 states and 3632 transitions. [2022-07-21 05:11:16,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 05:11:16,119 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 52 [2022-07-21 05:11:16,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:11:16,129 INFO L225 Difference]: With dead ends: 2629 [2022-07-21 05:11:16,130 INFO L226 Difference]: Without dead ends: 1931 [2022-07-21 05:11:16,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-21 05:11:16,136 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 272 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 05:11:16,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 646 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 05:11:16,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2022-07-21 05:11:16,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1302. [2022-07-21 05:11:16,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1302 states, 1073 states have (on average 1.3019571295433365) internal successors, (1397), 1076 states have internal predecessors, (1397), 143 states have call successors, (143), 86 states have call predecessors, (143), 85 states have return successors, (166), 140 states have call predecessors, (166), 140 states have call successors, (166) [2022-07-21 05:11:16,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 1706 transitions. [2022-07-21 05:11:16,256 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 1706 transitions. Word has length 52 [2022-07-21 05:11:16,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:11:16,256 INFO L495 AbstractCegarLoop]: Abstraction has 1302 states and 1706 transitions. [2022-07-21 05:11:16,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-21 05:11:16,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1706 transitions. [2022-07-21 05:11:16,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-21 05:11:16,258 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:11:16,258 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, 1, 1, 1, 1] [2022-07-21 05:11:16,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 05:11:16,258 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:11:16,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:11:16,259 INFO L85 PathProgramCache]: Analyzing trace with hash -938478105, now seen corresponding path program 1 times [2022-07-21 05:11:16,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:11:16,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364363804] [2022-07-21 05:11:16,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:11:16,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:11:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:16,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:11:16,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:16,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:11:16,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:16,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 05:11:16,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:16,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 05:11:16,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:16,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 05:11:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:16,328 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-21 05:11:16,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:11:16,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364363804] [2022-07-21 05:11:16,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364363804] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:11:16,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:11:16,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 05:11:16,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8518485] [2022-07-21 05:11:16,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:11:16,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 05:11:16,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:11:16,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 05:11:16,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 05:11:16,331 INFO L87 Difference]: Start difference. First operand 1302 states and 1706 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-21 05:11:16,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:11:16,628 INFO L93 Difference]: Finished difference Result 2502 states and 3310 transitions. [2022-07-21 05:11:16,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 05:11:16,629 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2022-07-21 05:11:16,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:11:16,636 INFO L225 Difference]: With dead ends: 2502 [2022-07-21 05:11:16,636 INFO L226 Difference]: Without dead ends: 1573 [2022-07-21 05:11:16,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-21 05:11:16,639 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 505 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 05:11:16,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 606 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 05:11:16,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2022-07-21 05:11:16,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1462. [2022-07-21 05:11:16,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1462 states, 1207 states have (on average 1.2999171499585749) internal successors, (1569), 1210 states have internal predecessors, (1569), 159 states have call successors, (159), 96 states have call predecessors, (159), 95 states have return successors, (184), 156 states have call predecessors, (184), 156 states have call successors, (184) [2022-07-21 05:11:16,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 1912 transitions. [2022-07-21 05:11:16,736 INFO L78 Accepts]: Start accepts. Automaton has 1462 states and 1912 transitions. Word has length 60 [2022-07-21 05:11:16,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:11:16,736 INFO L495 AbstractCegarLoop]: Abstraction has 1462 states and 1912 transitions. [2022-07-21 05:11:16,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-21 05:11:16,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 1912 transitions. [2022-07-21 05:11:16,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-21 05:11:16,738 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:11:16,738 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:11:16,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 05:11:16,738 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:11:16,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:11:16,739 INFO L85 PathProgramCache]: Analyzing trace with hash 2020590272, now seen corresponding path program 1 times [2022-07-21 05:11:16,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:11:16,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727472791] [2022-07-21 05:11:16,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:11:16,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:11:16,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:16,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:11:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:16,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:11:16,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:16,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 05:11:16,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:16,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 05:11:16,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:16,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 05:11:16,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:16,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 05:11:16,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:11:16,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727472791] [2022-07-21 05:11:16,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727472791] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:11:16,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:11:16,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 05:11:16,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698169494] [2022-07-21 05:11:16,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:11:16,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 05:11:16,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:11:16,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 05:11:16,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-21 05:11:16,800 INFO L87 Difference]: Start difference. First operand 1462 states and 1912 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-21 05:11:17,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:11:17,342 INFO L93 Difference]: Finished difference Result 4674 states and 6439 transitions. [2022-07-21 05:11:17,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 05:11:17,343 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 63 [2022-07-21 05:11:17,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:11:17,359 INFO L225 Difference]: With dead ends: 4674 [2022-07-21 05:11:17,359 INFO L226 Difference]: Without dead ends: 3290 [2022-07-21 05:11:17,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-07-21 05:11:17,364 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 583 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 05:11:17,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 933 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 05:11:17,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3290 states. [2022-07-21 05:11:17,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3290 to 2074. [2022-07-21 05:11:17,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2074 states, 1715 states have (on average 1.2979591836734694) internal successors, (2226), 1718 states have internal predecessors, (2226), 223 states have call successors, (223), 136 states have call predecessors, (223), 135 states have return successors, (262), 220 states have call predecessors, (262), 220 states have call successors, (262) [2022-07-21 05:11:17,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 2711 transitions. [2022-07-21 05:11:17,537 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 2711 transitions. Word has length 63 [2022-07-21 05:11:17,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:11:17,538 INFO L495 AbstractCegarLoop]: Abstraction has 2074 states and 2711 transitions. [2022-07-21 05:11:17,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-21 05:11:17,538 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 2711 transitions. [2022-07-21 05:11:17,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-21 05:11:17,539 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:11:17,539 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-21 05:11:17,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 05:11:17,539 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:11:17,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:11:17,540 INFO L85 PathProgramCache]: Analyzing trace with hash -285621863, now seen corresponding path program 1 times [2022-07-21 05:11:17,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:11:17,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777754705] [2022-07-21 05:11:17,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:11:17,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:11:17,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:17,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:11:17,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:17,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:11:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:17,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 05:11:17,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:17,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 05:11:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:17,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 05:11:17,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:17,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 05:11:17,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:17,587 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-21 05:11:17,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:11:17,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777754705] [2022-07-21 05:11:17,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777754705] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:11:17,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389006422] [2022-07-21 05:11:17,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:11:17,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:11:17,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:11:17,589 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 05:11:17,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 05:11:17,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:17,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 05:11:17,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:11:17,742 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 05:11:17,743 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 05:11:17,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389006422] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:11:17,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 05:11:17,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-07-21 05:11:17,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969849139] [2022-07-21 05:11:17,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:11:17,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 05:11:17,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:11:17,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 05:11:17,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 05:11:17,745 INFO L87 Difference]: Start difference. First operand 2074 states and 2711 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-21 05:11:18,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:11:18,035 INFO L93 Difference]: Finished difference Result 5786 states and 7696 transitions. [2022-07-21 05:11:18,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 05:11:18,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 68 [2022-07-21 05:11:18,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:11:18,062 INFO L225 Difference]: With dead ends: 5786 [2022-07-21 05:11:18,062 INFO L226 Difference]: Without dead ends: 3723 [2022-07-21 05:11:18,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 05:11:18,071 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 92 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 05:11:18,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 364 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:11:18,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2022-07-21 05:11:18,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 3585. [2022-07-21 05:11:18,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3585 states, 2937 states have (on average 1.275110657133129) internal successors, (3745), 2941 states have internal predecessors, (3745), 402 states have call successors, (402), 246 states have call predecessors, (402), 245 states have return successors, (553), 399 states have call predecessors, (553), 399 states have call successors, (553) [2022-07-21 05:11:18,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3585 states to 3585 states and 4700 transitions. [2022-07-21 05:11:18,402 INFO L78 Accepts]: Start accepts. Automaton has 3585 states and 4700 transitions. Word has length 68 [2022-07-21 05:11:18,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:11:18,403 INFO L495 AbstractCegarLoop]: Abstraction has 3585 states and 4700 transitions. [2022-07-21 05:11:18,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-21 05:11:18,403 INFO L276 IsEmpty]: Start isEmpty. Operand 3585 states and 4700 transitions. [2022-07-21 05:11:18,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-21 05:11:18,404 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:11:18,405 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] [2022-07-21 05:11:18,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-21 05:11:18,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:11:18,623 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:11:18,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:11:18,624 INFO L85 PathProgramCache]: Analyzing trace with hash -914471196, now seen corresponding path program 1 times [2022-07-21 05:11:18,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:11:18,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179811824] [2022-07-21 05:11:18,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:11:18,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:11:18,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:18,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:11:18,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:18,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:11:18,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:18,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 05:11:18,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:18,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 05:11:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:18,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 05:11:18,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:18,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-21 05:11:18,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:18,684 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-21 05:11:18,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:11:18,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179811824] [2022-07-21 05:11:18,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179811824] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:11:18,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:11:18,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 05:11:18,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641162999] [2022-07-21 05:11:18,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:11:18,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 05:11:18,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:11:18,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 05:11:18,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 05:11:18,687 INFO L87 Difference]: Start difference. First operand 3585 states and 4700 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-21 05:11:19,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:11:19,035 INFO L93 Difference]: Finished difference Result 7440 states and 9799 transitions. [2022-07-21 05:11:19,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 05:11:19,035 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 71 [2022-07-21 05:11:19,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:11:19,052 INFO L225 Difference]: With dead ends: 7440 [2022-07-21 05:11:19,053 INFO L226 Difference]: Without dead ends: 3870 [2022-07-21 05:11:19,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-21 05:11:19,062 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 163 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 05:11:19,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 435 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 05:11:19,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3870 states. [2022-07-21 05:11:19,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3870 to 3623. [2022-07-21 05:11:19,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3623 states, 2956 states have (on average 1.257104194857916) internal successors, (3716), 2979 states have internal predecessors, (3716), 402 states have call successors, (402), 246 states have call predecessors, (402), 264 states have return successors, (553), 399 states have call predecessors, (553), 399 states have call successors, (553) [2022-07-21 05:11:19,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3623 states to 3623 states and 4671 transitions. [2022-07-21 05:11:19,327 INFO L78 Accepts]: Start accepts. Automaton has 3623 states and 4671 transitions. Word has length 71 [2022-07-21 05:11:19,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:11:19,327 INFO L495 AbstractCegarLoop]: Abstraction has 3623 states and 4671 transitions. [2022-07-21 05:11:19,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-21 05:11:19,328 INFO L276 IsEmpty]: Start isEmpty. Operand 3623 states and 4671 transitions. [2022-07-21 05:11:19,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-21 05:11:19,329 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:11:19,329 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] [2022-07-21 05:11:19,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 05:11:19,329 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:11:19,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:11:19,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1331867802, now seen corresponding path program 1 times [2022-07-21 05:11:19,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:11:19,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145137507] [2022-07-21 05:11:19,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:11:19,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:11:19,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:19,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:11:19,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:19,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:11:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:19,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 05:11:19,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:19,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 05:11:19,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:19,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 05:11:19,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:19,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-21 05:11:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:19,373 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-21 05:11:19,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:11:19,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145137507] [2022-07-21 05:11:19,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145137507] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:11:19,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:11:19,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 05:11:19,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288994367] [2022-07-21 05:11:19,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:11:19,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 05:11:19,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:11:19,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 05:11:19,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 05:11:19,376 INFO L87 Difference]: Start difference. First operand 3623 states and 4671 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 05:11:19,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:11:19,662 INFO L93 Difference]: Finished difference Result 4090 states and 5308 transitions. [2022-07-21 05:11:19,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 05:11:19,663 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2022-07-21 05:11:19,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:11:19,682 INFO L225 Difference]: With dead ends: 4090 [2022-07-21 05:11:19,682 INFO L226 Difference]: Without dead ends: 3885 [2022-07-21 05:11:19,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 05:11:19,686 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 174 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 05:11:19,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 215 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:11:19,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3885 states. [2022-07-21 05:11:19,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3885 to 3554. [2022-07-21 05:11:19,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3554 states, 2903 states have (on average 1.258008956252153) internal successors, (3652), 2925 states have internal predecessors, (3652), 391 states have call successors, (391), 241 states have call predecessors, (391), 259 states have return successors, (542), 388 states have call predecessors, (542), 388 states have call successors, (542) [2022-07-21 05:11:19,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3554 states to 3554 states and 4585 transitions. [2022-07-21 05:11:20,000 INFO L78 Accepts]: Start accepts. Automaton has 3554 states and 4585 transitions. Word has length 71 [2022-07-21 05:11:20,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:11:20,000 INFO L495 AbstractCegarLoop]: Abstraction has 3554 states and 4585 transitions. [2022-07-21 05:11:20,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 05:11:20,001 INFO L276 IsEmpty]: Start isEmpty. Operand 3554 states and 4585 transitions. [2022-07-21 05:11:20,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-21 05:11:20,002 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:11:20,002 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] [2022-07-21 05:11:20,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 05:11:20,003 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:11:20,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:11:20,003 INFO L85 PathProgramCache]: Analyzing trace with hash -2052507104, now seen corresponding path program 1 times [2022-07-21 05:11:20,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:11:20,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538808671] [2022-07-21 05:11:20,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:11:20,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:11:20,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:20,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:11:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:20,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:11:20,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:20,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 05:11:20,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:20,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 05:11:20,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:20,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 05:11:20,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:20,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 05:11:20,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:20,052 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 05:11:20,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:11:20,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538808671] [2022-07-21 05:11:20,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538808671] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:11:20,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:11:20,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 05:11:20,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130659050] [2022-07-21 05:11:20,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:11:20,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 05:11:20,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:11:20,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 05:11:20,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 05:11:20,055 INFO L87 Difference]: Start difference. First operand 3554 states and 4585 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-21 05:11:20,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:11:20,749 INFO L93 Difference]: Finished difference Result 10646 states and 14120 transitions. [2022-07-21 05:11:20,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 05:11:20,750 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 72 [2022-07-21 05:11:20,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:11:20,786 INFO L225 Difference]: With dead ends: 10646 [2022-07-21 05:11:20,786 INFO L226 Difference]: Without dead ends: 6920 [2022-07-21 05:11:20,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-07-21 05:11:20,800 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 634 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 05:11:20,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 770 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 05:11:20,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6920 states. [2022-07-21 05:11:21,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6920 to 6782. [2022-07-21 05:11:21,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6782 states, 5504 states have (on average 1.2185683139534884) internal successors, (6707), 5566 states have internal predecessors, (6707), 754 states have call successors, (754), 466 states have call predecessors, (754), 523 states have return successors, (1151), 751 states have call predecessors, (1151), 751 states have call successors, (1151) [2022-07-21 05:11:21,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6782 states to 6782 states and 8612 transitions. [2022-07-21 05:11:21,312 INFO L78 Accepts]: Start accepts. Automaton has 6782 states and 8612 transitions. Word has length 72 [2022-07-21 05:11:21,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:11:21,312 INFO L495 AbstractCegarLoop]: Abstraction has 6782 states and 8612 transitions. [2022-07-21 05:11:21,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-21 05:11:21,313 INFO L276 IsEmpty]: Start isEmpty. Operand 6782 states and 8612 transitions. [2022-07-21 05:11:21,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-21 05:11:21,320 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:11:21,320 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2022-07-21 05:11:21,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-21 05:11:21,321 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:11:21,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:11:21,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1221595769, now seen corresponding path program 1 times [2022-07-21 05:11:21,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:11:21,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717689488] [2022-07-21 05:11:21,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:11:21,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:11:21,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:21,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:11:21,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:21,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:11:21,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:21,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 05:11:21,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:21,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 05:11:21,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:21,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 05:11:21,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:21,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 05:11:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:21,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 05:11:21,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:21,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 05:11:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:21,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 05:11:21,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:21,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 05:11:21,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:21,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 05:11:21,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:21,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 05:11:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:21,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 05:11:21,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:21,406 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-07-21 05:11:21,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:11:21,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717689488] [2022-07-21 05:11:21,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717689488] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:11:21,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806281644] [2022-07-21 05:11:21,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:11:21,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:11:21,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:11:21,409 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 05:11:21,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 05:11:21,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:21,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 05:11:21,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:11:21,606 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-21 05:11:21,606 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 05:11:21,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806281644] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:11:21,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 05:11:21,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2022-07-21 05:11:21,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652007680] [2022-07-21 05:11:21,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:11:21,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 05:11:21,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:11:21,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 05:11:21,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-21 05:11:21,609 INFO L87 Difference]: Start difference. First operand 6782 states and 8612 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-21 05:11:21,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:11:21,959 INFO L93 Difference]: Finished difference Result 11268 states and 14376 transitions. [2022-07-21 05:11:21,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 05:11:21,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 127 [2022-07-21 05:11:21,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:11:21,978 INFO L225 Difference]: With dead ends: 11268 [2022-07-21 05:11:21,978 INFO L226 Difference]: Without dead ends: 4297 [2022-07-21 05:11:21,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-21 05:11:21,999 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 76 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 05:11:21,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 135 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:11:22,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4297 states. [2022-07-21 05:11:22,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4297 to 4293. [2022-07-21 05:11:22,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4293 states, 3485 states have (on average 1.20545193687231) internal successors, (4201), 3521 states have internal predecessors, (4201), 478 states have call successors, (478), 296 states have call predecessors, (478), 329 states have return successors, (694), 476 states have call predecessors, (694), 476 states have call successors, (694) [2022-07-21 05:11:22,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4293 states to 4293 states and 5373 transitions. [2022-07-21 05:11:22,330 INFO L78 Accepts]: Start accepts. Automaton has 4293 states and 5373 transitions. Word has length 127 [2022-07-21 05:11:22,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:11:22,331 INFO L495 AbstractCegarLoop]: Abstraction has 4293 states and 5373 transitions. [2022-07-21 05:11:22,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-21 05:11:22,331 INFO L276 IsEmpty]: Start isEmpty. Operand 4293 states and 5373 transitions. [2022-07-21 05:11:22,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-07-21 05:11:22,336 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:11:22,337 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:11:22,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-21 05:11:22,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-21 05:11:22,555 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:11:22,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:11:22,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1343258013, now seen corresponding path program 1 times [2022-07-21 05:11:22,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:11:22,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187370772] [2022-07-21 05:11:22,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:11:22,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:11:22,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:22,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:11:22,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:22,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:11:22,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:22,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 05:11:22,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:22,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 05:11:22,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:22,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 05:11:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:22,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 05:11:22,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:22,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 05:11:22,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:22,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 05:11:22,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:22,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 05:11:22,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:22,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 05:11:22,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:22,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 05:11:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:22,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 05:11:22,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:22,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 05:11:22,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:22,645 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-21 05:11:22,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:11:22,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187370772] [2022-07-21 05:11:22,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187370772] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:11:22,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88798727] [2022-07-21 05:11:22,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:11:22,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:11:22,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:11:22,648 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 05:11:22,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-21 05:11:22,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:22,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 05:11:22,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:11:22,851 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-21 05:11:22,851 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 05:11:22,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88798727] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:11:22,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 05:11:22,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2022-07-21 05:11:22,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035545994] [2022-07-21 05:11:22,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:11:22,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 05:11:22,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:11:22,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 05:11:22,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-21 05:11:22,853 INFO L87 Difference]: Start difference. First operand 4293 states and 5373 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-21 05:11:23,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:11:23,187 INFO L93 Difference]: Finished difference Result 9150 states and 11419 transitions. [2022-07-21 05:11:23,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 05:11:23,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 131 [2022-07-21 05:11:23,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:11:23,210 INFO L225 Difference]: With dead ends: 9150 [2022-07-21 05:11:23,210 INFO L226 Difference]: Without dead ends: 5190 [2022-07-21 05:11:23,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-21 05:11:23,220 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 45 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 05:11:23,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 266 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:11:23,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5190 states. [2022-07-21 05:11:23,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5190 to 5190. [2022-07-21 05:11:23,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5190 states, 4198 states have (on average 1.193425440686041) internal successors, (5010), 4238 states have internal predecessors, (5010), 583 states have call successors, (583), 371 states have call predecessors, (583), 408 states have return successors, (809), 581 states have call predecessors, (809), 581 states have call successors, (809) [2022-07-21 05:11:23,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5190 states to 5190 states and 6402 transitions. [2022-07-21 05:11:23,523 INFO L78 Accepts]: Start accepts. Automaton has 5190 states and 6402 transitions. Word has length 131 [2022-07-21 05:11:23,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:11:23,524 INFO L495 AbstractCegarLoop]: Abstraction has 5190 states and 6402 transitions. [2022-07-21 05:11:23,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-21 05:11:23,524 INFO L276 IsEmpty]: Start isEmpty. Operand 5190 states and 6402 transitions. [2022-07-21 05:11:23,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-07-21 05:11:23,529 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:11:23,529 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:11:23,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-21 05:11:23,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:11:23,744 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:11:23,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:11:23,744 INFO L85 PathProgramCache]: Analyzing trace with hash 844943966, now seen corresponding path program 1 times [2022-07-21 05:11:23,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:11:23,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845333060] [2022-07-21 05:11:23,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:11:23,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:11:23,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:23,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:11:23,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:23,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:11:23,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:23,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 05:11:23,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:23,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 05:11:23,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:23,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 05:11:23,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:23,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 05:11:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:23,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 05:11:23,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:23,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 05:11:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:23,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 05:11:23,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:23,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 05:11:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:23,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 05:11:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:23,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 05:11:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:23,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 05:11:23,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:23,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-21 05:11:23,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:23,832 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-21 05:11:23,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:11:23,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845333060] [2022-07-21 05:11:23,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845333060] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:11:23,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221155192] [2022-07-21 05:11:23,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:11:23,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:11:23,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:11:23,834 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 05:11:23,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-21 05:11:23,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:23,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 05:11:23,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:11:23,957 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-07-21 05:11:23,957 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 05:11:23,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221155192] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:11:23,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 05:11:23,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2022-07-21 05:11:23,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67461645] [2022-07-21 05:11:23,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:11:23,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 05:11:23,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:11:23,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 05:11:23,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-21 05:11:23,959 INFO L87 Difference]: Start difference. First operand 5190 states and 6402 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-21 05:11:24,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:11:24,293 INFO L93 Difference]: Finished difference Result 13673 states and 17010 transitions. [2022-07-21 05:11:24,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 05:11:24,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 154 [2022-07-21 05:11:24,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:11:24,319 INFO L225 Difference]: With dead ends: 13673 [2022-07-21 05:11:24,320 INFO L226 Difference]: Without dead ends: 8722 [2022-07-21 05:11:24,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-21 05:11:24,336 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 95 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 05:11:24,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 356 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:11:24,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8722 states. [2022-07-21 05:11:24,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8722 to 8718. [2022-07-21 05:11:24,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8718 states, 7074 states have (on average 1.1707661860333616) internal successors, (8282), 7130 states have internal predecessors, (8282), 947 states have call successors, (947), 643 states have call predecessors, (947), 696 states have return successors, (1365), 945 states have call predecessors, (1365), 945 states have call successors, (1365) [2022-07-21 05:11:24,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8718 states to 8718 states and 10594 transitions. [2022-07-21 05:11:24,907 INFO L78 Accepts]: Start accepts. Automaton has 8718 states and 10594 transitions. Word has length 154 [2022-07-21 05:11:24,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:11:24,907 INFO L495 AbstractCegarLoop]: Abstraction has 8718 states and 10594 transitions. [2022-07-21 05:11:24,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-21 05:11:24,908 INFO L276 IsEmpty]: Start isEmpty. Operand 8718 states and 10594 transitions. [2022-07-21 05:11:24,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-07-21 05:11:24,915 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:11:24,915 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:11:24,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-21 05:11:25,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-21 05:11:25,135 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:11:25,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:11:25,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1688949468, now seen corresponding path program 1 times [2022-07-21 05:11:25,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:11:25,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930313903] [2022-07-21 05:11:25,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:11:25,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:11:25,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:25,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:11:25,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:25,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:11:25,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:25,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 05:11:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:25,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 05:11:25,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:25,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 05:11:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:25,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 05:11:25,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:25,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 05:11:25,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:25,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 05:11:25,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:25,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 05:11:25,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:25,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 05:11:25,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:25,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 05:11:25,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:25,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 05:11:25,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:25,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 05:11:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:25,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-21 05:11:25,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:25,217 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-21 05:11:25,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:11:25,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930313903] [2022-07-21 05:11:25,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930313903] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:11:25,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144422318] [2022-07-21 05:11:25,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:11:25,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:11:25,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:11:25,220 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 05:11:25,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-21 05:11:25,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:25,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 05:11:25,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:11:25,351 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-21 05:11:25,351 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 05:11:25,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144422318] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:11:25,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 05:11:25,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2022-07-21 05:11:25,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741433689] [2022-07-21 05:11:25,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:11:25,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 05:11:25,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:11:25,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 05:11:25,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-21 05:11:25,353 INFO L87 Difference]: Start difference. First operand 8718 states and 10594 transitions. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-21 05:11:25,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:11:25,649 INFO L93 Difference]: Finished difference Result 14114 states and 17190 transitions. [2022-07-21 05:11:25,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 05:11:25,650 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 154 [2022-07-21 05:11:25,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:11:25,666 INFO L225 Difference]: With dead ends: 14114 [2022-07-21 05:11:25,666 INFO L226 Difference]: Without dead ends: 5407 [2022-07-21 05:11:25,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-21 05:11:25,686 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 46 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 05:11:25,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 617 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:11:25,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5407 states. [2022-07-21 05:11:26,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5407 to 5115. [2022-07-21 05:11:26,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5115 states, 4342 states have (on average 1.1706586826347305) internal successors, (5083), 4354 states have internal predecessors, (5083), 440 states have call successors, (440), 276 states have call predecessors, (440), 332 states have return successors, (645), 484 states have call predecessors, (645), 438 states have call successors, (645) [2022-07-21 05:11:26,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5115 states to 5115 states and 6168 transitions. [2022-07-21 05:11:26,080 INFO L78 Accepts]: Start accepts. Automaton has 5115 states and 6168 transitions. Word has length 154 [2022-07-21 05:11:26,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:11:26,080 INFO L495 AbstractCegarLoop]: Abstraction has 5115 states and 6168 transitions. [2022-07-21 05:11:26,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-21 05:11:26,081 INFO L276 IsEmpty]: Start isEmpty. Operand 5115 states and 6168 transitions. [2022-07-21 05:11:26,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-07-21 05:11:26,086 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:11:26,086 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:11:26,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-21 05:11:26,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-21 05:11:26,310 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:11:26,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:11:26,311 INFO L85 PathProgramCache]: Analyzing trace with hash -493377335, now seen corresponding path program 1 times [2022-07-21 05:11:26,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:11:26,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944283313] [2022-07-21 05:11:26,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:11:26,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:11:26,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:26,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:11:26,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:26,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:11:26,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:26,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 05:11:26,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:26,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 05:11:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:26,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 05:11:26,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:26,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-21 05:11:26,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:26,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 05:11:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:26,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 05:11:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:26,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 05:11:26,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:26,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 05:11:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:26,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 05:11:26,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:26,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 05:11:26,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:26,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-21 05:11:26,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:26,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 05:11:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:26,402 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-07-21 05:11:26,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:11:26,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944283313] [2022-07-21 05:11:26,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944283313] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:11:26,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:11:26,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 05:11:26,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483081056] [2022-07-21 05:11:26,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:11:26,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 05:11:26,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:11:26,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 05:11:26,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 05:11:26,404 INFO L87 Difference]: Start difference. First operand 5115 states and 6168 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-21 05:11:26,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:11:26,755 INFO L93 Difference]: Finished difference Result 5302 states and 6385 transitions. [2022-07-21 05:11:26,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 05:11:26,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 158 [2022-07-21 05:11:26,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:11:26,769 INFO L225 Difference]: With dead ends: 5302 [2022-07-21 05:11:26,770 INFO L226 Difference]: Without dead ends: 5025 [2022-07-21 05:11:26,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 05:11:26,773 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 94 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 05:11:26,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 299 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 05:11:26,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5025 states. [2022-07-21 05:11:27,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5025 to 4841. [2022-07-21 05:11:27,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4841 states, 4110 states have (on average 1.1734793187347932) internal successors, (4823), 4121 states have internal predecessors, (4823), 417 states have call successors, (417), 260 states have call predecessors, (417), 313 states have return successors, (619), 459 states have call predecessors, (619), 415 states have call successors, (619) [2022-07-21 05:11:27,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4841 states to 4841 states and 5859 transitions. [2022-07-21 05:11:27,124 INFO L78 Accepts]: Start accepts. Automaton has 4841 states and 5859 transitions. Word has length 158 [2022-07-21 05:11:27,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:11:27,124 INFO L495 AbstractCegarLoop]: Abstraction has 4841 states and 5859 transitions. [2022-07-21 05:11:27,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-21 05:11:27,125 INFO L276 IsEmpty]: Start isEmpty. Operand 4841 states and 5859 transitions. [2022-07-21 05:11:27,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-07-21 05:11:27,128 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:11:27,129 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 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-21 05:11:27,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-21 05:11:27,129 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:11:27,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:11:27,130 INFO L85 PathProgramCache]: Analyzing trace with hash -850407883, now seen corresponding path program 1 times [2022-07-21 05:11:27,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:11:27,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819261584] [2022-07-21 05:11:27,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:11:27,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:11:27,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:27,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:11:27,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:27,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:11:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:27,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 05:11:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:27,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 05:11:27,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:27,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 05:11:27,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:27,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 05:11:27,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:27,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 05:11:27,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:27,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 05:11:27,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:27,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 05:11:27,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:27,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-21 05:11:27,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:27,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 05:11:27,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:27,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 05:11:27,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:27,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-21 05:11:27,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:27,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-21 05:11:27,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:27,220 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 16 proven. 28 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-21 05:11:27,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:11:27,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819261584] [2022-07-21 05:11:27,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819261584] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:11:27,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493199630] [2022-07-21 05:11:27,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:11:27,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:11:27,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:11:27,222 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 05:11:27,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-21 05:11:27,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:27,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 05:11:27,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:11:27,439 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-07-21 05:11:27,439 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 05:11:27,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493199630] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:11:27,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 05:11:27,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2022-07-21 05:11:27,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295705893] [2022-07-21 05:11:27,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:11:27,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 05:11:27,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:11:27,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 05:11:27,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-21 05:11:27,442 INFO L87 Difference]: Start difference. First operand 4841 states and 5859 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-21 05:11:27,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:11:27,695 INFO L93 Difference]: Finished difference Result 9087 states and 11040 transitions. [2022-07-21 05:11:27,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 05:11:27,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 164 [2022-07-21 05:11:27,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:11:27,709 INFO L225 Difference]: With dead ends: 9087 [2022-07-21 05:11:27,709 INFO L226 Difference]: Without dead ends: 4503 [2022-07-21 05:11:27,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-21 05:11:27,718 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 25 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 05:11:27,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 259 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:11:27,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4503 states. [2022-07-21 05:11:27,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4503 to 4503. [2022-07-21 05:11:27,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4503 states, 3841 states have (on average 1.1759958344181203) internal successors, (4517), 3852 states have internal predecessors, (4517), 377 states have call successors, (377), 234 states have call predecessors, (377), 284 states have return successors, (568), 416 states have call predecessors, (568), 375 states have call successors, (568) [2022-07-21 05:11:28,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4503 states to 4503 states and 5462 transitions. [2022-07-21 05:11:28,006 INFO L78 Accepts]: Start accepts. Automaton has 4503 states and 5462 transitions. Word has length 164 [2022-07-21 05:11:28,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:11:28,007 INFO L495 AbstractCegarLoop]: Abstraction has 4503 states and 5462 transitions. [2022-07-21 05:11:28,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-21 05:11:28,007 INFO L276 IsEmpty]: Start isEmpty. Operand 4503 states and 5462 transitions. [2022-07-21 05:11:28,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-07-21 05:11:28,010 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:11:28,010 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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-21 05:11:28,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-21 05:11:28,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-21 05:11:28,233 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:11:28,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:11:28,233 INFO L85 PathProgramCache]: Analyzing trace with hash 990777910, now seen corresponding path program 1 times [2022-07-21 05:11:28,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:11:28,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403880026] [2022-07-21 05:11:28,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:11:28,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:11:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:28,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:11:28,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:28,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:11:28,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:28,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 05:11:28,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:28,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 05:11:28,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:28,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 05:11:28,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:28,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 05:11:28,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:28,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 05:11:28,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:28,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 05:11:28,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:28,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 05:11:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:28,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-21 05:11:28,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:28,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 05:11:28,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:28,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 05:11:28,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:28,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-21 05:11:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:28,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-21 05:11:28,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:28,298 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-07-21 05:11:28,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:11:28,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403880026] [2022-07-21 05:11:28,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403880026] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:11:28,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035240903] [2022-07-21 05:11:28,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:11:28,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:11:28,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:11:28,300 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 05:11:28,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-21 05:11:28,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:28,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 05:11:28,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:11:28,418 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-21 05:11:28,419 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 05:11:28,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035240903] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:11:28,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 05:11:28,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2022-07-21 05:11:28,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537127898] [2022-07-21 05:11:28,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:11:28,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 05:11:28,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:11:28,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 05:11:28,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 05:11:28,421 INFO L87 Difference]: Start difference. First operand 4503 states and 5462 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-21 05:11:28,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:11:28,619 INFO L93 Difference]: Finished difference Result 8682 states and 10665 transitions. [2022-07-21 05:11:28,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 05:11:28,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 164 [2022-07-21 05:11:28,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:11:28,632 INFO L225 Difference]: With dead ends: 8682 [2022-07-21 05:11:28,633 INFO L226 Difference]: Without dead ends: 4330 [2022-07-21 05:11:28,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 05:11:28,641 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 84 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 05:11:28,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 301 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:11:28,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4330 states. [2022-07-21 05:11:28,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4330 to 4327. [2022-07-21 05:11:28,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4327 states, 3665 states have (on average 1.1607094133697136) internal successors, (4254), 3676 states have internal predecessors, (4254), 377 states have call successors, (377), 234 states have call predecessors, (377), 284 states have return successors, (568), 416 states have call predecessors, (568), 375 states have call successors, (568) [2022-07-21 05:11:28,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4327 states to 4327 states and 5199 transitions. [2022-07-21 05:11:28,868 INFO L78 Accepts]: Start accepts. Automaton has 4327 states and 5199 transitions. Word has length 164 [2022-07-21 05:11:28,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:11:28,869 INFO L495 AbstractCegarLoop]: Abstraction has 4327 states and 5199 transitions. [2022-07-21 05:11:28,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-21 05:11:28,869 INFO L276 IsEmpty]: Start isEmpty. Operand 4327 states and 5199 transitions. [2022-07-21 05:11:28,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-07-21 05:11:28,872 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:11:28,872 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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-21 05:11:28,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-21 05:11:29,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:11:29,089 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:11:29,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:11:29,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1614442849, now seen corresponding path program 1 times [2022-07-21 05:11:29,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:11:29,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488872663] [2022-07-21 05:11:29,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:11:29,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:11:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:29,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:11:29,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:29,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:11:29,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:29,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 05:11:29,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:29,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 05:11:29,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:29,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 05:11:29,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:29,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 05:11:29,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:29,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 05:11:29,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:29,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 05:11:29,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:29,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 05:11:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:29,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 05:11:29,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:29,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 05:11:29,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:29,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-21 05:11:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:29,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-21 05:11:29,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:29,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-21 05:11:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:29,170 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-07-21 05:11:29,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:11:29,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488872663] [2022-07-21 05:11:29,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488872663] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:11:29,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:11:29,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 05:11:29,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073079067] [2022-07-21 05:11:29,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:11:29,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 05:11:29,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:11:29,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 05:11:29,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 05:11:29,172 INFO L87 Difference]: Start difference. First operand 4327 states and 5199 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-21 05:11:29,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:11:29,813 INFO L93 Difference]: Finished difference Result 11283 states and 13998 transitions. [2022-07-21 05:11:29,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 05:11:29,813 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 165 [2022-07-21 05:11:29,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:11:29,835 INFO L225 Difference]: With dead ends: 11283 [2022-07-21 05:11:29,835 INFO L226 Difference]: Without dead ends: 6881 [2022-07-21 05:11:29,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-21 05:11:29,847 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 430 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 05:11:29,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 802 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 05:11:29,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6881 states. [2022-07-21 05:11:30,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6881 to 4783. [2022-07-21 05:11:30,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4783 states, 4052 states have (on average 1.1581934846989141) internal successors, (4693), 4067 states have internal predecessors, (4693), 415 states have call successors, (415), 257 states have call predecessors, (415), 315 states have return successors, (623), 458 states have call predecessors, (623), 413 states have call successors, (623) [2022-07-21 05:11:30,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4783 states to 4783 states and 5731 transitions. [2022-07-21 05:11:30,183 INFO L78 Accepts]: Start accepts. Automaton has 4783 states and 5731 transitions. Word has length 165 [2022-07-21 05:11:30,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:11:30,184 INFO L495 AbstractCegarLoop]: Abstraction has 4783 states and 5731 transitions. [2022-07-21 05:11:30,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-21 05:11:30,184 INFO L276 IsEmpty]: Start isEmpty. Operand 4783 states and 5731 transitions. [2022-07-21 05:11:30,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-07-21 05:11:30,187 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:11:30,187 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:11:30,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-21 05:11:30,187 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:11:30,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:11:30,188 INFO L85 PathProgramCache]: Analyzing trace with hash 2040758312, now seen corresponding path program 1 times [2022-07-21 05:11:30,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:11:30,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411026401] [2022-07-21 05:11:30,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:11:30,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:11:30,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:30,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:11:30,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:30,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:11:30,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:30,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 05:11:30,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:30,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 05:11:30,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:30,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 05:11:30,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:30,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 05:11:30,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:30,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 05:11:30,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:30,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 05:11:30,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:30,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 05:11:30,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:30,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 05:11:30,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:30,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-21 05:11:30,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:30,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 05:11:30,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:30,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 05:11:30,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:30,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-21 05:11:30,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:30,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-21 05:11:30,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:30,244 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 40 proven. 6 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-07-21 05:11:30,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:11:30,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411026401] [2022-07-21 05:11:30,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411026401] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:11:30,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288004861] [2022-07-21 05:11:30,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:11:30,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:11:30,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:11:30,246 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 05:11:30,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-21 05:11:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:30,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 05:11:30,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:11:30,431 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-21 05:11:30,431 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 05:11:30,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288004861] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:11:30,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 05:11:30,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-07-21 05:11:30,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382697560] [2022-07-21 05:11:30,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:11:30,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 05:11:30,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:11:30,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 05:11:30,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 05:11:30,433 INFO L87 Difference]: Start difference. First operand 4783 states and 5731 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-21 05:11:30,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:11:30,651 INFO L93 Difference]: Finished difference Result 8862 states and 10649 transitions. [2022-07-21 05:11:30,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 05:11:30,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 170 [2022-07-21 05:11:30,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:11:30,663 INFO L225 Difference]: With dead ends: 8862 [2022-07-21 05:11:30,663 INFO L226 Difference]: Without dead ends: 4169 [2022-07-21 05:11:30,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 05:11:30,673 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 58 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 05:11:30,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 279 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:11:30,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4169 states. [2022-07-21 05:11:30,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4169 to 3893. [2022-07-21 05:11:30,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3893 states, 3313 states have (on average 1.15333534560821) internal successors, (3821), 3324 states have internal predecessors, (3821), 329 states have call successors, (329), 203 states have call predecessors, (329), 250 states have return successors, (444), 365 states have call predecessors, (444), 327 states have call successors, (444) [2022-07-21 05:11:30,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3893 states to 3893 states and 4594 transitions. [2022-07-21 05:11:30,902 INFO L78 Accepts]: Start accepts. Automaton has 3893 states and 4594 transitions. Word has length 170 [2022-07-21 05:11:30,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:11:30,902 INFO L495 AbstractCegarLoop]: Abstraction has 3893 states and 4594 transitions. [2022-07-21 05:11:30,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-21 05:11:30,903 INFO L276 IsEmpty]: Start isEmpty. Operand 3893 states and 4594 transitions. [2022-07-21 05:11:30,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-07-21 05:11:30,905 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:11:30,905 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:11:30,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-21 05:11:31,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-21 05:11:31,124 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:11:31,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:11:31,124 INFO L85 PathProgramCache]: Analyzing trace with hash -606151675, now seen corresponding path program 1 times [2022-07-21 05:11:31,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:11:31,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984237271] [2022-07-21 05:11:31,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:11:31,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:11:31,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:31,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:11:31,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:31,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:11:31,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:31,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 05:11:31,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:31,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 05:11:31,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:31,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 05:11:31,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:31,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 05:11:31,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:31,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 05:11:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:31,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 05:11:31,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:31,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 05:11:31,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:31,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 05:11:31,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:31,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-21 05:11:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:31,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 05:11:31,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:31,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 05:11:31,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:31,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-21 05:11:31,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:31,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-21 05:11:31,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:31,177 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 40 proven. 7 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-07-21 05:11:31,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:11:31,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984237271] [2022-07-21 05:11:31,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984237271] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:11:31,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876889604] [2022-07-21 05:11:31,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:11:31,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:11:31,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:11:31,179 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 05:11:31,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-21 05:11:31,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:31,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 05:11:31,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:11:31,319 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-21 05:11:31,319 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 05:11:31,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876889604] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:11:31,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 05:11:31,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2022-07-21 05:11:31,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921295249] [2022-07-21 05:11:31,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:11:31,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 05:11:31,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:11:31,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 05:11:31,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 05:11:31,322 INFO L87 Difference]: Start difference. First operand 3893 states and 4594 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-21 05:11:31,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:11:31,502 INFO L93 Difference]: Finished difference Result 4506 states and 5322 transitions. [2022-07-21 05:11:31,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 05:11:31,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 170 [2022-07-21 05:11:31,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:11:31,511 INFO L225 Difference]: With dead ends: 4506 [2022-07-21 05:11:31,512 INFO L226 Difference]: Without dead ends: 3896 [2022-07-21 05:11:31,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 05:11:31,515 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 51 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 05:11:31,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 332 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:11:31,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3896 states. [2022-07-21 05:11:31,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3896 to 3893. [2022-07-21 05:11:31,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3893 states, 3313 states have (on average 1.1494114095985513) internal successors, (3808), 3324 states have internal predecessors, (3808), 329 states have call successors, (329), 203 states have call predecessors, (329), 250 states have return successors, (444), 365 states have call predecessors, (444), 327 states have call successors, (444) [2022-07-21 05:11:31,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3893 states to 3893 states and 4581 transitions. [2022-07-21 05:11:31,736 INFO L78 Accepts]: Start accepts. Automaton has 3893 states and 4581 transitions. Word has length 170 [2022-07-21 05:11:31,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:11:31,739 INFO L495 AbstractCegarLoop]: Abstraction has 3893 states and 4581 transitions. [2022-07-21 05:11:31,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-21 05:11:31,740 INFO L276 IsEmpty]: Start isEmpty. Operand 3893 states and 4581 transitions. [2022-07-21 05:11:31,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-07-21 05:11:31,742 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:11:31,742 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:11:31,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-21 05:11:31,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:11:31,967 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:11:31,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:11:31,968 INFO L85 PathProgramCache]: Analyzing trace with hash -635607035, now seen corresponding path program 1 times [2022-07-21 05:11:31,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:11:31,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430543799] [2022-07-21 05:11:31,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:11:31,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:11:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:32,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:11:32,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:32,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:11:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:32,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 05:11:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:32,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 05:11:32,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:32,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 05:11:32,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:32,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 05:11:32,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:32,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 05:11:32,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:32,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 05:11:32,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:32,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 05:11:32,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:32,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 05:11:32,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:32,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 05:11:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:32,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 05:11:32,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:32,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-21 05:11:32,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:32,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 05:11:32,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:32,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-21 05:11:32,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:32,058 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-07-21 05:11:32,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:11:32,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430543799] [2022-07-21 05:11:32,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430543799] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:11:32,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932145448] [2022-07-21 05:11:32,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:11:32,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:11:32,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:11:32,061 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 05:11:32,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-21 05:11:32,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:32,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-21 05:11:32,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:11:32,546 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-07-21 05:11:32,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:11:32,730 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-07-21 05:11:32,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932145448] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:11:32,730 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:11:32,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2022-07-21 05:11:32,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297783341] [2022-07-21 05:11:32,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:11:32,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 05:11:32,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:11:32,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 05:11:32,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 05:11:32,732 INFO L87 Difference]: Start difference. First operand 3893 states and 4581 transitions. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 5 states have internal predecessors, (136), 3 states have call successors, (30), 5 states have call predecessors, (30), 3 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-21 05:11:33,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:11:33,300 INFO L93 Difference]: Finished difference Result 8406 states and 10203 transitions. [2022-07-21 05:11:33,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 05:11:33,301 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 5 states have internal predecessors, (136), 3 states have call successors, (30), 5 states have call predecessors, (30), 3 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 172 [2022-07-21 05:11:33,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:11:33,318 INFO L225 Difference]: With dead ends: 8406 [2022-07-21 05:11:33,318 INFO L226 Difference]: Without dead ends: 5794 [2022-07-21 05:11:33,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 370 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-21 05:11:33,326 INFO L413 NwaCegarLoop]: 352 mSDtfsCounter, 250 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 05:11:33,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 1108 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 05:11:33,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5794 states. [2022-07-21 05:11:33,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5794 to 4184. [2022-07-21 05:11:33,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4184 states, 3559 states have (on average 1.1469513908401237) internal successors, (4082), 3570 states have internal predecessors, (4082), 355 states have call successors, (355), 219 states have call predecessors, (355), 269 states have return successors, (474), 394 states have call predecessors, (474), 353 states have call successors, (474) [2022-07-21 05:11:33,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4184 states to 4184 states and 4911 transitions. [2022-07-21 05:11:33,594 INFO L78 Accepts]: Start accepts. Automaton has 4184 states and 4911 transitions. Word has length 172 [2022-07-21 05:11:33,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:11:33,595 INFO L495 AbstractCegarLoop]: Abstraction has 4184 states and 4911 transitions. [2022-07-21 05:11:33,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 5 states have internal predecessors, (136), 3 states have call successors, (30), 5 states have call predecessors, (30), 3 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-21 05:11:33,595 INFO L276 IsEmpty]: Start isEmpty. Operand 4184 states and 4911 transitions. [2022-07-21 05:11:33,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2022-07-21 05:11:33,602 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:11:33,602 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-21 05:11:33,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-21 05:11:33,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-21 05:11:33,815 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:11:33,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:11:33,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1410851743, now seen corresponding path program 1 times [2022-07-21 05:11:33,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:11:33,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333126366] [2022-07-21 05:11:33,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:11:33,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:11:33,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:33,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:11:33,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:33,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:11:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:33,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 05:11:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:33,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 05:11:33,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:33,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 05:11:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:33,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 05:11:33,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:33,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 05:11:33,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:33,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 05:11:33,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:33,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 05:11:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:33,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 05:11:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:33,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 05:11:33,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:33,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 05:11:33,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:33,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-21 05:11:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:33,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 05:11:33,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:33,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-21 05:11:33,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:33,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-21 05:11:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:33,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-21 05:11:33,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:33,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-21 05:11:33,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:33,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-21 05:11:33,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:33,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-07-21 05:11:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:33,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-07-21 05:11:33,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:33,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-07-21 05:11:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:33,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2022-07-21 05:11:33,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:33,901 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 113 proven. 30 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2022-07-21 05:11:33,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:11:33,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333126366] [2022-07-21 05:11:33,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333126366] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:11:33,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493219363] [2022-07-21 05:11:33,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:11:33,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:11:33,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:11:33,903 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 05:11:33,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-21 05:11:34,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:34,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 05:11:34,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:11:34,074 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 319 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2022-07-21 05:11:34,075 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 05:11:34,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493219363] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:11:34,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 05:11:34,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-07-21 05:11:34,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103332592] [2022-07-21 05:11:34,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:11:34,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 05:11:34,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:11:34,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 05:11:34,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 05:11:34,078 INFO L87 Difference]: Start difference. First operand 4184 states and 4911 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-07-21 05:11:34,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:11:34,395 INFO L93 Difference]: Finished difference Result 10503 states and 12364 transitions. [2022-07-21 05:11:34,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 05:11:34,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 252 [2022-07-21 05:11:34,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:11:34,411 INFO L225 Difference]: With dead ends: 10503 [2022-07-21 05:11:34,411 INFO L226 Difference]: Without dead ends: 6523 [2022-07-21 05:11:34,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 05:11:34,488 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 61 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 05:11:34,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 340 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:11:34,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6523 states. [2022-07-21 05:11:34,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6523 to 6406. [2022-07-21 05:11:34,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6406 states, 5441 states have (on average 1.139680205844514) internal successors, (6201), 5452 states have internal predecessors, (6201), 561 states have call successors, (561), 346 states have call predecessors, (561), 403 states have return successors, (711), 607 states have call predecessors, (711), 559 states have call successors, (711) [2022-07-21 05:11:34,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6406 states to 6406 states and 7473 transitions. [2022-07-21 05:11:34,954 INFO L78 Accepts]: Start accepts. Automaton has 6406 states and 7473 transitions. Word has length 252 [2022-07-21 05:11:34,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:11:34,955 INFO L495 AbstractCegarLoop]: Abstraction has 6406 states and 7473 transitions. [2022-07-21 05:11:34,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-07-21 05:11:34,955 INFO L276 IsEmpty]: Start isEmpty. Operand 6406 states and 7473 transitions. [2022-07-21 05:11:34,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2022-07-21 05:11:34,964 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:11:34,964 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-21 05:11:34,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-21 05:11:35,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-21 05:11:35,188 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:11:35,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:11:35,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1078208605, now seen corresponding path program 1 times [2022-07-21 05:11:35,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:11:35,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166483987] [2022-07-21 05:11:35,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:11:35,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:11:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:35,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:11:35,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:35,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:11:35,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:35,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 05:11:35,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:35,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 05:11:35,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:35,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 05:11:35,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:35,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 05:11:35,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:35,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 05:11:35,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:35,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 05:11:35,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:35,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 05:11:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:35,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 05:11:35,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:35,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 05:11:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:35,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 05:11:35,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:35,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-21 05:11:35,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:35,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 05:11:35,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:35,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-21 05:11:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:35,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-21 05:11:35,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:35,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-21 05:11:35,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:35,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-21 05:11:35,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:35,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-21 05:11:35,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:35,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-07-21 05:11:35,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:35,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-07-21 05:11:35,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:35,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-07-21 05:11:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:35,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2022-07-21 05:11:35,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:35,276 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 94 proven. 13 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2022-07-21 05:11:35,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:11:35,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166483987] [2022-07-21 05:11:35,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166483987] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:11:35,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160744554] [2022-07-21 05:11:35,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:11:35,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:11:35,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:11:35,279 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 05:11:35,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-21 05:11:35,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:11:35,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 05:11:35,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:11:35,425 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 279 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2022-07-21 05:11:35,425 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 05:11:35,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160744554] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:11:35,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 05:11:35,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2022-07-21 05:11:35,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442867328] [2022-07-21 05:11:35,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:11:35,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 05:11:35,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:11:35,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 05:11:35,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 05:11:35,428 INFO L87 Difference]: Start difference. First operand 6406 states and 7473 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-21 05:11:35,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:11:35,626 INFO L93 Difference]: Finished difference Result 8806 states and 10273 transitions. [2022-07-21 05:11:35,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 05:11:35,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 252 [2022-07-21 05:11:35,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:11:35,633 INFO L225 Difference]: With dead ends: 8806 [2022-07-21 05:11:35,633 INFO L226 Difference]: Without dead ends: 2546 [2022-07-21 05:11:35,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 298 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 05:11:35,642 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 7 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 05:11:35,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 270 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:11:35,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2022-07-21 05:11:35,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2546. [2022-07-21 05:11:35,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2546 states, 2145 states have (on average 1.116083916083916) internal successors, (2394), 2158 states have internal predecessors, (2394), 220 states have call successors, (220), 149 states have call predecessors, (220), 180 states have return successors, (280), 238 states have call predecessors, (280), 218 states have call successors, (280) [2022-07-21 05:11:35,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 2894 transitions. [2022-07-21 05:11:35,801 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 2894 transitions. Word has length 252 [2022-07-21 05:11:35,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:11:35,801 INFO L495 AbstractCegarLoop]: Abstraction has 2546 states and 2894 transitions. [2022-07-21 05:11:35,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-21 05:11:35,802 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 2894 transitions. [2022-07-21 05:11:35,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2022-07-21 05:11:35,806 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:11:35,807 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-21 05:11:35,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-21 05:11:36,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-21 05:11:36,030 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:11:36,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:11:36,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1480841608, now seen corresponding path program 1 times [2022-07-21 05:11:36,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:11:36,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663738482] [2022-07-21 05:11:36,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:11:36,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:11:36,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 05:11:36,049 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 05:11:36,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 05:11:36,140 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 05:11:36,141 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 05:11:36,142 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 05:11:36,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-21 05:11:36,146 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:11:36,148 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 05:11:36,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 05:11:36 BoogieIcfgContainer [2022-07-21 05:11:36,334 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 05:11:36,334 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 05:11:36,334 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 05:11:36,335 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 05:11:36,335 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:11:13" (3/4) ... [2022-07-21 05:11:36,337 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-21 05:11:36,491 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 05:11:36,491 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 05:11:36,492 INFO L158 Benchmark]: Toolchain (without parser) took 24409.70ms. Allocated memory was 52.4MB in the beginning and 2.3GB in the end (delta: 2.3GB). Free memory was 29.9MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 738.3MB. Max. memory is 16.1GB. [2022-07-21 05:11:36,492 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 52.4MB. Free memory was 34.4MB in the beginning and 34.3MB in the end (delta: 37.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 05:11:36,492 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.33ms. Allocated memory was 52.4MB in the beginning and 67.1MB in the end (delta: 14.7MB). Free memory was 29.7MB in the beginning and 48.2MB in the end (delta: -18.5MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2022-07-21 05:11:36,492 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.08ms. Allocated memory is still 67.1MB. Free memory was 48.2MB in the beginning and 46.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 05:11:36,493 INFO L158 Benchmark]: Boogie Preprocessor took 45.11ms. Allocated memory is still 67.1MB. Free memory was 46.1MB in the beginning and 44.5MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-21 05:11:36,493 INFO L158 Benchmark]: RCFGBuilder took 482.76ms. Allocated memory is still 67.1MB. Free memory was 44.5MB in the beginning and 43.6MB in the end (delta: 966.5kB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-21 05:11:36,495 INFO L158 Benchmark]: TraceAbstraction took 23285.38ms. Allocated memory was 67.1MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 43.0MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 715.8MB. Max. memory is 16.1GB. [2022-07-21 05:11:36,495 INFO L158 Benchmark]: Witness Printer took 156.77ms. Allocated memory is still 2.3GB. Free memory was 1.6GB in the beginning and 1.5GB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-07-21 05:11:36,503 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.18ms. Allocated memory is still 52.4MB. Free memory was 34.4MB in the beginning and 34.3MB in the end (delta: 37.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 375.33ms. Allocated memory was 52.4MB in the beginning and 67.1MB in the end (delta: 14.7MB). Free memory was 29.7MB in the beginning and 48.2MB in the end (delta: -18.5MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.08ms. Allocated memory is still 67.1MB. Free memory was 48.2MB in the beginning and 46.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.11ms. Allocated memory is still 67.1MB. Free memory was 46.1MB in the beginning and 44.5MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 482.76ms. Allocated memory is still 67.1MB. Free memory was 44.5MB in the beginning and 43.6MB in the end (delta: 966.5kB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 23285.38ms. Allocated memory was 67.1MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 43.0MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 715.8MB. Max. memory is 16.1GB. * Witness Printer took 156.77ms. Allocated memory is still 2.3GB. Free memory was 1.6GB in the beginning and 1.5GB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. 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: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int max_loop ; [L26] int num ; [L27] int i ; [L28] int e ; [L29] int timer ; [L30] char data_0 ; [L31] char data_1 ; [L74] int P_1_pc; [L75] int P_1_st ; [L76] int P_1_i ; [L77] int P_1_ev ; [L132] int C_1_pc ; [L133] int C_1_st ; [L134] int C_1_i ; [L135] int C_1_ev ; [L136] int C_1_pr ; VAL [C_1_ev=0, C_1_i=0, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=0, num=0, P_1_ev=0, P_1_i=0, P_1_pc=0, P_1_st=0, timer=0] [L500] int count ; [L501] int __retres2 ; [L505] num = 0 [L506] i = 0 [L507] max_loop = 2 [L509] timer = 0 [L510] P_1_pc = 0 [L511] C_1_pc = 0 [L513] count = 0 [L514] CALL init_model() [L493] P_1_i = 1 [L494] C_1_i = 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L514] RET init_model() [L515] CALL start_simulation() [L431] int kernel_st ; [L432] int tmp ; [L433] int tmp___0 ; [L437] kernel_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L438] FCALL update_channels() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L439] CALL init_threads() [L236] COND TRUE (int )P_1_i == 1 [L237] P_1_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L241] COND TRUE (int )C_1_i == 1 [L242] C_1_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L439] RET init_threads() [L440] FCALL fire_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L441] CALL activate_threads() VAL [\old(C_1_st)=0, \old(P_1_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [\old(C_1_st)=0, \old(P_1_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L117] COND FALSE !((int )P_1_pc == 1) VAL [\old(C_1_st)=0, \old(P_1_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L127] __retres1 = 0 VAL [\old(C_1_st)=0, \old(P_1_st)=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L129] return (__retres1); VAL [\old(C_1_st)=0, \old(P_1_st)=0, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND FALSE !(\read(tmp)) VAL [\old(C_1_st)=0, \old(P_1_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0, tmp=0] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [\old(C_1_st)=0, \old(P_1_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L199] COND FALSE !((int )C_1_pc == 1) VAL [\old(C_1_st)=0, \old(P_1_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L209] COND FALSE !((int )C_1_pc == 2) VAL [\old(C_1_st)=0, \old(P_1_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L219] __retres1 = 0 VAL [\old(C_1_st)=0, \old(P_1_st)=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L221] return (__retres1); VAL [\old(C_1_st)=0, \old(P_1_st)=0, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [\old(C_1_st)=0, \old(P_1_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0, tmp=0, tmp___1=0] [L441] RET activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L442] FCALL reset_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L445] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L448] kernel_st = 1 [L449] CALL eval() [L272] int tmp ; [L273] int tmp___0 ; [L274] int tmp___1 ; [L275] int tmp___2 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L279] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L251] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [__retres1=1, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L268] return (__retres1); VAL [\result=1, __retres1=1, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, exists_runnable_thread()=1, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0, tmp___2=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND FALSE !(\read(tmp)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0, tmp=0, tmp___2=1] [L304] COND TRUE (int )C_1_st == 0 [L306] tmp___1 = __VERIFIER_nondet_int() [L308] COND TRUE \read(tmp___1) [L310] C_1_st = 1 [L311] CALL C_1() [L138] char c ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L141] COND TRUE (int )C_1_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L156] COND TRUE i < max_loop VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L158] COND TRUE num == 0 [L159] timer = 1 [L160] i += 1 [L161] C_1_pc = 1 [L162] C_1_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L311] RET C_1() [L279] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1, tmp=0, tmp___1=-1, tmp___2=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L251] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [__retres1=1, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L268] return (__retres1); VAL [\result=1, __retres1=1, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, exists_runnable_thread()=1, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1, tmp=0, tmp___1=-1, tmp___2=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1, tmp=0, tmp___1=-1, tmp___2=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND TRUE \read(tmp) [L295] P_1_st = 1 [L296] CALL P_1() [L82] COND TRUE (int )P_1_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, timer=1] [L93] COND TRUE i < max_loop VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, timer=1] [L96] CALL write_data(num, 'A') [L59] COND TRUE i___0 == 0 [L60] data_0 = c VAL [\old(c)=65, \old(i___0)=0, c=65, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, i___0=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, timer=1] [L96] RET write_data(num, 'A') [L97] num += 1 [L98] P_1_pc = 1 [L99] P_1_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L296] RET P_1() [L304] COND FALSE !((int )C_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=-2, tmp___1=-1, tmp___2=1] [L279] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=-2, tmp___1=-1, tmp___2=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L251] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L254] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 VAL [__retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L268] return (__retres1); VAL [\result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, exists_runnable_thread()=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=-2, tmp___1=-1, tmp___2=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND FALSE !(\read(tmp___2)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=-2, tmp___1=-1, tmp___2=0] [L449] RET eval() [L452] kernel_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=2, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L453] FCALL update_channels() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=2, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L456] kernel_st = 3 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=3, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L457] FCALL fire_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=3, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L458] CALL activate_threads() VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L118] COND FALSE !((int )P_1_ev == 1) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L127] __retres1 = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L129] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND FALSE !(\read(tmp)) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L200] COND FALSE !((int )e == 1) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L219] __retres1 = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L221] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0, tmp___1=0] [L458] RET activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=3, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L459] FCALL reset_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=3, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L462] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L251] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L254] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 VAL [__retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L268] return (__retres1); VAL [\result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L462] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, exists_runnable_thread()=0, i=1, kernel_st=3, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L462] tmp = exists_runnable_thread() [L464] COND TRUE tmp == 0 [L466] kernel_st = 4 [L467] CALL fire_time_events() [L346] C_1_ev = 1 [L348] P_1_ev = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L467] RET fire_time_events() [L468] CALL activate_threads() VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L118] COND TRUE (int )P_1_ev == 1 [L119] __retres1 = 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L129] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \result=1, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND TRUE \read(tmp) [L384] P_1_st = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=1] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L200] COND FALSE !((int )e == 1) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L219] __retres1 = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L221] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \result=0, __retres1=0, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=1, tmp___1=0] [L468] RET activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=4, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=0] [L469] CALL reset_time_events() [L360] COND TRUE (int )P_1_ev == 1 [L361] P_1_ev = 2 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L365] COND TRUE (int )C_1_ev == 1 [L366] C_1_ev = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L469] RET reset_time_events() [L475] CALL, EXPR stop_simulation() [L412] int tmp ; [L413] int __retres2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L417] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [__retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L268] return (__retres1); VAL [\result=1, __retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L417] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, exists_runnable_thread()=1, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L417] tmp = exists_runnable_thread() [L419] COND TRUE \read(tmp) [L420] __retres2 = 0 VAL [__retres2=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=1] [L427] return (__retres2); VAL [\result=0, __retres2=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=1] [L475] RET, EXPR stop_simulation() [L475] tmp___0 = stop_simulation() [L477] COND FALSE !(\read(tmp___0)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=4, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=0, tmp___0=0] [L445] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=4, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=0, tmp___0=0] [L448] kernel_st = 1 [L449] CALL eval() [L272] int tmp ; [L273] int tmp___0 ; [L274] int tmp___1 ; [L275] int tmp___2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L279] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [__retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L268] return (__retres1); VAL [\result=1, __retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, exists_runnable_thread()=1, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp___2=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND TRUE \read(tmp) [L295] P_1_st = 1 [L296] CALL P_1() [L82] COND FALSE !((int )P_1_pc == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L85] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L93] COND TRUE i < max_loop VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L96] CALL write_data(num, 'A') [L59] COND FALSE !(i___0 == 0) VAL [\old(c)=65, \old(i___0)=1, c=65, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, i___0=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L62] COND TRUE i___0 == 1 [L63] data_1 = c VAL [\old(c)=65, \old(i___0)=1, c=65, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, i___0=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L96] RET write_data(num, 'A') [L97] num += 1 [L98] P_1_pc = 1 [L99] P_1_st = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L296] RET P_1() [L304] COND FALSE !((int )C_1_st == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=-3, tmp___2=1] [L279] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=-3, tmp___2=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L254] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 VAL [__retres1=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L268] return (__retres1); VAL [\result=0, __retres1=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, exists_runnable_thread()=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=-3, tmp___2=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND FALSE !(\read(tmp___2)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=-3, tmp___2=0] [L449] RET eval() [L452] kernel_st = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=2, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0, tmp___0=0] [L453] FCALL update_channels() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=2, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0, tmp___0=0] [L456] kernel_st = 3 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=3, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0, tmp___0=0] [L457] FCALL fire_delta_events() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=3, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0, tmp___0=0] [L458] CALL activate_threads() VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L118] COND FALSE !((int )P_1_ev == 1) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L127] __retres1 = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L129] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \result=0, __retres1=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND FALSE !(\read(tmp)) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L200] COND FALSE !((int )e == 1) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L219] __retres1 = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L221] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \result=0, __retres1=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0, tmp___1=0] [L458] RET activate_threads() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=3, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0, tmp___0=0] [L459] FCALL reset_delta_events() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=3, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0, tmp___0=0] [L462] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L254] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 VAL [__retres1=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L268] return (__retres1); VAL [\result=0, __retres1=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L462] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, exists_runnable_thread()=0, i=1, kernel_st=3, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0, tmp___0=0] [L462] tmp = exists_runnable_thread() [L464] COND TRUE tmp == 0 [L466] kernel_st = 4 [L467] CALL fire_time_events() [L346] C_1_ev = 1 [L348] P_1_ev = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L467] RET fire_time_events() [L468] CALL activate_threads() VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L118] COND TRUE (int )P_1_ev == 1 [L119] __retres1 = 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L129] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \result=1, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND TRUE \read(tmp) [L384] P_1_st = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=1] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L200] COND FALSE !((int )e == 1) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L219] __retres1 = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L221] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \result=0, __retres1=0, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=1, tmp___1=0] [L468] RET activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=4, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=0, tmp___0=0] [L469] CALL reset_time_events() [L360] COND TRUE (int )P_1_ev == 1 [L361] P_1_ev = 2 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L365] COND TRUE (int )C_1_ev == 1 [L366] C_1_ev = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L469] RET reset_time_events() [L475] CALL, EXPR stop_simulation() [L412] int tmp ; [L413] int __retres2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L417] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [__retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L268] return (__retres1); VAL [\result=1, __retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L417] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, exists_runnable_thread()=1, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L417] tmp = exists_runnable_thread() [L419] COND TRUE \read(tmp) [L420] __retres2 = 0 VAL [__retres2=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=1] [L427] return (__retres2); VAL [\result=0, __retres2=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=1] [L475] RET, EXPR stop_simulation() [L475] tmp___0 = stop_simulation() [L477] COND FALSE !(\read(tmp___0)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=4, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=0, tmp___0=0] [L445] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=4, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=0, tmp___0=0] [L448] kernel_st = 1 [L449] CALL eval() [L272] int tmp ; [L273] int tmp___0 ; [L274] int tmp___1 ; [L275] int tmp___2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L279] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [__retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L268] return (__retres1); VAL [\result=1, __retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, exists_runnable_thread()=1, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp___2=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND TRUE \read(tmp) [L295] P_1_st = 1 [L296] CALL P_1() [L82] COND FALSE !((int )P_1_pc == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L85] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L93] COND TRUE i < max_loop VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L96] CALL write_data(num, 'A') [L59] COND FALSE !(i___0 == 0) VAL [\old(c)=65, \old(i___0)=2, c=65, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, i___0=2, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L62] COND FALSE !(i___0 == 1) VAL [\old(c)=65, \old(i___0)=2, c=65, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, i___0=2, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L66] CALL error() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L19] reach_error() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 108 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.1s, OverallIterations: 26, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5227 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5075 mSDsluCounter, 12638 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7538 mSDsCounter, 798 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2839 IncrementalHoareTripleChecker+Invalid, 3637 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 798 mSolverCounterUnsat, 5100 mSDtfsCounter, 2839 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2880 GetRequests, 2717 SyntacticMatches, 6 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8718occurred in iteration=15, InterpolantAutomatonStates: 155, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 7837 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 5201 NumberOfCodeBlocks, 5201 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 5059 ConstructedInterpolants, 0 QuantifiedInterpolants, 9500 SizeOfPredicates, 4 NumberOfNonLiveVariables, 5501 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 38 InterpolantComputations, 24 PerfectInterpolantSequences, 4284/4568 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-21 05:11:36,551 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