./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/token_ring.02.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 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/token_ring.02.cil-2.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 bc8487f898950b83c481f83a71342af68752fb6e7598d76df123761c32c89f72 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 15:35:52,397 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 15:35:52,399 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 15:35:52,443 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 15:35:52,444 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 15:35:52,447 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 15:35:52,448 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 15:35:52,453 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 15:35:52,454 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 15:35:52,457 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 15:35:52,458 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 15:35:52,459 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 15:35:52,459 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 15:35:52,461 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 15:35:52,462 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 15:35:52,463 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 15:35:52,464 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 15:35:52,464 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 15:35:52,467 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 15:35:52,471 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 15:35:52,472 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 15:35:52,473 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 15:35:52,474 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 15:35:52,474 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 15:35:52,476 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 15:35:52,476 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 15:35:52,476 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 15:35:52,477 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 15:35:52,478 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 15:35:52,478 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 15:35:52,478 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 15:35:52,479 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 15:35:52,481 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 15:35:52,481 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 15:35:52,482 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 15:35:52,482 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 15:35:52,483 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 15:35:52,483 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 15:35:52,483 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 15:35:52,484 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 15:35:52,484 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 15:35:52,485 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 15:35:52,510 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 15:35:52,510 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 15:35:52,511 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 15:35:52,511 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 15:35:52,512 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 15:35:52,512 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 15:35:52,512 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 15:35:52,512 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 15:35:52,513 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 15:35:52,513 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 15:35:52,513 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 15:35:52,514 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 15:35:52,514 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 15:35:52,514 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 15:35:52,514 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 15:35:52,514 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 15:35:52,514 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 15:35:52,514 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 15:35:52,514 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 15:35:52,515 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 15:35:52,515 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 15:35:52,515 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 15:35:52,515 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 15:35:52,515 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 15:35:52,515 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 15:35:52,515 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 15:35:52,516 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 15:35:52,516 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 15:35:52,516 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 15:35:52,517 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 15:35:52,517 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 15:35:52,517 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 15:35:52,517 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 15:35:52,517 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 15:35:52,517 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 -> bc8487f898950b83c481f83a71342af68752fb6e7598d76df123761c32c89f72 [2021-12-17 15:35:52,687 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 15:35:52,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 15:35:52,712 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 15:35:52,712 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 15:35:52,713 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 15:35:52,714 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.02.cil-2.c [2021-12-17 15:35:52,765 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3b70d2be/b544a6f833c54076942eeecbc6feeede/FLAG1bc4d3e71 [2021-12-17 15:35:53,117 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 15:35:53,122 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.02.cil-2.c [2021-12-17 15:35:53,130 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3b70d2be/b544a6f833c54076942eeecbc6feeede/FLAG1bc4d3e71 [2021-12-17 15:35:53,142 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3b70d2be/b544a6f833c54076942eeecbc6feeede [2021-12-17 15:35:53,144 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 15:35:53,145 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 15:35:53,148 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 15:35:53,148 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 15:35:53,150 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 15:35:53,151 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 03:35:53" (1/1) ... [2021-12-17 15:35:53,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3270826c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:35:53, skipping insertion in model container [2021-12-17 15:35:53,152 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 03:35:53" (1/1) ... [2021-12-17 15:35:53,158 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 15:35:53,198 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 15:35:53,334 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/token_ring.02.cil-2.c[671,684] [2021-12-17 15:35:53,401 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 15:35:53,411 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 15:35:53,421 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/token_ring.02.cil-2.c[671,684] [2021-12-17 15:35:53,447 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 15:35:53,461 INFO L208 MainTranslator]: Completed translation [2021-12-17 15:35:53,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:35:53 WrapperNode [2021-12-17 15:35:53,462 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 15:35:53,463 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 15:35:53,463 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 15:35:53,463 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 15:35:53,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:35:53" (1/1) ... [2021-12-17 15:35:53,484 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:35:53" (1/1) ... [2021-12-17 15:35:53,505 INFO L137 Inliner]: procedures = 32, calls = 38, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 278 [2021-12-17 15:35:53,509 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 15:35:53,510 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 15:35:53,510 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 15:35:53,511 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 15:35:53,517 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:35:53" (1/1) ... [2021-12-17 15:35:53,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:35:53" (1/1) ... [2021-12-17 15:35:53,524 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:35:53" (1/1) ... [2021-12-17 15:35:53,526 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:35:53" (1/1) ... [2021-12-17 15:35:53,530 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:35:53" (1/1) ... [2021-12-17 15:35:53,542 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:35:53" (1/1) ... [2021-12-17 15:35:53,544 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:35:53" (1/1) ... [2021-12-17 15:35:53,549 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 15:35:53,550 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 15:35:53,551 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 15:35:53,551 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 15:35:53,552 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:35:53" (1/1) ... [2021-12-17 15:35:53,556 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 15:35:53,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:35:53,577 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) [2021-12-17 15:35:53,597 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 [2021-12-17 15:35:53,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 15:35:53,608 INFO L130 BoogieDeclarations]: Found specification of procedure error [2021-12-17 15:35:53,608 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2021-12-17 15:35:53,608 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2021-12-17 15:35:53,609 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2021-12-17 15:35:53,609 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2021-12-17 15:35:53,609 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2021-12-17 15:35:53,609 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-12-17 15:35:53,609 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-12-17 15:35:53,609 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2021-12-17 15:35:53,609 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2021-12-17 15:35:53,609 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2021-12-17 15:35:53,609 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2021-12-17 15:35:53,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 15:35:53,610 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2021-12-17 15:35:53,610 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2021-12-17 15:35:53,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 15:35:53,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 15:35:53,679 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 15:35:53,681 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 15:35:53,941 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 15:35:53,946 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 15:35:53,947 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-17 15:35:53,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 03:35:53 BoogieIcfgContainer [2021-12-17 15:35:53,948 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 15:35:53,949 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 15:35:53,950 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 15:35:53,952 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 15:35:53,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 03:35:53" (1/3) ... [2021-12-17 15:35:53,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e953e7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 03:35:53, skipping insertion in model container [2021-12-17 15:35:53,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:35:53" (2/3) ... [2021-12-17 15:35:53,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e953e7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 03:35:53, skipping insertion in model container [2021-12-17 15:35:53,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 03:35:53" (3/3) ... [2021-12-17 15:35:53,954 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-2.c [2021-12-17 15:35:53,957 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 15:35:53,957 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 15:35:53,986 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 15:35:53,992 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 15:35:53,992 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 15:35:54,012 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 113 states have (on average 1.584070796460177) internal successors, (179), 117 states have internal predecessors, (179), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2021-12-17 15:35:54,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-17 15:35:54,020 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:35:54,020 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1] [2021-12-17 15:35:54,021 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:35:54,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:35:54,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1053890287, now seen corresponding path program 1 times [2021-12-17 15:35:54,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:35:54,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061565580] [2021-12-17 15:35:54,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:35:54,034 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:35:54,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:54,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:35:54,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:54,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:35:54,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:54,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:35:54,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:54,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 15:35:54,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:54,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-17 15:35:54,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:54,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 15:35:54,316 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:35:54,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061565580] [2021-12-17 15:35:54,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061565580] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:35:54,317 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:35:54,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 15:35:54,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033649683] [2021-12-17 15:35:54,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:35:54,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 15:35:54,322 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:35:54,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 15:35:54,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:35:54,353 INFO L87 Difference]: Start difference. First operand has 140 states, 113 states have (on average 1.584070796460177) internal successors, (179), 117 states have internal predecessors, (179), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:35:54,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:35:54,741 INFO L93 Difference]: Finished difference Result 304 states and 476 transitions. [2021-12-17 15:35:54,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 15:35:54,749 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (6), 4 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 68 [2021-12-17 15:35:54,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:35:54,756 INFO L225 Difference]: With dead ends: 304 [2021-12-17 15:35:54,756 INFO L226 Difference]: Without dead ends: 166 [2021-12-17 15:35:54,758 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-17 15:35:54,761 INFO L933 BasicCegarLoop]: 212 mSDtfsCounter, 298 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 15:35:54,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [312 Valid, 377 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 15:35:54,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-12-17 15:35:54,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 134. [2021-12-17 15:35:54,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 109 states have (on average 1.4862385321100917) internal successors, (162), 111 states have internal predecessors, (162), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2021-12-17 15:35:54,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 196 transitions. [2021-12-17 15:35:54,797 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 196 transitions. Word has length 68 [2021-12-17 15:35:54,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:35:54,797 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 196 transitions. [2021-12-17 15:35:54,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:35:54,797 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 196 transitions. [2021-12-17 15:35:54,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-17 15:35:54,799 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:35:54,799 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1] [2021-12-17 15:35:54,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 15:35:54,799 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:35:54,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:35:54,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1279502351, now seen corresponding path program 1 times [2021-12-17 15:35:54,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:35:54,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181390446] [2021-12-17 15:35:54,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:35:54,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:35:54,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:54,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:35:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:54,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:35:54,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:54,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:35:54,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:54,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 15:35:54,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:54,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-17 15:35:54,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:54,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 15:35:54,875 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:35:54,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181390446] [2021-12-17 15:35:54,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181390446] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:35:54,876 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:35:54,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 15:35:54,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960401175] [2021-12-17 15:35:54,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:35:54,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 15:35:54,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:35:54,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 15:35:54,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 15:35:54,878 INFO L87 Difference]: Start difference. First operand 134 states and 196 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:35:55,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:35:55,410 INFO L93 Difference]: Finished difference Result 444 states and 667 transitions. [2021-12-17 15:35:55,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 15:35:55,410 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (6), 4 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 68 [2021-12-17 15:35:55,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:35:55,413 INFO L225 Difference]: With dead ends: 444 [2021-12-17 15:35:55,413 INFO L226 Difference]: Without dead ends: 320 [2021-12-17 15:35:55,414 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-12-17 15:35:55,415 INFO L933 BasicCegarLoop]: 220 mSDtfsCounter, 419 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 15:35:55,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [428 Valid, 604 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-17 15:35:55,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2021-12-17 15:35:55,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 255. [2021-12-17 15:35:55,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 212 states have (on average 1.5) internal successors, (318), 215 states have internal predecessors, (318), 29 states have call successors, (29), 13 states have call predecessors, (29), 13 states have return successors, (30), 27 states have call predecessors, (30), 27 states have call successors, (30) [2021-12-17 15:35:55,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 377 transitions. [2021-12-17 15:35:55,435 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 377 transitions. Word has length 68 [2021-12-17 15:35:55,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:35:55,435 INFO L470 AbstractCegarLoop]: Abstraction has 255 states and 377 transitions. [2021-12-17 15:35:55,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:35:55,435 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 377 transitions. [2021-12-17 15:35:55,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-17 15:35:55,436 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:35:55,437 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1] [2021-12-17 15:35:55,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 15:35:55,437 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:35:55,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:35:55,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1382216715, now seen corresponding path program 1 times [2021-12-17 15:35:55,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:35:55,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353799184] [2021-12-17 15:35:55,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:35:55,438 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:35:55,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:55,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:35:55,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:55,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:35:55,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:55,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:35:55,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:55,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 15:35:55,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:55,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-17 15:35:55,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:55,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 15:35:55,503 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:35:55,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353799184] [2021-12-17 15:35:55,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353799184] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:35:55,504 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:35:55,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 15:35:55,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112486763] [2021-12-17 15:35:55,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:35:55,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 15:35:55,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:35:55,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 15:35:55,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 15:35:55,505 INFO L87 Difference]: Start difference. First operand 255 states and 377 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:35:56,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:35:56,125 INFO L93 Difference]: Finished difference Result 717 states and 1071 transitions. [2021-12-17 15:35:56,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-17 15:35:56,125 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (6), 4 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 68 [2021-12-17 15:35:56,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:35:56,131 INFO L225 Difference]: With dead ends: 717 [2021-12-17 15:35:56,131 INFO L226 Difference]: Without dead ends: 472 [2021-12-17 15:35:56,134 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-12-17 15:35:56,139 INFO L933 BasicCegarLoop]: 311 mSDtfsCounter, 407 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-17 15:35:56,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [416 Valid, 1023 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-17 15:35:56,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2021-12-17 15:35:56,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 369. [2021-12-17 15:35:56,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 308 states have (on average 1.4935064935064934) internal successors, (460), 312 states have internal predecessors, (460), 40 states have call successors, (40), 19 states have call predecessors, (40), 20 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2021-12-17 15:35:56,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 543 transitions. [2021-12-17 15:35:56,181 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 543 transitions. Word has length 68 [2021-12-17 15:35:56,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:35:56,182 INFO L470 AbstractCegarLoop]: Abstraction has 369 states and 543 transitions. [2021-12-17 15:35:56,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:35:56,182 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 543 transitions. [2021-12-17 15:35:56,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-17 15:35:56,188 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:35:56,188 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1] [2021-12-17 15:35:56,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-17 15:35:56,189 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:35:56,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:35:56,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1525965171, now seen corresponding path program 1 times [2021-12-17 15:35:56,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:35:56,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780750605] [2021-12-17 15:35:56,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:35:56,190 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:35:56,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:56,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:35:56,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:56,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:35:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:56,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:35:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:56,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 15:35:56,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:56,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-17 15:35:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:56,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 15:35:56,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:35:56,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780750605] [2021-12-17 15:35:56,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780750605] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:35:56,286 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:35:56,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 15:35:56,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884454505] [2021-12-17 15:35:56,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:35:56,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 15:35:56,287 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:35:56,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 15:35:56,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 15:35:56,288 INFO L87 Difference]: Start difference. First operand 369 states and 543 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:35:56,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:35:56,857 INFO L93 Difference]: Finished difference Result 1118 states and 1665 transitions. [2021-12-17 15:35:56,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-17 15:35:56,857 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (6), 4 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 68 [2021-12-17 15:35:56,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:35:56,862 INFO L225 Difference]: With dead ends: 1118 [2021-12-17 15:35:56,863 INFO L226 Difference]: Without dead ends: 759 [2021-12-17 15:35:56,864 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-12-17 15:35:56,874 INFO L933 BasicCegarLoop]: 222 mSDtfsCounter, 441 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 15:35:56,875 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [450 Valid, 713 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-17 15:35:56,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2021-12-17 15:35:56,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 598. [2021-12-17 15:35:56,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 501 states have (on average 1.4870259481037924) internal successors, (745), 507 states have internal predecessors, (745), 62 states have call successors, (62), 31 states have call predecessors, (62), 34 states have return successors, (73), 63 states have call predecessors, (73), 60 states have call successors, (73) [2021-12-17 15:35:56,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 880 transitions. [2021-12-17 15:35:56,907 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 880 transitions. Word has length 68 [2021-12-17 15:35:56,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:35:56,907 INFO L470 AbstractCegarLoop]: Abstraction has 598 states and 880 transitions. [2021-12-17 15:35:56,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:35:56,908 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 880 transitions. [2021-12-17 15:35:56,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-17 15:35:56,908 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:35:56,909 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1] [2021-12-17 15:35:56,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-17 15:35:56,909 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:35:56,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:35:56,909 INFO L85 PathProgramCache]: Analyzing trace with hash -649946165, now seen corresponding path program 1 times [2021-12-17 15:35:56,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:35:56,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058045993] [2021-12-17 15:35:56,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:35:56,910 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:35:56,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:56,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:35:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:56,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:35:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:56,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:35:56,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:56,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 15:35:56,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:56,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-17 15:35:56,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:56,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 15:35:56,990 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:35:56,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058045993] [2021-12-17 15:35:56,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058045993] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:35:56,991 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:35:56,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 15:35:56,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606447198] [2021-12-17 15:35:56,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:35:56,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 15:35:56,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:35:56,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 15:35:56,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-17 15:35:56,992 INFO L87 Difference]: Start difference. First operand 598 states and 880 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:35:57,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:35:57,284 INFO L93 Difference]: Finished difference Result 1331 states and 1985 transitions. [2021-12-17 15:35:57,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 15:35:57,285 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (6), 4 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 68 [2021-12-17 15:35:57,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:35:57,288 INFO L225 Difference]: With dead ends: 1331 [2021-12-17 15:35:57,288 INFO L226 Difference]: Without dead ends: 743 [2021-12-17 15:35:57,290 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-12-17 15:35:57,290 INFO L933 BasicCegarLoop]: 173 mSDtfsCounter, 312 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 15:35:57,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [322 Valid, 499 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 15:35:57,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2021-12-17 15:35:57,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 598. [2021-12-17 15:35:57,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 501 states have (on average 1.4770459081836327) internal successors, (740), 507 states have internal predecessors, (740), 62 states have call successors, (62), 31 states have call predecessors, (62), 34 states have return successors, (73), 63 states have call predecessors, (73), 60 states have call successors, (73) [2021-12-17 15:35:57,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 875 transitions. [2021-12-17 15:35:57,315 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 875 transitions. Word has length 68 [2021-12-17 15:35:57,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:35:57,315 INFO L470 AbstractCegarLoop]: Abstraction has 598 states and 875 transitions. [2021-12-17 15:35:57,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:35:57,316 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 875 transitions. [2021-12-17 15:35:57,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-17 15:35:57,316 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:35:57,317 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1] [2021-12-17 15:35:57,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-17 15:35:57,317 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:35:57,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:35:57,317 INFO L85 PathProgramCache]: Analyzing trace with hash 888393865, now seen corresponding path program 1 times [2021-12-17 15:35:57,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:35:57,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872217244] [2021-12-17 15:35:57,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:35:57,318 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:35:57,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:57,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:35:57,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:57,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:35:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:57,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:35:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:57,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 15:35:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:57,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-17 15:35:57,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:57,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 15:35:57,369 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:35:57,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872217244] [2021-12-17 15:35:57,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872217244] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:35:57,369 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:35:57,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 15:35:57,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367386843] [2021-12-17 15:35:57,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:35:57,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 15:35:57,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:35:57,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 15:35:57,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 15:35:57,371 INFO L87 Difference]: Start difference. First operand 598 states and 875 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:35:57,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:35:57,948 INFO L93 Difference]: Finished difference Result 1934 states and 2844 transitions. [2021-12-17 15:35:57,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-17 15:35:57,949 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (6), 4 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 68 [2021-12-17 15:35:57,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:35:57,955 INFO L225 Difference]: With dead ends: 1934 [2021-12-17 15:35:57,955 INFO L226 Difference]: Without dead ends: 1346 [2021-12-17 15:35:57,957 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-12-17 15:35:57,958 INFO L933 BasicCegarLoop]: 288 mSDtfsCounter, 412 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 15:35:57,958 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [424 Valid, 988 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-17 15:35:57,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2021-12-17 15:35:58,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1055. [2021-12-17 15:35:58,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1055 states, 890 states have (on average 1.4764044943820225) internal successors, (1314), 900 states have internal predecessors, (1314), 102 states have call successors, (102), 55 states have call predecessors, (102), 62 states have return successors, (135), 107 states have call predecessors, (135), 100 states have call successors, (135) [2021-12-17 15:35:58,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1551 transitions. [2021-12-17 15:35:58,026 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1551 transitions. Word has length 68 [2021-12-17 15:35:58,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:35:58,027 INFO L470 AbstractCegarLoop]: Abstraction has 1055 states and 1551 transitions. [2021-12-17 15:35:58,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:35:58,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1551 transitions. [2021-12-17 15:35:58,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-17 15:35:58,029 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:35:58,029 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1] [2021-12-17 15:35:58,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-17 15:35:58,029 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:35:58,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:35:58,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1140192245, now seen corresponding path program 1 times [2021-12-17 15:35:58,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:35:58,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130749158] [2021-12-17 15:35:58,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:35:58,033 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:35:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:58,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:35:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:58,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:35:58,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:58,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:35:58,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:58,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 15:35:58,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:58,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-17 15:35:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:58,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 15:35:58,102 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:35:58,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130749158] [2021-12-17 15:35:58,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130749158] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:35:58,103 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:35:58,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 15:35:58,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545533412] [2021-12-17 15:35:58,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:35:58,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 15:35:58,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:35:58,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 15:35:58,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 15:35:58,107 INFO L87 Difference]: Start difference. First operand 1055 states and 1551 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:35:58,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:35:58,660 INFO L93 Difference]: Finished difference Result 3471 states and 5108 transitions. [2021-12-17 15:35:58,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 15:35:58,660 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (6), 4 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 68 [2021-12-17 15:35:58,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:35:58,669 INFO L225 Difference]: With dead ends: 3471 [2021-12-17 15:35:58,669 INFO L226 Difference]: Without dead ends: 2427 [2021-12-17 15:35:58,672 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-12-17 15:35:58,673 INFO L933 BasicCegarLoop]: 351 mSDtfsCounter, 537 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 15:35:58,673 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [562 Valid, 759 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-17 15:35:58,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2427 states. [2021-12-17 15:35:58,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2427 to 2004. [2021-12-17 15:35:58,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2004 states, 1681 states have (on average 1.4443783462224866) internal successors, (2428), 1708 states have internal predecessors, (2428), 198 states have call successors, (198), 109 states have call predecessors, (198), 124 states have return successors, (259), 194 states have call predecessors, (259), 196 states have call successors, (259) [2021-12-17 15:35:58,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2004 states to 2004 states and 2885 transitions. [2021-12-17 15:35:58,751 INFO L78 Accepts]: Start accepts. Automaton has 2004 states and 2885 transitions. Word has length 68 [2021-12-17 15:35:58,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:35:58,751 INFO L470 AbstractCegarLoop]: Abstraction has 2004 states and 2885 transitions. [2021-12-17 15:35:58,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:35:58,752 INFO L276 IsEmpty]: Start isEmpty. Operand 2004 states and 2885 transitions. [2021-12-17 15:35:58,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-12-17 15:35:58,758 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:35:58,758 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:35:58,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-17 15:35:58,759 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:35:58,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:35:58,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1415706776, now seen corresponding path program 1 times [2021-12-17 15:35:58,759 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:35:58,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537044186] [2021-12-17 15:35:58,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:35:58,760 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:35:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:58,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:35:58,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:58,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:35:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:58,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:35:58,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:58,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 15:35:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:58,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-17 15:35:58,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:58,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-17 15:35:58,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:58,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:35:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:58,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-17 15:35:58,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:58,874 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-17 15:35:58,874 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:35:58,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537044186] [2021-12-17 15:35:58,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537044186] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:35:58,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220726490] [2021-12-17 15:35:58,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:35:58,875 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:35:58,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:35:58,876 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) [2021-12-17 15:35:58,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-17 15:35:58,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:58,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 15:35:58,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:35:59,138 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-17 15:35:59,139 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:35:59,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220726490] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:35:59,139 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:35:59,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2021-12-17 15:35:59,140 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786863838] [2021-12-17 15:35:59,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:35:59,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 15:35:59,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:35:59,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 15:35:59,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 15:35:59,141 INFO L87 Difference]: Start difference. First operand 2004 states and 2885 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-17 15:35:59,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:35:59,256 INFO L93 Difference]: Finished difference Result 5899 states and 8555 transitions. [2021-12-17 15:35:59,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 15:35:59,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 110 [2021-12-17 15:35:59,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:35:59,270 INFO L225 Difference]: With dead ends: 5899 [2021-12-17 15:35:59,270 INFO L226 Difference]: Without dead ends: 3906 [2021-12-17 15:35:59,274 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 15:35:59,275 INFO L933 BasicCegarLoop]: 202 mSDtfsCounter, 151 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 372 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 [2021-12-17 15:35:59,275 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 372 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:35:59,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3906 states. [2021-12-17 15:35:59,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3906 to 3866. [2021-12-17 15:35:59,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3866 states, 3245 states have (on average 1.4431432973805856) internal successors, (4683), 3297 states have internal predecessors, (4683), 372 states have call successors, (372), 217 states have call predecessors, (372), 248 states have return successors, (489), 359 states have call predecessors, (489), 370 states have call successors, (489) [2021-12-17 15:35:59,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3866 states to 3866 states and 5544 transitions. [2021-12-17 15:35:59,418 INFO L78 Accepts]: Start accepts. Automaton has 3866 states and 5544 transitions. Word has length 110 [2021-12-17 15:35:59,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:35:59,418 INFO L470 AbstractCegarLoop]: Abstraction has 3866 states and 5544 transitions. [2021-12-17 15:35:59,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-17 15:35:59,419 INFO L276 IsEmpty]: Start isEmpty. Operand 3866 states and 5544 transitions. [2021-12-17 15:35:59,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-12-17 15:35:59,424 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:35:59,424 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:35:59,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-17 15:35:59,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:35:59,646 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:35:59,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:35:59,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1986703688, now seen corresponding path program 1 times [2021-12-17 15:35:59,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:35:59,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799047199] [2021-12-17 15:35:59,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:35:59,646 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:35:59,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:59,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:35:59,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:59,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:35:59,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:59,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:35:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:59,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 15:35:59,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:59,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-17 15:35:59,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:59,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-17 15:35:59,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:59,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:35:59,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:59,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-17 15:35:59,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:59,727 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-17 15:35:59,727 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:35:59,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799047199] [2021-12-17 15:35:59,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799047199] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:35:59,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512875161] [2021-12-17 15:35:59,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:35:59,728 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:35:59,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:35:59,731 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) [2021-12-17 15:35:59,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-17 15:35:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:59,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 15:35:59,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:35:59,920 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-17 15:35:59,920 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:35:59,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512875161] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:35:59,920 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:35:59,920 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-17 15:35:59,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866954924] [2021-12-17 15:35:59,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:35:59,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 15:35:59,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:35:59,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 15:35:59,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 15:35:59,922 INFO L87 Difference]: Start difference. First operand 3866 states and 5544 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 15:36:00,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:36:00,085 INFO L93 Difference]: Finished difference Result 7636 states and 11086 transitions. [2021-12-17 15:36:00,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 15:36:00,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 110 [2021-12-17 15:36:00,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:36:00,107 INFO L225 Difference]: With dead ends: 7636 [2021-12-17 15:36:00,107 INFO L226 Difference]: Without dead ends: 5617 [2021-12-17 15:36:00,114 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 15:36:00,115 INFO L933 BasicCegarLoop]: 342 mSDtfsCounter, 142 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:36:00,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 532 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:36:00,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5617 states. [2021-12-17 15:36:00,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5617 to 5617. [2021-12-17 15:36:00,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5617 states, 4715 states have (on average 1.4362672322375398) internal successors, (6772), 4783 states have internal predecessors, (6772), 533 states have call successors, (533), 321 states have call predecessors, (533), 368 states have return successors, (759), 520 states have call predecessors, (759), 531 states have call successors, (759) [2021-12-17 15:36:00,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5617 states to 5617 states and 8064 transitions. [2021-12-17 15:36:00,356 INFO L78 Accepts]: Start accepts. Automaton has 5617 states and 8064 transitions. Word has length 110 [2021-12-17 15:36:00,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:36:00,356 INFO L470 AbstractCegarLoop]: Abstraction has 5617 states and 8064 transitions. [2021-12-17 15:36:00,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 15:36:00,357 INFO L276 IsEmpty]: Start isEmpty. Operand 5617 states and 8064 transitions. [2021-12-17 15:36:00,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-12-17 15:36:00,365 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:36:00,365 INFO L514 BasicCegarLoop]: trace histogram [3, 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, 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] [2021-12-17 15:36:00,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-17 15:36:00,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-12-17 15:36:00,583 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:36:00,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:36:00,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1976353697, now seen corresponding path program 1 times [2021-12-17 15:36:00,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:36:00,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790425550] [2021-12-17 15:36:00,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:36:00,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:36:00,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:00,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:36:00,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:00,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:36:00,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:00,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:36:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:00,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 15:36:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:00,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-17 15:36:00,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:00,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-17 15:36:00,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:00,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:36:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:00,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-17 15:36:00,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:00,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:36:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:00,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-12-17 15:36:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:00,665 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-12-17 15:36:00,666 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:36:00,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790425550] [2021-12-17 15:36:00,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790425550] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:36:00,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034505264] [2021-12-17 15:36:00,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:36:00,666 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:36:00,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:36:00,667 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) [2021-12-17 15:36:00,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-17 15:36:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:00,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 15:36:00,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:36:01,029 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-17 15:36:01,029 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:36:01,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034505264] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:36:01,029 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:36:01,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2021-12-17 15:36:01,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158193586] [2021-12-17 15:36:01,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:36:01,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 15:36:01,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:36:01,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 15:36:01,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 15:36:01,031 INFO L87 Difference]: Start difference. First operand 5617 states and 8064 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-17 15:36:01,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:36:01,370 INFO L93 Difference]: Finished difference Result 16615 states and 24046 transitions. [2021-12-17 15:36:01,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 15:36:01,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 142 [2021-12-17 15:36:01,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:36:01,413 INFO L225 Difference]: With dead ends: 16615 [2021-12-17 15:36:01,413 INFO L226 Difference]: Without dead ends: 11009 [2021-12-17 15:36:01,426 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 15:36:01,427 INFO L933 BasicCegarLoop]: 223 mSDtfsCounter, 109 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 393 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 [2021-12-17 15:36:01,428 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 393 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:36:01,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11009 states. [2021-12-17 15:36:01,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11009 to 10897. [2021-12-17 15:36:01,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10897 states, 9140 states have (on average 1.4321663019693653) internal successors, (13090), 9274 states have internal predecessors, (13090), 1025 states have call successors, (1025), 636 states have call predecessors, (1025), 731 states have return successors, (1457), 994 states have call predecessors, (1457), 1023 states have call successors, (1457) [2021-12-17 15:36:01,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10897 states to 10897 states and 15572 transitions. [2021-12-17 15:36:01,854 INFO L78 Accepts]: Start accepts. Automaton has 10897 states and 15572 transitions. Word has length 142 [2021-12-17 15:36:01,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:36:01,855 INFO L470 AbstractCegarLoop]: Abstraction has 10897 states and 15572 transitions. [2021-12-17 15:36:01,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-17 15:36:01,855 INFO L276 IsEmpty]: Start isEmpty. Operand 10897 states and 15572 transitions. [2021-12-17 15:36:01,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-12-17 15:36:01,874 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:36:01,874 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:36:01,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-17 15:36:02,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:36:02,087 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:36:02,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:36:02,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1687241086, now seen corresponding path program 1 times [2021-12-17 15:36:02,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:36:02,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367860176] [2021-12-17 15:36:02,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:36:02,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:36:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:02,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:36:02,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:02,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:36:02,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:02,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:36:02,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:02,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 15:36:02,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:02,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-17 15:36:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:02,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-17 15:36:02,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:02,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-17 15:36:02,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:02,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:36:02,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:02,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-12-17 15:36:02,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:02,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:36:02,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:02,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2021-12-17 15:36:02,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:02,165 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-12-17 15:36:02,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:36:02,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367860176] [2021-12-17 15:36:02,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367860176] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:36:02,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524932199] [2021-12-17 15:36:02,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:36:02,166 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:36:02,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:36:02,167 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) [2021-12-17 15:36:02,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-17 15:36:02,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:02,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 15:36:02,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:36:02,451 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-17 15:36:02,451 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:36:02,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524932199] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:36:02,452 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:36:02,452 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-17 15:36:02,452 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042622825] [2021-12-17 15:36:02,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:36:02,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 15:36:02,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:36:02,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 15:36:02,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 15:36:02,462 INFO L87 Difference]: Start difference. First operand 10897 states and 15572 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-17 15:36:02,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:36:02,836 INFO L93 Difference]: Finished difference Result 23068 states and 33456 transitions. [2021-12-17 15:36:02,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 15:36:02,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 159 [2021-12-17 15:36:02,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:36:02,885 INFO L225 Difference]: With dead ends: 23068 [2021-12-17 15:36:02,885 INFO L226 Difference]: Without dead ends: 12181 [2021-12-17 15:36:02,919 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 15:36:02,920 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 127 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:36:02,920 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 223 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:36:02,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12181 states. [2021-12-17 15:36:03,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12181 to 12181. [2021-12-17 15:36:03,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12181 states, 10288 states have (on average 1.3769440124416796) internal successors, (14166), 10422 states have internal predecessors, (14166), 1066 states have call successors, (1066), 731 states have call predecessors, (1066), 826 states have return successors, (1503), 1035 states have call predecessors, (1503), 1064 states have call successors, (1503) [2021-12-17 15:36:03,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12181 states to 12181 states and 16735 transitions. [2021-12-17 15:36:03,414 INFO L78 Accepts]: Start accepts. Automaton has 12181 states and 16735 transitions. Word has length 159 [2021-12-17 15:36:03,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:36:03,414 INFO L470 AbstractCegarLoop]: Abstraction has 12181 states and 16735 transitions. [2021-12-17 15:36:03,415 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-17 15:36:03,415 INFO L276 IsEmpty]: Start isEmpty. Operand 12181 states and 16735 transitions. [2021-12-17 15:36:03,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-12-17 15:36:03,436 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:36:03,436 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:36:03,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-17 15:36:03,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:36:03,651 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:36:03,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:36:03,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1840869217, now seen corresponding path program 1 times [2021-12-17 15:36:03,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:36:03,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885521914] [2021-12-17 15:36:03,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:36:03,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:36:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:03,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:36:03,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:03,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:36:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:03,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:36:03,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:03,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 15:36:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:03,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-17 15:36:03,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:03,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-17 15:36:03,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:03,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-17 15:36:03,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:03,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:36:03,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:03,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-12-17 15:36:03,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:03,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:36:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:03,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2021-12-17 15:36:03,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:03,732 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-12-17 15:36:03,733 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:36:03,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885521914] [2021-12-17 15:36:03,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885521914] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:36:03,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49603618] [2021-12-17 15:36:03,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:36:03,733 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:36:03,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:36:03,734 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) [2021-12-17 15:36:03,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-17 15:36:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:03,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 15:36:03,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:36:04,010 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-12-17 15:36:04,011 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:36:04,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49603618] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:36:04,011 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:36:04,011 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-17 15:36:04,011 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459327168] [2021-12-17 15:36:04,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:36:04,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 15:36:04,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:36:04,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 15:36:04,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 15:36:04,013 INFO L87 Difference]: Start difference. First operand 12181 states and 16735 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-17 15:36:04,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:36:04,373 INFO L93 Difference]: Finished difference Result 25954 states and 35537 transitions. [2021-12-17 15:36:04,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 15:36:04,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 159 [2021-12-17 15:36:04,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:36:04,412 INFO L225 Difference]: With dead ends: 25954 [2021-12-17 15:36:04,412 INFO L226 Difference]: Without dead ends: 13785 [2021-12-17 15:36:04,435 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 15:36:04,435 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 129 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:36:04,436 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 372 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:36:04,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13785 states. [2021-12-17 15:36:04,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13785 to 13645. [2021-12-17 15:36:04,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13645 states, 11640 states have (on average 1.3424398625429552) internal successors, (15626), 11774 states have internal predecessors, (15626), 1086 states have call successors, (1086), 823 states have call predecessors, (1086), 918 states have return successors, (1615), 1055 states have call predecessors, (1615), 1084 states have call successors, (1615) [2021-12-17 15:36:04,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13645 states to 13645 states and 18327 transitions. [2021-12-17 15:36:04,959 INFO L78 Accepts]: Start accepts. Automaton has 13645 states and 18327 transitions. Word has length 159 [2021-12-17 15:36:04,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:36:04,959 INFO L470 AbstractCegarLoop]: Abstraction has 13645 states and 18327 transitions. [2021-12-17 15:36:04,959 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-17 15:36:04,960 INFO L276 IsEmpty]: Start isEmpty. Operand 13645 states and 18327 transitions. [2021-12-17 15:36:04,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-12-17 15:36:04,981 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:36:04,981 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:36:05,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-17 15:36:05,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-17 15:36:05,201 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:36:05,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:36:05,202 INFO L85 PathProgramCache]: Analyzing trace with hash 740866845, now seen corresponding path program 1 times [2021-12-17 15:36:05,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:36:05,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623239408] [2021-12-17 15:36:05,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:36:05,202 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:36:05,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:05,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:36:05,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:05,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:36:05,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:05,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:36:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:05,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 15:36:05,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:05,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-17 15:36:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:05,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-17 15:36:05,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:05,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:36:05,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:05,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-17 15:36:05,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:05,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-12-17 15:36:05,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:05,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:36:05,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:05,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-17 15:36:05,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:05,302 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-12-17 15:36:05,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:36:05,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623239408] [2021-12-17 15:36:05,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623239408] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:36:05,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959669979] [2021-12-17 15:36:05,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:36:05,303 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:36:05,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:36:05,304 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) [2021-12-17 15:36:05,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-17 15:36:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:05,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 15:36:05,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:36:05,522 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-17 15:36:05,523 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:36:05,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959669979] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:36:05,523 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:36:05,523 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-17 15:36:05,524 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916175628] [2021-12-17 15:36:05,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:36:05,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 15:36:05,524 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:36:05,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 15:36:05,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 15:36:05,525 INFO L87 Difference]: Start difference. First operand 13645 states and 18327 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-17 15:36:06,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:36:06,168 INFO L93 Difference]: Finished difference Result 40290 states and 54630 transitions. [2021-12-17 15:36:06,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 15:36:06,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 160 [2021-12-17 15:36:06,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:36:06,268 INFO L225 Difference]: With dead ends: 40290 [2021-12-17 15:36:06,268 INFO L226 Difference]: Without dead ends: 26657 [2021-12-17 15:36:06,305 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 15:36:06,305 INFO L933 BasicCegarLoop]: 359 mSDtfsCounter, 162 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:36:06,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 546 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:36:06,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26657 states. [2021-12-17 15:36:07,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26657 to 26613. [2021-12-17 15:36:07,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26613 states, 22697 states have (on average 1.3329514913865268) internal successors, (30254), 22964 states have internal predecessors, (30254), 2109 states have call successors, (2109), 1615 states have call predecessors, (2109), 1806 states have return successors, (3670), 2049 states have call predecessors, (3670), 2107 states have call successors, (3670) [2021-12-17 15:36:07,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26613 states to 26613 states and 36033 transitions. [2021-12-17 15:36:07,205 INFO L78 Accepts]: Start accepts. Automaton has 26613 states and 36033 transitions. Word has length 160 [2021-12-17 15:36:07,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:36:07,205 INFO L470 AbstractCegarLoop]: Abstraction has 26613 states and 36033 transitions. [2021-12-17 15:36:07,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-17 15:36:07,206 INFO L276 IsEmpty]: Start isEmpty. Operand 26613 states and 36033 transitions. [2021-12-17 15:36:07,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-12-17 15:36:07,249 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:36:07,249 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 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] [2021-12-17 15:36:07,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-17 15:36:07,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:36:07,463 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:36:07,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:36:07,464 INFO L85 PathProgramCache]: Analyzing trace with hash 2091960737, now seen corresponding path program 1 times [2021-12-17 15:36:07,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:36:07,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714312514] [2021-12-17 15:36:07,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:36:07,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:36:07,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:07,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:36:07,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:07,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:36:07,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:07,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:36:07,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:07,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 15:36:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:07,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-17 15:36:07,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:07,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-17 15:36:07,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:07,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:36:07,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:07,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-17 15:36:07,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:07,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-17 15:36:07,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:07,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:36:07,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:07,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-17 15:36:07,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:07,543 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-12-17 15:36:07,543 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:36:07,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714312514] [2021-12-17 15:36:07,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714312514] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:36:07,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774258765] [2021-12-17 15:36:07,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:36:07,543 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:36:07,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:36:07,544 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) [2021-12-17 15:36:07,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-17 15:36:07,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:07,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 15:36:07,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:36:07,938 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-12-17 15:36:07,938 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:36:07,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774258765] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:36:07,938 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:36:07,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-17 15:36:07,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815635439] [2021-12-17 15:36:07,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:36:07,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 15:36:07,939 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:36:07,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 15:36:07,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 15:36:07,939 INFO L87 Difference]: Start difference. First operand 26613 states and 36033 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-17 15:36:08,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:36:08,466 INFO L93 Difference]: Finished difference Result 44690 states and 61709 transitions. [2021-12-17 15:36:08,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 15:36:08,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 160 [2021-12-17 15:36:08,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:36:08,537 INFO L225 Difference]: With dead ends: 44690 [2021-12-17 15:36:08,538 INFO L226 Difference]: Without dead ends: 23106 [2021-12-17 15:36:08,582 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 15:36:08,583 INFO L933 BasicCegarLoop]: 188 mSDtfsCounter, 122 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:36:08,583 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 221 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:36:08,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23106 states. [2021-12-17 15:36:09,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23106 to 16842. [2021-12-17 15:36:09,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16842 states, 14392 states have (on average 1.29565036131184) internal successors, (18647), 14535 states have internal predecessors, (18647), 1325 states have call successors, (1325), 1029 states have call predecessors, (1325), 1124 states have return successors, (2074), 1285 states have call predecessors, (2074), 1323 states have call successors, (2074) [2021-12-17 15:36:09,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16842 states to 16842 states and 22046 transitions. [2021-12-17 15:36:09,521 INFO L78 Accepts]: Start accepts. Automaton has 16842 states and 22046 transitions. Word has length 160 [2021-12-17 15:36:09,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:36:09,522 INFO L470 AbstractCegarLoop]: Abstraction has 16842 states and 22046 transitions. [2021-12-17 15:36:09,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-17 15:36:09,522 INFO L276 IsEmpty]: Start isEmpty. Operand 16842 states and 22046 transitions. [2021-12-17 15:36:09,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-12-17 15:36:09,546 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:36:09,546 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:36:09,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-17 15:36:09,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:36:09,759 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:36:09,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:36:09,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1447536284, now seen corresponding path program 1 times [2021-12-17 15:36:09,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:36:09,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399502320] [2021-12-17 15:36:09,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:36:09,760 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:36:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:09,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:36:09,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:09,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:36:09,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:09,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:36:09,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:09,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 15:36:09,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:09,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-17 15:36:09,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:09,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-17 15:36:09,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:09,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:36:09,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:09,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-17 15:36:09,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:09,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-17 15:36:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:09,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:36:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:09,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-17 15:36:09,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:09,850 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-12-17 15:36:09,850 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:36:09,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399502320] [2021-12-17 15:36:09,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399502320] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:36:09,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948389345] [2021-12-17 15:36:09,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:36:09,851 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:36:09,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:36:09,852 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) [2021-12-17 15:36:09,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-17 15:36:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:09,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 15:36:09,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:36:10,093 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-17 15:36:10,093 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:36:10,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948389345] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:36:10,094 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:36:10,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-17 15:36:10,094 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092408675] [2021-12-17 15:36:10,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:36:10,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 15:36:10,095 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:36:10,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 15:36:10,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 15:36:10,095 INFO L87 Difference]: Start difference. First operand 16842 states and 22046 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-17 15:36:10,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:36:10,903 INFO L93 Difference]: Finished difference Result 48050 states and 63690 transitions. [2021-12-17 15:36:10,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 15:36:10,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 160 [2021-12-17 15:36:10,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:36:11,002 INFO L225 Difference]: With dead ends: 48050 [2021-12-17 15:36:11,003 INFO L226 Difference]: Without dead ends: 31225 [2021-12-17 15:36:11,043 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 15:36:11,044 INFO L933 BasicCegarLoop]: 353 mSDtfsCounter, 149 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:36:11,045 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 537 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:36:11,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31225 states. [2021-12-17 15:36:12,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31225 to 31221. [2021-12-17 15:36:12,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31221 states, 26589 states have (on average 1.2854187822031666) internal successors, (34178), 26874 states have internal predecessors, (34178), 2515 states have call successors, (2515), 1925 states have call predecessors, (2515), 2116 states have return successors, (4674), 2437 states have call predecessors, (4674), 2513 states have call successors, (4674) [2021-12-17 15:36:12,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31221 states to 31221 states and 41367 transitions. [2021-12-17 15:36:12,287 INFO L78 Accepts]: Start accepts. Automaton has 31221 states and 41367 transitions. Word has length 160 [2021-12-17 15:36:12,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:36:12,287 INFO L470 AbstractCegarLoop]: Abstraction has 31221 states and 41367 transitions. [2021-12-17 15:36:12,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-17 15:36:12,287 INFO L276 IsEmpty]: Start isEmpty. Operand 31221 states and 41367 transitions. [2021-12-17 15:36:12,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-12-17 15:36:12,317 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:36:12,318 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:36:12,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-17 15:36:12,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-17 15:36:12,536 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:36:12,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:36:12,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1243097865, now seen corresponding path program 1 times [2021-12-17 15:36:12,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:36:12,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970635649] [2021-12-17 15:36:12,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:36:12,537 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:36:12,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:12,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:36:12,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:12,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:36:12,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:12,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:36:12,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:12,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 15:36:12,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:12,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-17 15:36:12,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:12,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-17 15:36:12,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:12,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-17 15:36:12,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:12,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:36:12,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:12,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-12-17 15:36:12,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:12,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:36:12,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:12,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-17 15:36:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:12,622 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-12-17 15:36:12,622 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:36:12,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970635649] [2021-12-17 15:36:12,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970635649] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:36:12,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565954543] [2021-12-17 15:36:12,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:36:12,623 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:36:12,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:36:12,624 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) [2021-12-17 15:36:12,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-17 15:36:12,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:12,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 15:36:12,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:36:12,887 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-12-17 15:36:12,887 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:36:12,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565954543] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:36:12,887 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:36:12,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-17 15:36:12,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240730471] [2021-12-17 15:36:12,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:36:12,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 15:36:12,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:36:12,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 15:36:12,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 15:36:12,889 INFO L87 Difference]: Start difference. First operand 31221 states and 41367 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-17 15:36:13,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:36:13,761 INFO L93 Difference]: Finished difference Result 55760 states and 73889 transitions. [2021-12-17 15:36:13,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 15:36:13,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 160 [2021-12-17 15:36:13,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:36:13,855 INFO L225 Difference]: With dead ends: 55760 [2021-12-17 15:36:13,855 INFO L226 Difference]: Without dead ends: 31687 [2021-12-17 15:36:13,891 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 15:36:13,892 INFO L933 BasicCegarLoop]: 230 mSDtfsCounter, 148 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:36:13,892 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 400 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:36:13,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31687 states. [2021-12-17 15:36:15,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31687 to 31221. [2021-12-17 15:36:15,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31221 states, 26589 states have (on average 1.2787995035541013) internal successors, (34002), 26874 states have internal predecessors, (34002), 2515 states have call successors, (2515), 1925 states have call predecessors, (2515), 2116 states have return successors, (4674), 2437 states have call predecessors, (4674), 2513 states have call successors, (4674) [2021-12-17 15:36:15,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31221 states to 31221 states and 41191 transitions. [2021-12-17 15:36:15,197 INFO L78 Accepts]: Start accepts. Automaton has 31221 states and 41191 transitions. Word has length 160 [2021-12-17 15:36:15,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:36:15,197 INFO L470 AbstractCegarLoop]: Abstraction has 31221 states and 41191 transitions. [2021-12-17 15:36:15,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-17 15:36:15,198 INFO L276 IsEmpty]: Start isEmpty. Operand 31221 states and 41191 transitions. [2021-12-17 15:36:15,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-12-17 15:36:15,226 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:36:15,226 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:36:15,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-17 15:36:15,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-17 15:36:15,443 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:36:15,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:36:15,443 INFO L85 PathProgramCache]: Analyzing trace with hash -924686934, now seen corresponding path program 1 times [2021-12-17 15:36:15,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:36:15,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841861787] [2021-12-17 15:36:15,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:36:15,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:36:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:15,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:36:15,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:15,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:36:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:15,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:36:15,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:15,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 15:36:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:15,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-17 15:36:15,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:15,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-17 15:36:15,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:15,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-17 15:36:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:15,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:36:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:15,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-17 15:36:15,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:15,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:36:15,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:15,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-17 15:36:15,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:15,524 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-12-17 15:36:15,525 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:36:15,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841861787] [2021-12-17 15:36:15,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841861787] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:36:15,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785250056] [2021-12-17 15:36:15,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:36:15,525 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:36:15,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:36:15,526 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) [2021-12-17 15:36:15,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-17 15:36:15,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:15,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 15:36:15,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:36:15,785 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-12-17 15:36:15,785 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:36:15,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785250056] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:36:15,786 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:36:15,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-17 15:36:15,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531745510] [2021-12-17 15:36:15,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:36:15,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 15:36:15,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:36:15,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 15:36:15,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 15:36:15,787 INFO L87 Difference]: Start difference. First operand 31221 states and 41191 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-17 15:36:16,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:36:16,769 INFO L93 Difference]: Finished difference Result 55399 states and 73175 transitions. [2021-12-17 15:36:16,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 15:36:16,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 160 [2021-12-17 15:36:16,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:36:16,860 INFO L225 Difference]: With dead ends: 55399 [2021-12-17 15:36:16,860 INFO L226 Difference]: Without dead ends: 31991 [2021-12-17 15:36:16,898 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 15:36:16,899 INFO L933 BasicCegarLoop]: 241 mSDtfsCounter, 147 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:36:16,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 413 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:36:16,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31991 states. [2021-12-17 15:36:18,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31991 to 31177. [2021-12-17 15:36:18,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31177 states, 26545 states have (on average 1.2726313806743266) internal successors, (33782), 26830 states have internal predecessors, (33782), 2515 states have call successors, (2515), 1925 states have call predecessors, (2515), 2116 states have return successors, (4674), 2437 states have call predecessors, (4674), 2513 states have call successors, (4674) [2021-12-17 15:36:18,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31177 states to 31177 states and 40971 transitions. [2021-12-17 15:36:18,196 INFO L78 Accepts]: Start accepts. Automaton has 31177 states and 40971 transitions. Word has length 160 [2021-12-17 15:36:18,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:36:18,196 INFO L470 AbstractCegarLoop]: Abstraction has 31177 states and 40971 transitions. [2021-12-17 15:36:18,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-17 15:36:18,196 INFO L276 IsEmpty]: Start isEmpty. Operand 31177 states and 40971 transitions. [2021-12-17 15:36:18,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-12-17 15:36:18,222 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:36:18,223 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:36:18,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-17 15:36:18,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-17 15:36:18,433 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:36:18,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:36:18,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1962226697, now seen corresponding path program 1 times [2021-12-17 15:36:18,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:36:18,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794193735] [2021-12-17 15:36:18,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:36:18,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:36:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:18,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:36:18,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:18,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:36:18,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:18,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:36:18,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:18,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 15:36:18,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:18,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-17 15:36:18,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:18,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-17 15:36:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:18,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-17 15:36:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:18,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:36:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:18,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-12-17 15:36:18,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:18,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:36:18,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:18,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-17 15:36:18,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:18,481 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2021-12-17 15:36:18,481 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:36:18,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794193735] [2021-12-17 15:36:18,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794193735] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:36:18,481 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:36:18,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 15:36:18,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203752954] [2021-12-17 15:36:18,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:36:18,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 15:36:18,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:36:18,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 15:36:18,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:36:18,483 INFO L87 Difference]: Start difference. First operand 31177 states and 40971 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-17 15:36:19,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:36:19,557 INFO L93 Difference]: Finished difference Result 61460 states and 79972 transitions. [2021-12-17 15:36:19,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 15:36:19,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 160 [2021-12-17 15:36:19,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:36:19,640 INFO L225 Difference]: With dead ends: 61460 [2021-12-17 15:36:19,640 INFO L226 Difference]: Without dead ends: 30298 [2021-12-17 15:36:19,687 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-17 15:36:19,688 INFO L933 BasicCegarLoop]: 188 mSDtfsCounter, 293 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 15:36:19,688 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [309 Valid, 339 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 15:36:19,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30298 states. [2021-12-17 15:36:20,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30298 to 28260. [2021-12-17 15:36:20,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28260 states, 24232 states have (on average 1.272160779135028) internal successors, (30827), 24778 states have internal predecessors, (30827), 1917 states have call successors, (1917), 1477 states have call predecessors, (1917), 2110 states have return successors, (3890), 2012 states have call predecessors, (3890), 1915 states have call successors, (3890) [2021-12-17 15:36:21,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28260 states to 28260 states and 36634 transitions. [2021-12-17 15:36:21,013 INFO L78 Accepts]: Start accepts. Automaton has 28260 states and 36634 transitions. Word has length 160 [2021-12-17 15:36:21,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:36:21,014 INFO L470 AbstractCegarLoop]: Abstraction has 28260 states and 36634 transitions. [2021-12-17 15:36:21,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-17 15:36:21,014 INFO L276 IsEmpty]: Start isEmpty. Operand 28260 states and 36634 transitions. [2021-12-17 15:36:21,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-12-17 15:36:21,035 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:36:21,035 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:36:21,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-17 15:36:21,035 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:36:21,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:36:21,035 INFO L85 PathProgramCache]: Analyzing trace with hash -32521304, now seen corresponding path program 1 times [2021-12-17 15:36:21,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:36:21,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749643863] [2021-12-17 15:36:21,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:36:21,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:36:21,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:21,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:36:21,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:21,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:36:21,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:21,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:36:21,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:21,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 15:36:21,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:21,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-17 15:36:21,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:21,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-17 15:36:21,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:21,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-17 15:36:21,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:21,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:36:21,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:21,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-17 15:36:21,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:21,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:36:21,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:21,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-17 15:36:21,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:21,134 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-12-17 15:36:21,134 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:36:21,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749643863] [2021-12-17 15:36:21,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749643863] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:36:21,134 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:36:21,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 15:36:21,134 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809887815] [2021-12-17 15:36:21,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:36:21,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 15:36:21,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:36:21,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 15:36:21,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:36:21,136 INFO L87 Difference]: Start difference. First operand 28260 states and 36634 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-17 15:36:22,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:36:22,221 INFO L93 Difference]: Finished difference Result 51225 states and 66209 transitions. [2021-12-17 15:36:22,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 15:36:22,222 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 160 [2021-12-17 15:36:22,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:36:22,277 INFO L225 Difference]: With dead ends: 51225 [2021-12-17 15:36:22,278 INFO L226 Difference]: Without dead ends: 22976 [2021-12-17 15:36:22,316 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-17 15:36:22,316 INFO L933 BasicCegarLoop]: 187 mSDtfsCounter, 293 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 15:36:22,317 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [309 Valid, 337 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 15:36:22,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22976 states. [2021-12-17 15:36:23,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22976 to 21022. [2021-12-17 15:36:23,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21022 states, 18068 states have (on average 1.2825990701793226) internal successors, (23174), 18451 states have internal predecessors, (23174), 1419 states have call successors, (1419), 1099 states have call predecessors, (1419), 1534 states have return successors, (2698), 1475 states have call predecessors, (2698), 1417 states have call successors, (2698) [2021-12-17 15:36:23,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21022 states to 21022 states and 27291 transitions. [2021-12-17 15:36:23,205 INFO L78 Accepts]: Start accepts. Automaton has 21022 states and 27291 transitions. Word has length 160 [2021-12-17 15:36:23,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:36:23,205 INFO L470 AbstractCegarLoop]: Abstraction has 21022 states and 27291 transitions. [2021-12-17 15:36:23,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-17 15:36:23,206 INFO L276 IsEmpty]: Start isEmpty. Operand 21022 states and 27291 transitions. [2021-12-17 15:36:23,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-12-17 15:36:23,219 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:36:23,220 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:36:23,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-17 15:36:23,220 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:36:23,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:36:23,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1152046593, now seen corresponding path program 1 times [2021-12-17 15:36:23,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:36:23,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749451193] [2021-12-17 15:36:23,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:36:23,221 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:36:23,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:23,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:36:23,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:23,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:36:23,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:23,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:36:23,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:23,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 15:36:23,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:23,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-17 15:36:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:23,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-17 15:36:23,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:23,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-17 15:36:23,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:23,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:36:23,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:23,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-17 15:36:23,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:23,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:36:23,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:23,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-12-17 15:36:23,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:23,300 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-12-17 15:36:23,300 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:36:23,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749451193] [2021-12-17 15:36:23,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749451193] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:36:23,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867156712] [2021-12-17 15:36:23,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:36:23,300 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:36:23,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:36:23,301 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) [2021-12-17 15:36:23,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-17 15:36:23,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:23,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 15:36:23,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:36:23,564 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-17 15:36:23,564 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:36:23,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867156712] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:36:23,565 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:36:23,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-17 15:36:23,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658057121] [2021-12-17 15:36:23,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:36:23,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 15:36:23,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:36:23,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 15:36:23,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 15:36:23,566 INFO L87 Difference]: Start difference. First operand 21022 states and 27291 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-17 15:36:24,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:36:24,209 INFO L93 Difference]: Finished difference Result 35163 states and 47045 transitions. [2021-12-17 15:36:24,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 15:36:24,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 162 [2021-12-17 15:36:24,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:36:24,260 INFO L225 Difference]: With dead ends: 35163 [2021-12-17 15:36:24,260 INFO L226 Difference]: Without dead ends: 21116 [2021-12-17 15:36:24,289 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 15:36:24,289 INFO L933 BasicCegarLoop]: 318 mSDtfsCounter, 141 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:36:24,289 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 485 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:36:24,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21116 states. [2021-12-17 15:36:25,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21116 to 21022. [2021-12-17 15:36:25,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21022 states, 18068 states have (on average 1.259907017932256) internal successors, (22764), 18451 states have internal predecessors, (22764), 1419 states have call successors, (1419), 1099 states have call predecessors, (1419), 1534 states have return successors, (2698), 1475 states have call predecessors, (2698), 1417 states have call successors, (2698) [2021-12-17 15:36:25,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21022 states to 21022 states and 26881 transitions. [2021-12-17 15:36:25,190 INFO L78 Accepts]: Start accepts. Automaton has 21022 states and 26881 transitions. Word has length 162 [2021-12-17 15:36:25,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:36:25,191 INFO L470 AbstractCegarLoop]: Abstraction has 21022 states and 26881 transitions. [2021-12-17 15:36:25,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-17 15:36:25,191 INFO L276 IsEmpty]: Start isEmpty. Operand 21022 states and 26881 transitions. [2021-12-17 15:36:25,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-12-17 15:36:25,206 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:36:25,206 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:36:25,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-17 15:36:25,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:36:25,411 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:36:25,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:36:25,411 INFO L85 PathProgramCache]: Analyzing trace with hash 179847711, now seen corresponding path program 1 times [2021-12-17 15:36:25,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:36:25,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876970119] [2021-12-17 15:36:25,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:36:25,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:36:25,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:25,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:36:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:25,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:36:25,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:25,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:36:25,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:25,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 15:36:25,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:25,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-17 15:36:25,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:25,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-17 15:36:25,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:25,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-17 15:36:25,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:25,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:36:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:25,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-17 15:36:25,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:25,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:36:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:25,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-12-17 15:36:25,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:25,505 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-12-17 15:36:25,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:36:25,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876970119] [2021-12-17 15:36:25,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876970119] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:36:25,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868140918] [2021-12-17 15:36:25,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:36:25,506 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:36:25,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:36:25,507 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) [2021-12-17 15:36:25,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-17 15:36:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:25,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 15:36:25,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:36:25,756 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-17 15:36:25,756 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:36:25,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868140918] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:36:25,756 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:36:25,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-17 15:36:25,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641043454] [2021-12-17 15:36:25,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:36:25,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 15:36:25,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:36:25,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 15:36:25,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 15:36:25,758 INFO L87 Difference]: Start difference. First operand 21022 states and 26881 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-17 15:36:26,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:36:26,582 INFO L93 Difference]: Finished difference Result 43500 states and 56494 transitions. [2021-12-17 15:36:26,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 15:36:26,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 162 [2021-12-17 15:36:26,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:36:26,631 INFO L225 Difference]: With dead ends: 43500 [2021-12-17 15:36:26,631 INFO L226 Difference]: Without dead ends: 22490 [2021-12-17 15:36:26,663 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 15:36:26,663 INFO L933 BasicCegarLoop]: 188 mSDtfsCounter, 163 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:36:26,664 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 220 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:36:26,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22490 states. [2021-12-17 15:36:27,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22490 to 21115. [2021-12-17 15:36:27,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21115 states, 18183 states have (on average 1.2302700324478908) internal successors, (22370), 18544 states have internal predecessors, (22370), 1419 states have call successors, (1419), 1099 states have call predecessors, (1419), 1512 states have return successors, (2503), 1475 states have call predecessors, (2503), 1417 states have call successors, (2503) [2021-12-17 15:36:27,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21115 states to 21115 states and 26292 transitions. [2021-12-17 15:36:27,511 INFO L78 Accepts]: Start accepts. Automaton has 21115 states and 26292 transitions. Word has length 162 [2021-12-17 15:36:27,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:36:27,511 INFO L470 AbstractCegarLoop]: Abstraction has 21115 states and 26292 transitions. [2021-12-17 15:36:27,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-17 15:36:27,512 INFO L276 IsEmpty]: Start isEmpty. Operand 21115 states and 26292 transitions. [2021-12-17 15:36:27,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-12-17 15:36:27,524 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:36:27,525 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:36:27,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-17 15:36:27,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-12-17 15:36:27,728 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:36:27,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:36:27,728 INFO L85 PathProgramCache]: Analyzing trace with hash -841833728, now seen corresponding path program 1 times [2021-12-17 15:36:27,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:36:27,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795288701] [2021-12-17 15:36:27,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:36:27,729 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:36:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:27,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:36:27,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:27,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:36:27,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:27,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:36:27,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:27,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 15:36:27,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:27,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-17 15:36:27,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:27,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-17 15:36:27,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:27,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-17 15:36:27,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:27,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:36:27,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:27,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-12-17 15:36:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:27,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:36:27,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:27,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-12-17 15:36:27,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:27,802 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-12-17 15:36:27,802 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:36:27,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795288701] [2021-12-17 15:36:27,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795288701] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:36:27,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550421257] [2021-12-17 15:36:27,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:36:27,803 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:36:27,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:36:27,804 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:36:27,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-17 15:36:27,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:27,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 15:36:27,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:36:28,035 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-17 15:36:28,035 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:36:28,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550421257] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:36:28,036 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:36:28,036 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-17 15:36:28,036 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751097602] [2021-12-17 15:36:28,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:36:28,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 15:36:28,036 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:36:28,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 15:36:28,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 15:36:28,037 INFO L87 Difference]: Start difference. First operand 21115 states and 26292 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, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-17 15:36:28,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:36:28,723 INFO L93 Difference]: Finished difference Result 36225 states and 46301 transitions. [2021-12-17 15:36:28,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 15:36:28,725 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, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 162 [2021-12-17 15:36:28,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:36:28,765 INFO L225 Difference]: With dead ends: 36225 [2021-12-17 15:36:28,766 INFO L226 Difference]: Without dead ends: 21215 [2021-12-17 15:36:28,785 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 15:36:28,786 INFO L933 BasicCegarLoop]: 336 mSDtfsCounter, 135 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:36:28,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 503 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:36:28,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21215 states. [2021-12-17 15:36:29,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21215 to 21115. [2021-12-17 15:36:29,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21115 states, 18183 states have (on average 1.2032667876588021) internal successors, (21879), 18544 states have internal predecessors, (21879), 1419 states have call successors, (1419), 1099 states have call predecessors, (1419), 1512 states have return successors, (2503), 1475 states have call predecessors, (2503), 1417 states have call successors, (2503) [2021-12-17 15:36:29,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21115 states to 21115 states and 25801 transitions. [2021-12-17 15:36:29,499 INFO L78 Accepts]: Start accepts. Automaton has 21115 states and 25801 transitions. Word has length 162 [2021-12-17 15:36:29,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:36:29,499 INFO L470 AbstractCegarLoop]: Abstraction has 21115 states and 25801 transitions. [2021-12-17 15:36:29,499 INFO L471 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, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-17 15:36:29,499 INFO L276 IsEmpty]: Start isEmpty. Operand 21115 states and 25801 transitions. [2021-12-17 15:36:29,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-12-17 15:36:29,512 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:36:29,512 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:36:29,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-17 15:36:29,713 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-12-17 15:36:29,714 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:36:29,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:36:29,714 INFO L85 PathProgramCache]: Analyzing trace with hash -292288290, now seen corresponding path program 1 times [2021-12-17 15:36:29,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:36:29,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735170057] [2021-12-17 15:36:29,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:36:29,714 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:36:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:29,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:36:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:29,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:36:29,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:29,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:36:29,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:29,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 15:36:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:29,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-17 15:36:29,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:29,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-17 15:36:29,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:29,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-17 15:36:29,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:29,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:36:29,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:29,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-17 15:36:29,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:29,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:36:29,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:29,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-12-17 15:36:29,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:29,784 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-12-17 15:36:29,784 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:36:29,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735170057] [2021-12-17 15:36:29,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735170057] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:36:29,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123528448] [2021-12-17 15:36:29,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:36:29,785 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:36:29,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:36:29,786 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:36:29,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-17 15:36:29,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:29,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 15:36:29,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:36:30,074 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-17 15:36:30,075 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:36:30,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123528448] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:36:30,075 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:36:30,075 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-17 15:36:30,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309163281] [2021-12-17 15:36:30,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:36:30,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 15:36:30,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:36:30,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 15:36:30,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 15:36:30,076 INFO L87 Difference]: Start difference. First operand 21115 states and 25801 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-17 15:36:30,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:36:30,684 INFO L93 Difference]: Finished difference Result 34984 states and 43873 transitions. [2021-12-17 15:36:30,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 15:36:30,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 163 [2021-12-17 15:36:30,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:36:30,736 INFO L225 Difference]: With dead ends: 34984 [2021-12-17 15:36:30,736 INFO L226 Difference]: Without dead ends: 21163 [2021-12-17 15:36:30,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 15:36:30,772 INFO L933 BasicCegarLoop]: 310 mSDtfsCounter, 156 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:36:30,773 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 463 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:36:30,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21163 states. [2021-12-17 15:36:31,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21163 to 21115. [2021-12-17 15:36:31,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21115 states, 18183 states have (on average 1.1892976956497827) internal successors, (21625), 18544 states have internal predecessors, (21625), 1419 states have call successors, (1419), 1099 states have call predecessors, (1419), 1512 states have return successors, (2503), 1475 states have call predecessors, (2503), 1417 states have call successors, (2503) [2021-12-17 15:36:31,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21115 states to 21115 states and 25547 transitions. [2021-12-17 15:36:31,651 INFO L78 Accepts]: Start accepts. Automaton has 21115 states and 25547 transitions. Word has length 163 [2021-12-17 15:36:31,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:36:31,651 INFO L470 AbstractCegarLoop]: Abstraction has 21115 states and 25547 transitions. [2021-12-17 15:36:31,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-17 15:36:31,652 INFO L276 IsEmpty]: Start isEmpty. Operand 21115 states and 25547 transitions. [2021-12-17 15:36:31,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-12-17 15:36:31,664 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:36:31,664 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:36:31,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-17 15:36:31,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:36:31,865 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:36:31,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:36:31,866 INFO L85 PathProgramCache]: Analyzing trace with hash 327768535, now seen corresponding path program 1 times [2021-12-17 15:36:31,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:36:31,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032876124] [2021-12-17 15:36:31,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:36:31,866 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:36:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:31,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:36:31,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:31,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:36:31,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:31,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:36:31,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:31,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 15:36:31,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:31,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-17 15:36:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:31,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-17 15:36:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:31,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-17 15:36:31,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:31,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:36:31,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:31,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-17 15:36:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:31,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:36:31,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:31,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-12-17 15:36:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:31,958 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-12-17 15:36:31,958 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:36:31,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032876124] [2021-12-17 15:36:31,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032876124] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:36:31,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311762414] [2021-12-17 15:36:31,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:36:31,959 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:36:31,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:36:31,960 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:36:31,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-17 15:36:32,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:32,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-17 15:36:32,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:36:32,278 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-12-17 15:36:32,278 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:36:32,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311762414] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:36:32,279 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:36:32,279 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-17 15:36:32,279 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827830098] [2021-12-17 15:36:32,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:36:32,279 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 15:36:32,279 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:36:32,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 15:36:32,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-17 15:36:32,280 INFO L87 Difference]: Start difference. First operand 21115 states and 25547 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 15:36:33,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:36:33,016 INFO L93 Difference]: Finished difference Result 29400 states and 35806 transitions. [2021-12-17 15:36:33,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 15:36:33,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 164 [2021-12-17 15:36:33,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:36:33,054 INFO L225 Difference]: With dead ends: 29400 [2021-12-17 15:36:33,054 INFO L226 Difference]: Without dead ends: 16002 [2021-12-17 15:36:33,076 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-17 15:36:33,077 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 187 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 15:36:33,077 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 347 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 15:36:33,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16002 states. [2021-12-17 15:36:33,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16002 to 15912. [2021-12-17 15:36:33,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15912 states, 13716 states have (on average 1.17198891805191) internal successors, (16075), 13964 states have internal predecessors, (16075), 1077 states have call successors, (1077), 829 states have call predecessors, (1077), 1118 states have return successors, (1821), 1120 states have call predecessors, (1821), 1075 states have call successors, (1821) [2021-12-17 15:36:33,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15912 states to 15912 states and 18973 transitions. [2021-12-17 15:36:33,733 INFO L78 Accepts]: Start accepts. Automaton has 15912 states and 18973 transitions. Word has length 164 [2021-12-17 15:36:33,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:36:33,733 INFO L470 AbstractCegarLoop]: Abstraction has 15912 states and 18973 transitions. [2021-12-17 15:36:33,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 15:36:33,734 INFO L276 IsEmpty]: Start isEmpty. Operand 15912 states and 18973 transitions. [2021-12-17 15:36:33,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-12-17 15:36:33,740 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:36:33,740 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:36:33,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-12-17 15:36:33,941 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:36:33,941 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:36:33,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:36:33,942 INFO L85 PathProgramCache]: Analyzing trace with hash 815815641, now seen corresponding path program 1 times [2021-12-17 15:36:33,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:36:33,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258315414] [2021-12-17 15:36:33,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:36:33,942 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:36:33,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:33,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:36:33,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:33,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:36:33,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:33,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:36:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:34,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 15:36:34,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:34,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-17 15:36:34,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:34,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-17 15:36:34,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:34,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-17 15:36:34,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:34,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:36:34,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:34,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-17 15:36:34,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:34,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:36:34,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:34,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-12-17 15:36:34,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:34,029 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-12-17 15:36:34,030 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:36:34,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258315414] [2021-12-17 15:36:34,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258315414] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:36:34,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699412721] [2021-12-17 15:36:34,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:36:34,030 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:36:34,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:36:34,031 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:36:34,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-17 15:36:34,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:34,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-17 15:36:34,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:36:34,261 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2021-12-17 15:36:34,261 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:36:34,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699412721] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:36:34,261 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:36:34,261 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-17 15:36:34,261 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639796423] [2021-12-17 15:36:34,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:36:34,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 15:36:34,262 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:36:34,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 15:36:34,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 15:36:34,262 INFO L87 Difference]: Start difference. First operand 15912 states and 18973 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 15:36:34,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:36:34,796 INFO L93 Difference]: Finished difference Result 29801 states and 36019 transitions. [2021-12-17 15:36:34,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 15:36:34,797 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 164 [2021-12-17 15:36:34,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:36:34,831 INFO L225 Difference]: With dead ends: 29801 [2021-12-17 15:36:34,831 INFO L226 Difference]: Without dead ends: 13900 [2021-12-17 15:36:34,858 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 184 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-17 15:36:34,859 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 87 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:36:34,859 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 736 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:36:34,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13900 states. [2021-12-17 15:36:35,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13900 to 13328. [2021-12-17 15:36:35,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13328 states, 11381 states have (on average 1.1476144451278447) internal successors, (13061), 11591 states have internal predecessors, (13061), 958 states have call successors, (958), 737 states have call predecessors, (958), 988 states have return successors, (1535), 1001 states have call predecessors, (1535), 956 states have call successors, (1535) [2021-12-17 15:36:35,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13328 states to 13328 states and 15554 transitions. [2021-12-17 15:36:35,432 INFO L78 Accepts]: Start accepts. Automaton has 13328 states and 15554 transitions. Word has length 164 [2021-12-17 15:36:35,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:36:35,433 INFO L470 AbstractCegarLoop]: Abstraction has 13328 states and 15554 transitions. [2021-12-17 15:36:35,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 15:36:35,433 INFO L276 IsEmpty]: Start isEmpty. Operand 13328 states and 15554 transitions. [2021-12-17 15:36:35,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-12-17 15:36:35,438 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:36:35,438 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2021-12-17 15:36:35,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-12-17 15:36:35,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-12-17 15:36:35,639 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:36:35,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:36:35,639 INFO L85 PathProgramCache]: Analyzing trace with hash -950903894, now seen corresponding path program 1 times [2021-12-17 15:36:35,639 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:36:35,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731913383] [2021-12-17 15:36:35,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:36:35,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:36:35,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:35,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:36:35,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:35,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:36:35,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:35,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:36:35,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:35,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 15:36:35,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:35,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-17 15:36:35,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:35,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-17 15:36:35,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:35,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-17 15:36:35,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:35,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:36:35,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:35,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-17 15:36:35,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:35,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:36:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:35,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-12-17 15:36:35,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:35,717 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-12-17 15:36:35,717 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:36:35,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731913383] [2021-12-17 15:36:35,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731913383] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:36:35,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708177733] [2021-12-17 15:36:35,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:36:35,718 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:36:35,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:36:35,718 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:36:35,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-17 15:36:35,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:35,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-17 15:36:35,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:36:35,968 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2021-12-17 15:36:35,968 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:36:35,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708177733] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:36:35,968 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:36:35,968 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-17 15:36:35,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460965122] [2021-12-17 15:36:35,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:36:35,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 15:36:35,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:36:35,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 15:36:35,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 15:36:35,969 INFO L87 Difference]: Start difference. First operand 13328 states and 15554 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 15:36:36,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:36:36,384 INFO L93 Difference]: Finished difference Result 24593 states and 29078 transitions. [2021-12-17 15:36:36,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 15:36:36,385 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 164 [2021-12-17 15:36:36,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:36:36,407 INFO L225 Difference]: With dead ends: 24593 [2021-12-17 15:36:36,408 INFO L226 Difference]: Without dead ends: 11276 [2021-12-17 15:36:36,427 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 184 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-17 15:36:36,428 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 49 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:36:36,428 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 726 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:36:36,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11276 states. [2021-12-17 15:36:36,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11276 to 10980. [2021-12-17 15:36:36,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10980 states, 9342 states have (on average 1.1294155427103405) internal successors, (10551), 9502 states have internal predecessors, (10551), 815 states have call successors, (815), 621 states have call predecessors, (815), 822 states have return successors, (1201), 858 states have call predecessors, (1201), 813 states have call successors, (1201) [2021-12-17 15:36:36,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10980 states to 10980 states and 12567 transitions. [2021-12-17 15:36:36,842 INFO L78 Accepts]: Start accepts. Automaton has 10980 states and 12567 transitions. Word has length 164 [2021-12-17 15:36:36,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:36:36,843 INFO L470 AbstractCegarLoop]: Abstraction has 10980 states and 12567 transitions. [2021-12-17 15:36:36,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 15:36:36,843 INFO L276 IsEmpty]: Start isEmpty. Operand 10980 states and 12567 transitions. [2021-12-17 15:36:36,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-12-17 15:36:36,847 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:36:36,847 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2021-12-17 15:36:36,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-12-17 15:36:37,048 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-12-17 15:36:37,048 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:36:37,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:36:37,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1119292316, now seen corresponding path program 1 times [2021-12-17 15:36:37,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:36:37,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231871297] [2021-12-17 15:36:37,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:36:37,049 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:36:37,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:37,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:36:37,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:37,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:36:37,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:37,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:36:37,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:37,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 15:36:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:37,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-17 15:36:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:37,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-17 15:36:37,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:37,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-17 15:36:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:37,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:36:37,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:37,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-17 15:36:37,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:37,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:36:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:37,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-12-17 15:36:37,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:37,138 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2021-12-17 15:36:37,138 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:36:37,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231871297] [2021-12-17 15:36:37,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231871297] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:36:37,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033081875] [2021-12-17 15:36:37,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:36:37,141 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:36:37,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:36:37,142 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:36:37,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-17 15:36:37,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:37,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-17 15:36:37,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:36:37,386 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-12-17 15:36:37,386 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:36:37,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033081875] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:36:37,386 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:36:37,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-17 15:36:37,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144186787] [2021-12-17 15:36:37,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:36:37,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 15:36:37,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:36:37,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 15:36:37,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 15:36:37,387 INFO L87 Difference]: Start difference. First operand 10980 states and 12567 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 15:36:37,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:36:37,640 INFO L93 Difference]: Finished difference Result 16293 states and 18722 transitions. [2021-12-17 15:36:37,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 15:36:37,640 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 164 [2021-12-17 15:36:37,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:36:37,647 INFO L225 Difference]: With dead ends: 16293 [2021-12-17 15:36:37,647 INFO L226 Difference]: Without dead ends: 3288 [2021-12-17 15:36:37,659 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 184 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-17 15:36:37,660 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 10 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:36:37,660 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 711 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:36:37,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3288 states. [2021-12-17 15:36:37,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3288 to 3288. [2021-12-17 15:36:37,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3288 states, 2793 states have (on average 1.1016827783745078) internal successors, (3077), 2815 states have internal predecessors, (3077), 278 states have call successors, (278), 201 states have call predecessors, (278), 216 states have return successors, (301), 273 states have call predecessors, (301), 276 states have call successors, (301) [2021-12-17 15:36:37,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3288 states to 3288 states and 3656 transitions. [2021-12-17 15:36:37,777 INFO L78 Accepts]: Start accepts. Automaton has 3288 states and 3656 transitions. Word has length 164 [2021-12-17 15:36:37,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:36:37,777 INFO L470 AbstractCegarLoop]: Abstraction has 3288 states and 3656 transitions. [2021-12-17 15:36:37,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 15:36:37,777 INFO L276 IsEmpty]: Start isEmpty. Operand 3288 states and 3656 transitions. [2021-12-17 15:36:37,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2021-12-17 15:36:37,779 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:36:37,779 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2021-12-17 15:36:37,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-12-17 15:36:37,980 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-12-17 15:36:37,980 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:36:37,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:36:37,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1437280244, now seen corresponding path program 1 times [2021-12-17 15:36:37,981 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:36:37,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154889058] [2021-12-17 15:36:37,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:36:37,981 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:36:37,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:38,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:36:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:38,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:36:38,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:38,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:36:38,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:38,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 15:36:38,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:38,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-17 15:36:38,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:38,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-17 15:36:38,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:38,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-17 15:36:38,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:38,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:36:38,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:38,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-17 15:36:38,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:38,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:36:38,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:38,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-17 15:36:38,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:38,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:36:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:38,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2021-12-17 15:36:38,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:38,115 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-12-17 15:36:38,115 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:36:38,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154889058] [2021-12-17 15:36:38,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154889058] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:36:38,115 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:36:38,115 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 15:36:38,115 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531772377] [2021-12-17 15:36:38,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:36:38,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 15:36:38,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:36:38,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 15:36:38,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 15:36:38,117 INFO L87 Difference]: Start difference. First operand 3288 states and 3656 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2021-12-17 15:36:38,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:36:38,800 INFO L93 Difference]: Finished difference Result 3506 states and 3881 transitions. [2021-12-17 15:36:38,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-17 15:36:38,801 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 202 [2021-12-17 15:36:38,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:36:38,820 INFO L225 Difference]: With dead ends: 3506 [2021-12-17 15:36:38,820 INFO L226 Difference]: Without dead ends: 3503 [2021-12-17 15:36:38,821 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2021-12-17 15:36:38,821 INFO L933 BasicCegarLoop]: 326 mSDtfsCounter, 676 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 15:36:38,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [709 Valid, 901 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-17 15:36:38,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3503 states. [2021-12-17 15:36:38,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3503 to 3287. [2021-12-17 15:36:38,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3287 states, 2793 states have (on average 1.100250626566416) internal successors, (3073), 2814 states have internal predecessors, (3073), 277 states have call successors, (277), 201 states have call predecessors, (277), 216 states have return successors, (301), 273 states have call predecessors, (301), 276 states have call successors, (301) [2021-12-17 15:36:38,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3287 states to 3287 states and 3651 transitions. [2021-12-17 15:36:38,946 INFO L78 Accepts]: Start accepts. Automaton has 3287 states and 3651 transitions. Word has length 202 [2021-12-17 15:36:38,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:36:38,946 INFO L470 AbstractCegarLoop]: Abstraction has 3287 states and 3651 transitions. [2021-12-17 15:36:38,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2021-12-17 15:36:38,946 INFO L276 IsEmpty]: Start isEmpty. Operand 3287 states and 3651 transitions. [2021-12-17 15:36:38,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2021-12-17 15:36:38,948 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:36:38,949 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:36:38,949 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-17 15:36:38,949 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:36:38,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:36:38,949 INFO L85 PathProgramCache]: Analyzing trace with hash -611652260, now seen corresponding path program 1 times [2021-12-17 15:36:38,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:36:38,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766861473] [2021-12-17 15:36:38,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:36:38,949 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:36:38,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:38,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:36:38,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:38,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:36:38,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:38,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 15:36:38,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:38,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 15:36:38,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:38,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-17 15:36:38,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:38,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-17 15:36:38,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:38,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-17 15:36:38,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:38,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:36:38,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:38,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-17 15:36:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:38,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:36:38,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:39,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-17 15:36:39,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:39,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:36:39,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:39,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2021-12-17 15:36:39,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:36:39,007 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2021-12-17 15:36:39,007 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:36:39,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766861473] [2021-12-17 15:36:39,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766861473] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:36:39,007 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:36:39,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 15:36:39,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329116962] [2021-12-17 15:36:39,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:36:39,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 15:36:39,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:36:39,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 15:36:39,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:36:39,009 INFO L87 Difference]: Start difference. First operand 3287 states and 3651 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 3 states have internal predecessors, (100), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-17 15:36:39,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:36:39,354 INFO L93 Difference]: Finished difference Result 5330 states and 6022 transitions. [2021-12-17 15:36:39,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 15:36:39,354 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 3 states have internal predecessors, (100), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 206 [2021-12-17 15:36:39,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:36:39,364 INFO L225 Difference]: With dead ends: 5330 [2021-12-17 15:36:39,365 INFO L226 Difference]: Without dead ends: 3951 [2021-12-17 15:36:39,368 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-17 15:36:39,372 INFO L933 BasicCegarLoop]: 232 mSDtfsCounter, 195 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 15:36:39,372 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 584 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 15:36:39,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3951 states. [2021-12-17 15:36:39,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3951 to 3291. [2021-12-17 15:36:39,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3291 states, 2797 states have (on average 1.1001072577761888) internal successors, (3077), 2818 states have internal predecessors, (3077), 277 states have call successors, (277), 201 states have call predecessors, (277), 216 states have return successors, (301), 273 states have call predecessors, (301), 276 states have call successors, (301) [2021-12-17 15:36:39,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3291 states to 3291 states and 3655 transitions. [2021-12-17 15:36:39,505 INFO L78 Accepts]: Start accepts. Automaton has 3291 states and 3655 transitions. Word has length 206 [2021-12-17 15:36:39,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:36:39,505 INFO L470 AbstractCegarLoop]: Abstraction has 3291 states and 3655 transitions. [2021-12-17 15:36:39,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 3 states have internal predecessors, (100), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-17 15:36:39,505 INFO L276 IsEmpty]: Start isEmpty. Operand 3291 states and 3655 transitions. [2021-12-17 15:36:39,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2021-12-17 15:36:39,508 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:36:39,508 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:36:39,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-17 15:36:39,508 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:36:39,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:36:39,508 INFO L85 PathProgramCache]: Analyzing trace with hash -552168776, now seen corresponding path program 1 times [2021-12-17 15:36:39,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:36:39,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093321246] [2021-12-17 15:36:39,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:36:39,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:36:39,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 15:36:39,519 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-17 15:36:39,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 15:36:39,561 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-17 15:36:39,561 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-17 15:36:39,562 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 15:36:39,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-12-17 15:36:39,566 INFO L732 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, 1, 1, 1, 1] [2021-12-17 15:36:39,568 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 15:36:39,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 03:36:39 BoogieIcfgContainer [2021-12-17 15:36:39,640 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 15:36:39,640 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 15:36:39,640 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 15:36:39,640 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 15:36:39,641 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 03:35:53" (3/4) ... [2021-12-17 15:36:39,642 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-17 15:36:39,742 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-17 15:36:39,742 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 15:36:39,743 INFO L158 Benchmark]: Toolchain (without parser) took 46597.48ms. Allocated memory was 115.3MB in the beginning and 9.1GB in the end (delta: 9.0GB). Free memory was 82.7MB in the beginning and 7.3GB in the end (delta: -7.2GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2021-12-17 15:36:39,743 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 79.7MB. Free memory was 38.8MB in the beginning and 38.8MB in the end (delta: 35.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 15:36:39,743 INFO L158 Benchmark]: CACSL2BoogieTranslator took 314.68ms. Allocated memory is still 115.3MB. Free memory was 82.3MB in the beginning and 87.3MB in the end (delta: -4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-17 15:36:39,743 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.83ms. Allocated memory is still 115.3MB. Free memory was 87.3MB in the beginning and 84.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 15:36:39,745 INFO L158 Benchmark]: Boogie Preprocessor took 39.69ms. Allocated memory is still 115.3MB. Free memory was 84.9MB in the beginning and 83.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 15:36:39,746 INFO L158 Benchmark]: RCFGBuilder took 397.96ms. Allocated memory is still 115.3MB. Free memory was 83.2MB in the beginning and 65.2MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-12-17 15:36:39,748 INFO L158 Benchmark]: TraceAbstraction took 45690.21ms. Allocated memory was 115.3MB in the beginning and 9.1GB in the end (delta: 9.0GB). Free memory was 64.9MB in the beginning and 7.3GB in the end (delta: -7.2GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2021-12-17 15:36:39,749 INFO L158 Benchmark]: Witness Printer took 102.45ms. Allocated memory is still 9.1GB. Free memory was 7.3GB in the beginning and 7.3GB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-12-17 15:36:39,753 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 79.7MB. Free memory was 38.8MB in the beginning and 38.8MB in the end (delta: 35.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 314.68ms. Allocated memory is still 115.3MB. Free memory was 82.3MB in the beginning and 87.3MB in the end (delta: -4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.83ms. Allocated memory is still 115.3MB. Free memory was 87.3MB in the beginning and 84.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.69ms. Allocated memory is still 115.3MB. Free memory was 84.9MB in the beginning and 83.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 397.96ms. Allocated memory is still 115.3MB. Free memory was 83.2MB in the beginning and 65.2MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 45690.21ms. Allocated memory was 115.3MB in the beginning and 9.1GB in the end (delta: 9.0GB). Free memory was 64.9MB in the beginning and 7.3GB in the end (delta: -7.2GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. * Witness Printer took 102.45ms. Allocated memory is still 9.1GB. Free memory was 7.3GB in the beginning and 7.3GB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 20]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] int m_pc = 0; [L25] int t1_pc = 0; [L26] int t2_pc = 0; [L27] int m_st ; [L28] int t1_st ; [L29] int t2_st ; [L30] int m_i ; [L31] int t1_i ; [L32] int t2_i ; [L33] int M_E = 2; [L34] int T1_E = 2; [L35] int T2_E = 2; [L36] int E_M = 2; [L37] int E_1 = 2; [L38] int E_2 = 2; [L43] int token ; [L45] int local ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L610] int __retres1 ; [L614] CALL init_model() [L524] m_i = 1 [L525] t1_i = 1 [L526] t2_i = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L614] RET init_model() [L615] CALL start_simulation() [L551] int kernel_st ; [L552] int tmp ; [L553] int tmp___0 ; [L557] kernel_st = 0 VAL [E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L558] FCALL update_channels() VAL [E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L559] CALL init_threads() [L243] COND TRUE m_i == 1 [L244] m_st = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L248] COND TRUE t1_i == 1 [L249] t1_st = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L253] COND TRUE t2_i == 1 [L254] t2_st = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L559] RET init_threads() [L560] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L356] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L361] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L366] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L371] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L376] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L381] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L560] RET fire_delta_events() VAL [E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L561] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L429] int tmp ; [L430] int tmp___0 ; [L431] int tmp___1 ; [L435] CALL, EXPR is_master_triggered() [L175] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L178] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L188] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L190] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L435] RET, EXPR is_master_triggered() [L435] tmp = is_master_triggered() [L437] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, token=0] [L443] CALL, EXPR is_transmit1_triggered() [L194] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L197] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L207] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L209] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L443] RET, EXPR is_transmit1_triggered() [L443] tmp___0 = is_transmit1_triggered() [L445] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, token=0] [L451] CALL, EXPR is_transmit2_triggered() [L213] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L216] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L226] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L228] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L451] RET, EXPR is_transmit2_triggered() [L451] tmp___1 = is_transmit2_triggered() [L453] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0, token=0] [L561] RET activate_threads() VAL [E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L562] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L394] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L399] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L404] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L409] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L414] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L419] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L562] RET reset_delta_events() VAL [E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L565] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L568] kernel_st = 1 [L569] CALL eval() [L289] int tmp ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L293] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L296] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L263] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L266] COND TRUE m_st == 0 [L267] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L284] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L296] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L296] tmp = exists_runnable_thread() [L298] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L303] COND TRUE m_st == 0 [L304] int tmp_ndt_1; [L305] tmp_ndt_1 = __VERIFIER_nondet_int() [L306] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, token=0] [L317] COND TRUE t1_st == 0 [L318] int tmp_ndt_2; [L319] tmp_ndt_2 = __VERIFIER_nondet_int() [L320] COND TRUE \read(tmp_ndt_2) [L322] t1_st = 1 [L323] CALL transmit1() [L106] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L117] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L119] t1_pc = 1 [L120] t1_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L323] RET transmit1() [L331] COND TRUE t2_st == 0 [L332] int tmp_ndt_3; [L333] tmp_ndt_3 = __VERIFIER_nondet_int() [L334] COND TRUE \read(tmp_ndt_3) [L336] t2_st = 1 [L337] CALL transmit2() [L142] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L153] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L155] t2_pc = 1 [L156] t2_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L337] RET transmit2() [L293] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L296] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L263] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L266] COND TRUE m_st == 0 [L267] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L284] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L296] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L296] tmp = exists_runnable_thread() [L298] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L303] COND TRUE m_st == 0 [L304] int tmp_ndt_1; [L305] tmp_ndt_1 = __VERIFIER_nondet_int() [L306] COND TRUE \read(tmp_ndt_1) [L308] m_st = 1 [L309] CALL master() [L48] int tmp_var = __VERIFIER_nondet_int(); [L50] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L61] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L64] token = __VERIFIER_nondet_int() [L65] local = token [L66] E_1 = 1 VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L67] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L467] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L429] int tmp ; [L430] int tmp___0 ; [L431] int tmp___1 ; [L435] CALL, EXPR is_master_triggered() [L175] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L178] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L188] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L190] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=0, __retres1=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L435] RET, EXPR is_master_triggered() [L435] tmp = is_master_triggered() [L437] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=0] [L443] CALL, EXPR is_transmit1_triggered() [L194] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L197] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L198] COND TRUE E_1 == 1 [L199] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=1, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L209] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=1, __retres1=1, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L443] RET, EXPR is_transmit1_triggered() [L443] tmp___0 = is_transmit1_triggered() [L445] COND TRUE \read(tmp___0) [L446] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, token=0] [L451] CALL, EXPR is_transmit2_triggered() [L213] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L216] COND TRUE t2_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L217] COND FALSE !(E_2 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L226] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L228] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=0, __retres1=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L451] RET, EXPR is_transmit2_triggered() [L451] tmp___1 = is_transmit2_triggered() [L453] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, tmp___1=0, token=0] [L467] RET activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L67] RET immediate_notify() VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L68] E_1 = 2 [L69] m_pc = 1 [L70] m_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L309] RET master() [L317] COND TRUE t1_st == 0 [L318] int tmp_ndt_2; [L319] tmp_ndt_2 = __VERIFIER_nondet_int() [L320] COND TRUE \read(tmp_ndt_2) [L322] t1_st = 1 [L323] CALL transmit1() [L106] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L109] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L125] token += 1 [L126] E_2 = 1 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L127] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L467] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L429] int tmp ; [L430] int tmp___0 ; [L431] int tmp___1 ; [L435] CALL, EXPR is_master_triggered() [L175] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L178] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L179] COND FALSE !(E_M == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L188] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L190] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=0, __retres1=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L435] RET, EXPR is_master_triggered() [L435] tmp = is_master_triggered() [L437] COND FALSE !(\read(tmp)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=1] [L443] CALL, EXPR is_transmit1_triggered() [L194] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L197] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L198] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L207] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L209] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=0, __retres1=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L443] RET, EXPR is_transmit1_triggered() [L443] tmp___0 = is_transmit1_triggered() [L445] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0, token=1] [L451] CALL, EXPR is_transmit2_triggered() [L213] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L216] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L217] COND TRUE E_2 == 1 [L218] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=1, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L228] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=1, __retres1=1, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L451] RET, EXPR is_transmit2_triggered() [L451] tmp___1 = is_transmit2_triggered() [L453] COND TRUE \read(tmp___1) [L454] t2_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=0, tmp___0=0, tmp___1=1, token=1] [L467] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L127] RET immediate_notify() VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L128] E_2 = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L117] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L119] t1_pc = 1 [L120] t1_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L323] RET transmit1() [L331] COND TRUE t2_st == 0 [L332] int tmp_ndt_3; [L333] tmp_ndt_3 = __VERIFIER_nondet_int() [L334] COND TRUE \read(tmp_ndt_3) [L336] t2_st = 1 [L337] CALL transmit2() [L142] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L145] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L161] token += 1 [L162] E_M = 1 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L163] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L467] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L429] int tmp ; [L430] int tmp___0 ; [L431] int tmp___1 ; [L435] CALL, EXPR is_master_triggered() [L175] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L178] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L179] COND TRUE E_M == 1 [L180] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L190] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \result=1, __retres1=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L435] RET, EXPR is_master_triggered() [L435] tmp = is_master_triggered() [L437] COND TRUE \read(tmp) [L438] m_st = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, token=2] [L443] CALL, EXPR is_transmit1_triggered() [L194] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L197] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L198] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L207] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L209] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \result=0, __retres1=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L443] RET, EXPR is_transmit1_triggered() [L443] tmp___0 = is_transmit1_triggered() [L445] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, token=2] [L451] CALL, EXPR is_transmit2_triggered() [L213] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L216] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L217] COND FALSE !(E_2 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L226] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L228] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \result=0, __retres1=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L451] RET, EXPR is_transmit2_triggered() [L451] tmp___1 = is_transmit2_triggered() [L453] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, tmp___1=0, token=2] [L467] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L163] RET immediate_notify() VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L164] E_M = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L153] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L155] t2_pc = 1 [L156] t2_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L337] RET transmit2() [L293] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=2] [L296] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L263] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L266] COND TRUE m_st == 0 [L267] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L284] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L296] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=2] [L296] tmp = exists_runnable_thread() [L298] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=2] [L303] COND TRUE m_st == 0 [L304] int tmp_ndt_1; [L305] tmp_ndt_1 = __VERIFIER_nondet_int() [L306] COND TRUE \read(tmp_ndt_1) [L308] m_st = 1 [L309] CALL master() [L48] int tmp_var = __VERIFIER_nondet_int(); [L50] COND FALSE !(m_pc == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L53] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L75] COND FALSE !(token != local + 2) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L80] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L81] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L86] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L87] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L88] COND TRUE tmp_var == 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L89] CALL error() VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L20] reach_error() VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 140 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 45.6s, OverallIterations: 30, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.4s, AutomataDifference: 18.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6772 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6597 mSDsluCounter, 15324 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8233 mSDsCounter, 789 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5722 IncrementalHoareTripleChecker+Invalid, 6511 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 789 mSolverCounterUnsat, 7091 mSDtfsCounter, 5722 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3571 GetRequests, 3344 SyntacticMatches, 6 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31221occurred in iteration=15, InterpolantAutomatonStates: 172, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 15.3s AutomataMinimizationTime, 29 MinimizatonAttempts, 16547 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 6981 NumberOfCodeBlocks, 6981 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 6727 ConstructedInterpolants, 0 QuantifiedInterpolants, 10902 SizeOfPredicates, 9 NumberOfNonLiveVariables, 8988 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 47 InterpolantComputations, 29 PerfectInterpolantSequences, 3368/3904 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! [2021-12-17 15:36:39,784 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