./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+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/combinations/pc_sfifo_1.cil-2+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 a145625a0fe2baedf73b7a84d58038ade27f8470c6f09a0f78d8ec75fe662acb --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 02:29:32,134 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 02:29:32,135 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 02:29:32,186 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 02:29:32,189 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 02:29:32,190 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 02:29:32,191 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 02:29:32,192 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 02:29:32,193 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 02:29:32,194 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 02:29:32,194 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 02:29:32,195 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 02:29:32,195 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 02:29:32,196 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 02:29:32,202 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 02:29:32,204 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 02:29:32,205 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 02:29:32,207 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 02:29:32,208 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 02:29:32,213 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 02:29:32,214 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 02:29:32,214 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 02:29:32,220 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 02:29:32,220 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 02:29:32,222 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 02:29:32,222 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 02:29:32,222 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 02:29:32,223 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 02:29:32,223 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 02:29:32,223 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 02:29:32,225 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 02:29:32,226 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 02:29:32,229 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 02:29:32,230 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 02:29:32,230 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 02:29:32,230 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 02:29:32,231 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 02:29:32,231 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 02:29:32,231 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 02:29:32,232 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 02:29:32,232 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 02:29:32,234 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-16 02:29:32,247 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 02:29:32,251 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 02:29:32,252 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 02:29:32,252 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 02:29:32,253 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 02:29:32,253 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 02:29:32,254 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 02:29:32,254 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 02:29:32,254 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 02:29:32,254 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 02:29:32,255 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 02:29:32,255 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 02:29:32,255 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 02:29:32,255 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 02:29:32,256 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-16 02:29:32,256 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 02:29:32,256 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-16 02:29:32,256 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 02:29:32,256 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 02:29:32,256 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 02:29:32,257 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-16 02:29:32,257 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 02:29:32,257 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 02:29:32,257 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 02:29:32,257 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 02:29:32,257 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 02:29:32,258 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 02:29:32,259 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-16 02:29:32,259 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 02:29:32,259 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 02:29:32,259 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-16 02:29:32,259 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-16 02:29:32,259 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-16 02:29:32,260 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 02:29:32,260 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 -> a145625a0fe2baedf73b7a84d58038ade27f8470c6f09a0f78d8ec75fe662acb [2021-12-16 02:29:32,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 02:29:32,457 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 02:29:32,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 02:29:32,459 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 02:29:32,466 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 02:29:32,467 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-2.c [2021-12-16 02:29:32,525 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff8e14f45/ca478068b7d14bf08d19ce783e5ce9c7/FLAGf6d1655c7 [2021-12-16 02:29:32,879 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 02:29:32,879 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-2.c [2021-12-16 02:29:32,885 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff8e14f45/ca478068b7d14bf08d19ce783e5ce9c7/FLAGf6d1655c7 [2021-12-16 02:29:32,894 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff8e14f45/ca478068b7d14bf08d19ce783e5ce9c7 [2021-12-16 02:29:32,896 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 02:29:32,897 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 02:29:32,905 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 02:29:32,905 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 02:29:32,909 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 02:29:32,910 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 02:29:32" (1/1) ... [2021-12-16 02:29:32,910 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29a69ef2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:29:32, skipping insertion in model container [2021-12-16 02:29:32,911 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 02:29:32" (1/1) ... [2021-12-16 02:29:32,915 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 02:29:32,954 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 02:29:33,091 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/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-2.c[913,926] [2021-12-16 02:29:33,149 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/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-2.c[5977,5990] [2021-12-16 02:29:33,227 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 02:29:33,233 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 02:29:33,263 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/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-2.c[913,926] [2021-12-16 02:29:33,285 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/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-2.c[5977,5990] [2021-12-16 02:29:33,347 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 02:29:33,371 INFO L208 MainTranslator]: Completed translation [2021-12-16 02:29:33,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:29:33 WrapperNode [2021-12-16 02:29:33,372 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 02:29:33,373 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 02:29:33,373 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 02:29:33,373 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 02:29:33,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:29:33" (1/1) ... [2021-12-16 02:29:33,392 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:29:33" (1/1) ... [2021-12-16 02:29:33,425 INFO L137 Inliner]: procedures = 52, calls = 55, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 480 [2021-12-16 02:29:33,425 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 02:29:33,426 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 02:29:33,426 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 02:29:33,426 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 02:29:33,438 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:29:33" (1/1) ... [2021-12-16 02:29:33,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:29:33" (1/1) ... [2021-12-16 02:29:33,440 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:29:33" (1/1) ... [2021-12-16 02:29:33,441 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:29:33" (1/1) ... [2021-12-16 02:29:33,451 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:29:33" (1/1) ... [2021-12-16 02:29:33,466 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:29:33" (1/1) ... [2021-12-16 02:29:33,468 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:29:33" (1/1) ... [2021-12-16 02:29:33,470 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 02:29:33,471 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 02:29:33,471 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 02:29:33,471 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 02:29:33,472 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:29:33" (1/1) ... [2021-12-16 02:29:33,485 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 02:29:33,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 02:29:33,536 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-16 02:29:33,568 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-16 02:29:33,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 02:29:33,582 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-12-16 02:29:33,582 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-12-16 02:29:33,582 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2021-12-16 02:29:33,585 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2021-12-16 02:29:33,585 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2021-12-16 02:29:33,585 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2021-12-16 02:29:33,586 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2021-12-16 02:29:33,586 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2021-12-16 02:29:33,586 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2021-12-16 02:29:33,586 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2021-12-16 02:29:33,586 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2021-12-16 02:29:33,586 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2021-12-16 02:29:33,586 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2021-12-16 02:29:33,586 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2021-12-16 02:29:33,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 02:29:33,586 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2021-12-16 02:29:33,586 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2021-12-16 02:29:33,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 02:29:33,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 02:29:33,587 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2021-12-16 02:29:33,587 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2021-12-16 02:29:33,587 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2021-12-16 02:29:33,587 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2021-12-16 02:29:33,651 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 02:29:33,658 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 02:29:34,020 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 02:29:34,030 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 02:29:34,030 INFO L301 CfgBuilder]: Removed 9 assume(true) statements. [2021-12-16 02:29:34,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 02:29:34 BoogieIcfgContainer [2021-12-16 02:29:34,033 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 02:29:34,034 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 02:29:34,034 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 02:29:34,037 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 02:29:34,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 02:29:32" (1/3) ... [2021-12-16 02:29:34,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f29c72e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 02:29:34, skipping insertion in model container [2021-12-16 02:29:34,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:29:33" (2/3) ... [2021-12-16 02:29:34,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f29c72e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 02:29:34, skipping insertion in model container [2021-12-16 02:29:34,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 02:29:34" (3/3) ... [2021-12-16 02:29:34,039 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.02.cil-2.c [2021-12-16 02:29:34,043 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 02:29:34,044 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-16 02:29:34,111 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 02:29:34,117 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-16 02:29:34,117 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-12-16 02:29:34,146 INFO L276 IsEmpty]: Start isEmpty. Operand has 212 states, 175 states have (on average 1.5771428571428572) internal successors, (276), 182 states have internal predecessors, (276), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2021-12-16 02:29:34,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-16 02:29:34,157 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:34,158 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] [2021-12-16 02:29:34,159 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:34,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:34,163 INFO L85 PathProgramCache]: Analyzing trace with hash 2045589042, now seen corresponding path program 1 times [2021-12-16 02:29:34,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:34,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956372254] [2021-12-16 02:29:34,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:34,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:34,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:34,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 02:29:34,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:34,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-16 02:29:34,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:34,392 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-16 02:29:34,393 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:34,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956372254] [2021-12-16 02:29:34,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956372254] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:29:34,393 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:29:34,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 02:29:34,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139113162] [2021-12-16 02:29:34,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:34,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 02:29:34,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:34,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 02:29:34,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 02:29:34,426 INFO L87 Difference]: Start difference. First operand has 212 states, 175 states have (on average 1.5771428571428572) internal successors, (276), 182 states have internal predecessors, (276), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-16 02:29:34,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:34,642 INFO L93 Difference]: Finished difference Result 478 states and 736 transitions. [2021-12-16 02:29:34,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 02:29:34,644 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2021-12-16 02:29:34,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:34,666 INFO L225 Difference]: With dead ends: 478 [2021-12-16 02:29:34,666 INFO L226 Difference]: Without dead ends: 271 [2021-12-16 02:29:34,669 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 02:29:34,671 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 357 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 02:29:34,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [373 Valid, 551 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 02:29:34,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-12-16 02:29:34,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 265. [2021-12-16 02:29:34,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 224 states have (on average 1.4419642857142858) internal successors, (323), 229 states have internal predecessors, (323), 28 states have call successors, (28), 12 states have call predecessors, (28), 11 states have return successors, (30), 24 states have call predecessors, (30), 24 states have call successors, (30) [2021-12-16 02:29:34,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 381 transitions. [2021-12-16 02:29:34,733 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 381 transitions. Word has length 44 [2021-12-16 02:29:34,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:34,734 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 381 transitions. [2021-12-16 02:29:34,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-16 02:29:34,734 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 381 transitions. [2021-12-16 02:29:34,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-16 02:29:34,738 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:34,738 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] [2021-12-16 02:29:34,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-16 02:29:34,739 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:34,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:34,740 INFO L85 PathProgramCache]: Analyzing trace with hash 899257869, now seen corresponding path program 1 times [2021-12-16 02:29:34,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:34,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248698448] [2021-12-16 02:29:34,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:34,741 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:34,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:34,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 02:29:34,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:34,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-16 02:29:34,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:34,840 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-16 02:29:34,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:34,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248698448] [2021-12-16 02:29:34,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248698448] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:29:34,842 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:29:34,843 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 02:29:34,844 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079275089] [2021-12-16 02:29:34,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:34,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 02:29:34,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:34,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 02:29:34,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 02:29:34,849 INFO L87 Difference]: Start difference. First operand 265 states and 381 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-16 02:29:35,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:35,029 INFO L93 Difference]: Finished difference Result 513 states and 721 transitions. [2021-12-16 02:29:35,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 02:29:35,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2021-12-16 02:29:35,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:35,032 INFO L225 Difference]: With dead ends: 513 [2021-12-16 02:29:35,032 INFO L226 Difference]: Without dead ends: 389 [2021-12-16 02:29:35,033 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 02:29:35,034 INFO L933 BasicCegarLoop]: 336 mSDtfsCounter, 169 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 02:29:35,034 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 698 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 02:29:35,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2021-12-16 02:29:35,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 332. [2021-12-16 02:29:35,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 285 states have (on average 1.4280701754385965) internal successors, (407), 290 states have internal predecessors, (407), 31 states have call successors, (31), 15 states have call predecessors, (31), 14 states have return successors, (33), 27 states have call predecessors, (33), 27 states have call successors, (33) [2021-12-16 02:29:35,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 471 transitions. [2021-12-16 02:29:35,054 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 471 transitions. Word has length 45 [2021-12-16 02:29:35,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:35,055 INFO L470 AbstractCegarLoop]: Abstraction has 332 states and 471 transitions. [2021-12-16 02:29:35,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-16 02:29:35,055 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 471 transitions. [2021-12-16 02:29:35,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-16 02:29:35,056 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:35,057 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] [2021-12-16 02:29:35,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-16 02:29:35,057 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:35,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:35,057 INFO L85 PathProgramCache]: Analyzing trace with hash -385099592, now seen corresponding path program 1 times [2021-12-16 02:29:35,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:35,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336800266] [2021-12-16 02:29:35,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:35,058 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:35,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:35,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 02:29:35,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:35,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-16 02:29:35,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:35,098 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-16 02:29:35,098 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:35,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336800266] [2021-12-16 02:29:35,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336800266] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:29:35,098 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:29:35,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 02:29:35,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360364134] [2021-12-16 02:29:35,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:35,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 02:29:35,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:35,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 02:29:35,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 02:29:35,100 INFO L87 Difference]: Start difference. First operand 332 states and 471 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-16 02:29:35,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:35,203 INFO L93 Difference]: Finished difference Result 740 states and 1030 transitions. [2021-12-16 02:29:35,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 02:29:35,203 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2021-12-16 02:29:35,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:35,206 INFO L225 Difference]: With dead ends: 740 [2021-12-16 02:29:35,206 INFO L226 Difference]: Without dead ends: 549 [2021-12-16 02:29:35,207 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 02:29:35,208 INFO L933 BasicCegarLoop]: 311 mSDtfsCounter, 366 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 02:29:35,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [382 Valid, 545 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 02:29:35,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2021-12-16 02:29:35,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 497. [2021-12-16 02:29:35,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 431 states have (on average 1.3851508120649652) internal successors, (597), 439 states have internal predecessors, (597), 42 states have call successors, (42), 22 states have call predecessors, (42), 22 states have return successors, (50), 36 states have call predecessors, (50), 38 states have call successors, (50) [2021-12-16 02:29:35,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 689 transitions. [2021-12-16 02:29:35,239 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 689 transitions. Word has length 45 [2021-12-16 02:29:35,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:35,239 INFO L470 AbstractCegarLoop]: Abstraction has 497 states and 689 transitions. [2021-12-16 02:29:35,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-16 02:29:35,239 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 689 transitions. [2021-12-16 02:29:35,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-16 02:29:35,242 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:35,242 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:29:35,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-16 02:29:35,242 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:35,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:35,242 INFO L85 PathProgramCache]: Analyzing trace with hash -748902494, now seen corresponding path program 1 times [2021-12-16 02:29:35,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:35,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660182892] [2021-12-16 02:29:35,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:35,243 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:35,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:35,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 02:29:35,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:35,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-16 02:29:35,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:35,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-16 02:29:35,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:35,292 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-16 02:29:35,292 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:35,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660182892] [2021-12-16 02:29:35,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660182892] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:29:35,293 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:29:35,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 02:29:35,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086129766] [2021-12-16 02:29:35,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:35,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 02:29:35,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:35,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 02:29:35,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 02:29:35,294 INFO L87 Difference]: Start difference. First operand 497 states and 689 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-16 02:29:35,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:35,456 INFO L93 Difference]: Finished difference Result 1081 states and 1474 transitions. [2021-12-16 02:29:35,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 02:29:35,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 62 [2021-12-16 02:29:35,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:35,460 INFO L225 Difference]: With dead ends: 1081 [2021-12-16 02:29:35,460 INFO L226 Difference]: Without dead ends: 725 [2021-12-16 02:29:35,461 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 02:29:35,462 INFO L933 BasicCegarLoop]: 360 mSDtfsCounter, 153 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 02:29:35,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 735 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 02:29:35,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2021-12-16 02:29:35,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 687. [2021-12-16 02:29:35,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 597 states have (on average 1.3350083752093802) internal successors, (797), 607 states have internal predecessors, (797), 56 states have call successors, (56), 30 states have call predecessors, (56), 32 states have return successors, (74), 50 states have call predecessors, (74), 52 states have call successors, (74) [2021-12-16 02:29:35,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 927 transitions. [2021-12-16 02:29:35,502 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 927 transitions. Word has length 62 [2021-12-16 02:29:35,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:35,502 INFO L470 AbstractCegarLoop]: Abstraction has 687 states and 927 transitions. [2021-12-16 02:29:35,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-16 02:29:35,502 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 927 transitions. [2021-12-16 02:29:35,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-16 02:29:35,504 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:35,504 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:29:35,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-16 02:29:35,505 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:35,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:35,505 INFO L85 PathProgramCache]: Analyzing trace with hash -80982464, now seen corresponding path program 1 times [2021-12-16 02:29:35,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:35,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255180149] [2021-12-16 02:29:35,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:35,506 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:35,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:35,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 02:29:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:35,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-16 02:29:35,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:35,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-16 02:29:35,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:35,545 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-16 02:29:35,545 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:35,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255180149] [2021-12-16 02:29:35,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255180149] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:29:35,545 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:29:35,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 02:29:35,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784110066] [2021-12-16 02:29:35,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:35,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 02:29:35,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:35,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 02:29:35,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 02:29:35,547 INFO L87 Difference]: Start difference. First operand 687 states and 927 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-16 02:29:35,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:35,669 INFO L93 Difference]: Finished difference Result 1340 states and 1780 transitions. [2021-12-16 02:29:35,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 02:29:35,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 67 [2021-12-16 02:29:35,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:35,673 INFO L225 Difference]: With dead ends: 1340 [2021-12-16 02:29:35,674 INFO L226 Difference]: Without dead ends: 886 [2021-12-16 02:29:35,675 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 02:29:35,676 INFO L933 BasicCegarLoop]: 306 mSDtfsCounter, 353 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 02:29:35,676 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [369 Valid, 542 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 02:29:35,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2021-12-16 02:29:35,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 831. [2021-12-16 02:29:35,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 725 states have (on average 1.3075862068965518) internal successors, (948), 737 states have internal predecessors, (948), 64 states have call successors, (64), 36 states have call predecessors, (64), 40 states have return successors, (88), 58 states have call predecessors, (88), 60 states have call successors, (88) [2021-12-16 02:29:35,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1100 transitions. [2021-12-16 02:29:35,706 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1100 transitions. Word has length 67 [2021-12-16 02:29:35,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:35,706 INFO L470 AbstractCegarLoop]: Abstraction has 831 states and 1100 transitions. [2021-12-16 02:29:35,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-16 02:29:35,706 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1100 transitions. [2021-12-16 02:29:35,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-16 02:29:35,708 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:35,708 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, 1] [2021-12-16 02:29:35,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-16 02:29:35,708 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:35,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:35,708 INFO L85 PathProgramCache]: Analyzing trace with hash -294715005, now seen corresponding path program 1 times [2021-12-16 02:29:35,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:35,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974548645] [2021-12-16 02:29:35,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:35,709 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:35,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:35,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 02:29:35,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:35,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 02:29:35,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:35,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 02:29:35,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:35,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 02:29:35,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:35,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 02:29:35,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:35,793 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-16 02:29:35,793 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:35,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974548645] [2021-12-16 02:29:35,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974548645] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:29:35,793 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:29:35,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 02:29:35,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407580735] [2021-12-16 02:29:35,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:35,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 02:29:35,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:35,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 02:29:35,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 02:29:35,795 INFO L87 Difference]: Start difference. First operand 831 states and 1100 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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-16 02:29:36,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:36,344 INFO L93 Difference]: Finished difference Result 1141 states and 1571 transitions. [2021-12-16 02:29:36,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 02:29:36,344 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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 69 [2021-12-16 02:29:36,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:36,348 INFO L225 Difference]: With dead ends: 1141 [2021-12-16 02:29:36,348 INFO L226 Difference]: Without dead ends: 1017 [2021-12-16 02:29:36,349 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-16 02:29:36,349 INFO L933 BasicCegarLoop]: 310 mSDtfsCounter, 566 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-16 02:29:36,350 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [579 Valid, 858 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-16 02:29:36,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2021-12-16 02:29:36,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 952. [2021-12-16 02:29:36,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 828 states have (on average 1.3333333333333333) internal successors, (1104), 841 states have internal predecessors, (1104), 75 states have call successors, (75), 42 states have call predecessors, (75), 47 states have return successors, (102), 69 states have call predecessors, (102), 71 states have call successors, (102) [2021-12-16 02:29:36,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1281 transitions. [2021-12-16 02:29:36,382 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1281 transitions. Word has length 69 [2021-12-16 02:29:36,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:36,382 INFO L470 AbstractCegarLoop]: Abstraction has 952 states and 1281 transitions. [2021-12-16 02:29:36,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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-16 02:29:36,382 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1281 transitions. [2021-12-16 02:29:36,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-16 02:29:36,384 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:36,384 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, 1] [2021-12-16 02:29:36,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-16 02:29:36,384 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:36,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:36,385 INFO L85 PathProgramCache]: Analyzing trace with hash -192000641, now seen corresponding path program 1 times [2021-12-16 02:29:36,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:36,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419444515] [2021-12-16 02:29:36,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:36,385 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:36,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:36,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 02:29:36,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:36,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 02:29:36,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:36,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 02:29:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:36,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 02:29:36,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:36,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 02:29:36,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:36,444 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-16 02:29:36,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:36,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419444515] [2021-12-16 02:29:36,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419444515] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:29:36,444 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:29:36,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 02:29:36,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995554517] [2021-12-16 02:29:36,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:36,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 02:29:36,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:36,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 02:29:36,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 02:29:36,445 INFO L87 Difference]: Start difference. First operand 952 states and 1281 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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-16 02:29:36,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:36,839 INFO L93 Difference]: Finished difference Result 1262 states and 1754 transitions. [2021-12-16 02:29:36,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 02:29:36,839 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 69 [2021-12-16 02:29:36,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:36,843 INFO L225 Difference]: With dead ends: 1262 [2021-12-16 02:29:36,843 INFO L226 Difference]: Without dead ends: 1017 [2021-12-16 02:29:36,844 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-16 02:29:36,844 INFO L933 BasicCegarLoop]: 273 mSDtfsCounter, 458 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 02:29:36,845 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [472 Valid, 821 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 02:29:36,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2021-12-16 02:29:36,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 952. [2021-12-16 02:29:36,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 828 states have (on average 1.3309178743961352) internal successors, (1102), 841 states have internal predecessors, (1102), 75 states have call successors, (75), 42 states have call predecessors, (75), 47 states have return successors, (102), 69 states have call predecessors, (102), 71 states have call successors, (102) [2021-12-16 02:29:36,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1279 transitions. [2021-12-16 02:29:36,877 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1279 transitions. Word has length 69 [2021-12-16 02:29:36,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:36,877 INFO L470 AbstractCegarLoop]: Abstraction has 952 states and 1279 transitions. [2021-12-16 02:29:36,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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-16 02:29:36,877 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1279 transitions. [2021-12-16 02:29:36,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-16 02:29:36,878 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:36,879 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, 1] [2021-12-16 02:29:36,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-16 02:29:36,879 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:36,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:36,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1194784769, now seen corresponding path program 1 times [2021-12-16 02:29:36,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:36,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620700549] [2021-12-16 02:29:36,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:36,880 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:36,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:36,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 02:29:36,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:36,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 02:29:36,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:36,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 02:29:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:36,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 02:29:36,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:36,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 02:29:36,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:36,937 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-16 02:29:36,938 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:36,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620700549] [2021-12-16 02:29:36,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620700549] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:29:36,938 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:29:36,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 02:29:36,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927223943] [2021-12-16 02:29:36,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:36,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 02:29:36,938 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:36,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 02:29:36,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 02:29:36,939 INFO L87 Difference]: Start difference. First operand 952 states and 1279 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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-16 02:29:37,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:37,634 INFO L93 Difference]: Finished difference Result 1410 states and 1961 transitions. [2021-12-16 02:29:37,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-16 02:29:37,635 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 69 [2021-12-16 02:29:37,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:37,639 INFO L225 Difference]: With dead ends: 1410 [2021-12-16 02:29:37,639 INFO L226 Difference]: Without dead ends: 1165 [2021-12-16 02:29:37,640 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-16 02:29:37,640 INFO L933 BasicCegarLoop]: 323 mSDtfsCounter, 571 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-16 02:29:37,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [584 Valid, 1050 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-16 02:29:37,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2021-12-16 02:29:37,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1066. [2021-12-16 02:29:37,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1066 states, 924 states have (on average 1.3452380952380953) internal successors, (1243), 938 states have internal predecessors, (1243), 86 states have call successors, (86), 48 states have call predecessors, (86), 54 states have return successors, (115), 81 states have call predecessors, (115), 82 states have call successors, (115) [2021-12-16 02:29:37,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 1444 transitions. [2021-12-16 02:29:37,685 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 1444 transitions. Word has length 69 [2021-12-16 02:29:37,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:37,685 INFO L470 AbstractCegarLoop]: Abstraction has 1066 states and 1444 transitions. [2021-12-16 02:29:37,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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-16 02:29:37,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1444 transitions. [2021-12-16 02:29:37,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-16 02:29:37,687 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:37,687 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, 1] [2021-12-16 02:29:37,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-16 02:29:37,688 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:37,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:37,688 INFO L85 PathProgramCache]: Analyzing trace with hash 2070803775, now seen corresponding path program 1 times [2021-12-16 02:29:37,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:37,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072555776] [2021-12-16 02:29:37,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:37,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:37,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 02:29:37,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:37,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 02:29:37,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:37,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 02:29:37,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:37,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 02:29:37,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:37,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 02:29:37,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:37,744 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-16 02:29:37,744 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:37,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072555776] [2021-12-16 02:29:37,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072555776] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:29:37,745 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:29:37,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 02:29:37,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696741308] [2021-12-16 02:29:37,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:37,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 02:29:37,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:37,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 02:29:37,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 02:29:37,746 INFO L87 Difference]: Start difference. First operand 1066 states and 1444 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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-16 02:29:38,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:38,448 INFO L93 Difference]: Finished difference Result 1882 states and 2652 transitions. [2021-12-16 02:29:38,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-16 02:29:38,449 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 69 [2021-12-16 02:29:38,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:38,454 INFO L225 Difference]: With dead ends: 1882 [2021-12-16 02:29:38,454 INFO L226 Difference]: Without dead ends: 1523 [2021-12-16 02:29:38,455 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-12-16 02:29:38,456 INFO L933 BasicCegarLoop]: 387 mSDtfsCounter, 641 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-16 02:29:38,456 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [657 Valid, 1306 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-16 02:29:38,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2021-12-16 02:29:38,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1290. [2021-12-16 02:29:38,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1290 states, 1114 states have (on average 1.3680430879712746) internal successors, (1524), 1130 states have internal predecessors, (1524), 106 states have call successors, (106), 60 states have call predecessors, (106), 68 states have return successors, (143), 103 states have call predecessors, (143), 102 states have call successors, (143) [2021-12-16 02:29:38,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1773 transitions. [2021-12-16 02:29:38,496 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 1773 transitions. Word has length 69 [2021-12-16 02:29:38,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:38,497 INFO L470 AbstractCegarLoop]: Abstraction has 1290 states and 1773 transitions. [2021-12-16 02:29:38,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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-16 02:29:38,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 1773 transitions. [2021-12-16 02:29:38,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-16 02:29:38,499 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:38,499 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, 1] [2021-12-16 02:29:38,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-16 02:29:38,500 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:38,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:38,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1780262847, now seen corresponding path program 1 times [2021-12-16 02:29:38,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:38,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562831610] [2021-12-16 02:29:38,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:38,501 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:38,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:38,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 02:29:38,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:38,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 02:29:38,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:38,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 02:29:38,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:38,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 02:29:38,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:38,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 02:29:38,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:38,552 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-16 02:29:38,553 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:38,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562831610] [2021-12-16 02:29:38,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562831610] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:29:38,553 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:29:38,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 02:29:38,553 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854760257] [2021-12-16 02:29:38,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:38,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 02:29:38,554 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:38,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 02:29:38,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 02:29:38,555 INFO L87 Difference]: Start difference. First operand 1290 states and 1773 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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-16 02:29:38,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:38,885 INFO L93 Difference]: Finished difference Result 2015 states and 2858 transitions. [2021-12-16 02:29:38,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 02:29:38,886 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 69 [2021-12-16 02:29:38,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:38,891 INFO L225 Difference]: With dead ends: 2015 [2021-12-16 02:29:38,892 INFO L226 Difference]: Without dead ends: 1432 [2021-12-16 02:29:38,893 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-12-16 02:29:38,894 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 532 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 02:29:38,894 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [546 Valid, 679 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 02:29:38,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2021-12-16 02:29:38,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 1290. [2021-12-16 02:29:38,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1290 states, 1114 states have (on average 1.3635547576301617) internal successors, (1519), 1130 states have internal predecessors, (1519), 106 states have call successors, (106), 60 states have call predecessors, (106), 68 states have return successors, (143), 103 states have call predecessors, (143), 102 states have call successors, (143) [2021-12-16 02:29:38,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1768 transitions. [2021-12-16 02:29:38,934 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 1768 transitions. Word has length 69 [2021-12-16 02:29:38,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:38,934 INFO L470 AbstractCegarLoop]: Abstraction has 1290 states and 1768 transitions. [2021-12-16 02:29:38,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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-16 02:29:38,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 1768 transitions. [2021-12-16 02:29:38,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-16 02:29:38,936 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:38,936 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, 1] [2021-12-16 02:29:38,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-16 02:29:38,937 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:38,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:38,937 INFO L85 PathProgramCache]: Analyzing trace with hash -241922817, now seen corresponding path program 1 times [2021-12-16 02:29:38,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:38,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577567717] [2021-12-16 02:29:38,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:38,938 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:38,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:38,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 02:29:38,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:38,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 02:29:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:38,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 02:29:38,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:38,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 02:29:38,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:38,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 02:29:38,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:38,988 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-16 02:29:38,988 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:38,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577567717] [2021-12-16 02:29:38,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577567717] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:29:38,989 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:29:38,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 02:29:38,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707246957] [2021-12-16 02:29:38,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:38,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 02:29:38,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:38,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 02:29:38,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 02:29:38,990 INFO L87 Difference]: Start difference. First operand 1290 states and 1768 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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-16 02:29:39,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:39,568 INFO L93 Difference]: Finished difference Result 2604 states and 3686 transitions. [2021-12-16 02:29:39,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-16 02:29:39,568 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 69 [2021-12-16 02:29:39,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:39,575 INFO L225 Difference]: With dead ends: 2604 [2021-12-16 02:29:39,576 INFO L226 Difference]: Without dead ends: 2021 [2021-12-16 02:29:39,578 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-12-16 02:29:39,578 INFO L933 BasicCegarLoop]: 376 mSDtfsCounter, 550 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 1295 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-16 02:29:39,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [566 Valid, 1295 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-16 02:29:39,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2021 states. [2021-12-16 02:29:39,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2021 to 1738. [2021-12-16 02:29:39,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1738 states, 1496 states have (on average 1.3903743315508021) internal successors, (2080), 1516 states have internal predecessors, (2080), 144 states have call successors, (144), 84 states have call predecessors, (144), 96 states have return successors, (203), 145 states have call predecessors, (203), 140 states have call successors, (203) [2021-12-16 02:29:39,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2427 transitions. [2021-12-16 02:29:39,658 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2427 transitions. Word has length 69 [2021-12-16 02:29:39,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:39,659 INFO L470 AbstractCegarLoop]: Abstraction has 1738 states and 2427 transitions. [2021-12-16 02:29:39,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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-16 02:29:39,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2427 transitions. [2021-12-16 02:29:39,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-16 02:29:39,661 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:39,661 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, 1] [2021-12-16 02:29:39,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-16 02:29:39,662 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:39,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:39,662 INFO L85 PathProgramCache]: Analyzing trace with hash 2024458369, now seen corresponding path program 1 times [2021-12-16 02:29:39,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:39,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709517428] [2021-12-16 02:29:39,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:39,663 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:39,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:39,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 02:29:39,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:39,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 02:29:39,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:39,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 02:29:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:39,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 02:29:39,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:39,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 02:29:39,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:39,708 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-16 02:29:39,709 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:39,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709517428] [2021-12-16 02:29:39,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709517428] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:29:39,709 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:29:39,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 02:29:39,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863062108] [2021-12-16 02:29:39,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:39,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 02:29:39,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:39,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 02:29:39,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 02:29:39,711 INFO L87 Difference]: Start difference. First operand 1738 states and 2427 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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-16 02:29:40,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:40,211 INFO L93 Difference]: Finished difference Result 4116 states and 5899 transitions. [2021-12-16 02:29:40,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 02:29:40,212 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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 69 [2021-12-16 02:29:40,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:40,223 INFO L225 Difference]: With dead ends: 4116 [2021-12-16 02:29:40,223 INFO L226 Difference]: Without dead ends: 3086 [2021-12-16 02:29:40,226 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-16 02:29:40,227 INFO L933 BasicCegarLoop]: 440 mSDtfsCounter, 684 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-16 02:29:40,227 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [713 Valid, 1012 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-16 02:29:40,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3086 states. [2021-12-16 02:29:40,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3086 to 2673. [2021-12-16 02:29:40,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2673 states, 2277 states have (on average 1.393939393939394) internal successors, (3174), 2314 states have internal predecessors, (3174), 236 states have call successors, (236), 138 states have call predecessors, (236), 158 states have return successors, (323), 228 states have call predecessors, (323), 232 states have call successors, (323) [2021-12-16 02:29:40,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2673 states to 2673 states and 3733 transitions. [2021-12-16 02:29:40,346 INFO L78 Accepts]: Start accepts. Automaton has 2673 states and 3733 transitions. Word has length 69 [2021-12-16 02:29:40,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:40,347 INFO L470 AbstractCegarLoop]: Abstraction has 2673 states and 3733 transitions. [2021-12-16 02:29:40,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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-16 02:29:40,347 INFO L276 IsEmpty]: Start isEmpty. Operand 2673 states and 3733 transitions. [2021-12-16 02:29:40,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-16 02:29:40,349 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:40,349 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-16 02:29:40,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-16 02:29:40,350 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:40,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:40,350 INFO L85 PathProgramCache]: Analyzing trace with hash 688510564, now seen corresponding path program 1 times [2021-12-16 02:29:40,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:40,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494872839] [2021-12-16 02:29:40,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:40,351 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:40,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:40,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 02:29:40,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:40,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-16 02:29:40,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:40,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-16 02:29:40,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:40,398 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-16 02:29:40,398 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:40,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494872839] [2021-12-16 02:29:40,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494872839] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 02:29:40,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933214473] [2021-12-16 02:29:40,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:40,399 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 02:29:40,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 02:29:40,400 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-16 02:29:40,433 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-16 02:29:40,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:40,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 02:29:40,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 02:29:40,566 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-16 02:29:40,566 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 02:29:40,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933214473] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:29:40,567 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 02:29:40,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-12-16 02:29:40,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695442096] [2021-12-16 02:29:40,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:40,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 02:29:40,568 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:40,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 02:29:40,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 02:29:40,568 INFO L87 Difference]: Start difference. First operand 2673 states and 3733 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-16 02:29:40,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:40,647 INFO L93 Difference]: Finished difference Result 3216 states and 4456 transitions. [2021-12-16 02:29:40,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 02:29:40,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 68 [2021-12-16 02:29:40,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:40,657 INFO L225 Difference]: With dead ends: 3216 [2021-12-16 02:29:40,657 INFO L226 Difference]: Without dead ends: 2671 [2021-12-16 02:29:40,659 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 02:29:40,660 INFO L933 BasicCegarLoop]: 338 mSDtfsCounter, 72 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 02:29:40,660 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 598 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 02:29:40,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2671 states. [2021-12-16 02:29:40,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2671 to 2627. [2021-12-16 02:29:40,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2627 states, 2237 states have (on average 1.3898077782744747) internal successors, (3109), 2274 states have internal predecessors, (3109), 232 states have call successors, (232), 136 states have call predecessors, (232), 156 states have return successors, (317), 224 states have call predecessors, (317), 228 states have call successors, (317) [2021-12-16 02:29:40,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2627 states to 2627 states and 3658 transitions. [2021-12-16 02:29:40,770 INFO L78 Accepts]: Start accepts. Automaton has 2627 states and 3658 transitions. Word has length 68 [2021-12-16 02:29:40,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:40,771 INFO L470 AbstractCegarLoop]: Abstraction has 2627 states and 3658 transitions. [2021-12-16 02:29:40,771 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-16 02:29:40,771 INFO L276 IsEmpty]: Start isEmpty. Operand 2627 states and 3658 transitions. [2021-12-16 02:29:40,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-16 02:29:40,773 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:40,773 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:29:40,810 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-16 02:29:40,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-16 02:29:40,991 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:40,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:40,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1426484957, now seen corresponding path program 1 times [2021-12-16 02:29:40,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:40,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55887325] [2021-12-16 02:29:40,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:40,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:40,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:41,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 02:29:41,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:41,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-16 02:29:41,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:41,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-16 02:29:41,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:41,043 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-16 02:29:41,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:41,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55887325] [2021-12-16 02:29:41,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55887325] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 02:29:41,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563963387] [2021-12-16 02:29:41,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:41,044 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 02:29:41,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 02:29:41,045 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-16 02:29:41,076 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-16 02:29:41,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:41,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-16 02:29:41,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 02:29:41,253 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:29:41,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 02:29:41,354 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-16 02:29:41,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563963387] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-16 02:29:41,355 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-16 02:29:41,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 8 [2021-12-16 02:29:41,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282853557] [2021-12-16 02:29:41,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:41,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 02:29:41,355 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:41,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 02:29:41,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-16 02:29:41,356 INFO L87 Difference]: Start difference. First operand 2627 states and 3658 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-16 02:29:41,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:41,499 INFO L93 Difference]: Finished difference Result 2679 states and 3720 transitions. [2021-12-16 02:29:41,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 02:29:41,500 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 68 [2021-12-16 02:29:41,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:41,508 INFO L225 Difference]: With dead ends: 2679 [2021-12-16 02:29:41,508 INFO L226 Difference]: Without dead ends: 2676 [2021-12-16 02:29:41,509 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 139 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-16 02:29:41,510 INFO L933 BasicCegarLoop]: 310 mSDtfsCounter, 491 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 02:29:41,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [491 Valid, 375 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 02:29:41,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2676 states. [2021-12-16 02:29:41,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2676 to 2626. [2021-12-16 02:29:41,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2626 states, 2237 states have (on average 1.388913723737148) internal successors, (3107), 2273 states have internal predecessors, (3107), 231 states have call successors, (231), 136 states have call predecessors, (231), 156 states have return successors, (317), 224 states have call predecessors, (317), 228 states have call successors, (317) [2021-12-16 02:29:41,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 3655 transitions. [2021-12-16 02:29:41,601 INFO L78 Accepts]: Start accepts. Automaton has 2626 states and 3655 transitions. Word has length 68 [2021-12-16 02:29:41,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:41,602 INFO L470 AbstractCegarLoop]: Abstraction has 2626 states and 3655 transitions. [2021-12-16 02:29:41,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-16 02:29:41,602 INFO L276 IsEmpty]: Start isEmpty. Operand 2626 states and 3655 transitions. [2021-12-16 02:29:41,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-16 02:29:41,603 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:41,604 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:29:41,631 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-16 02:29:41,831 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,SelfDestructingSolverStorable13 [2021-12-16 02:29:41,832 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:41,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:41,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1272047869, now seen corresponding path program 1 times [2021-12-16 02:29:41,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:41,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123776922] [2021-12-16 02:29:41,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:41,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:41,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:41,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 02:29:41,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:41,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-16 02:29:41,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:41,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-16 02:29:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:41,874 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-16 02:29:41,875 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:41,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123776922] [2021-12-16 02:29:41,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123776922] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 02:29:41,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143553267] [2021-12-16 02:29:41,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:41,875 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 02:29:41,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 02:29:41,902 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-16 02:29:41,903 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-16 02:29:41,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:41,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-16 02:29:41,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 02:29:42,181 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:29:42,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 02:29:42,256 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-16 02:29:42,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143553267] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 02:29:42,257 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 02:29:42,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 11 [2021-12-16 02:29:42,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465319539] [2021-12-16 02:29:42,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 02:29:42,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-16 02:29:42,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:42,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-16 02:29:42,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-16 02:29:42,258 INFO L87 Difference]: Start difference. First operand 2626 states and 3655 transitions. Second operand has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2021-12-16 02:29:42,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:42,994 INFO L93 Difference]: Finished difference Result 4136 states and 5593 transitions. [2021-12-16 02:29:42,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-12-16 02:29:42,994 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 69 [2021-12-16 02:29:42,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:43,004 INFO L225 Difference]: With dead ends: 4136 [2021-12-16 02:29:43,004 INFO L226 Difference]: Without dead ends: 3640 [2021-12-16 02:29:43,007 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=324, Invalid=1482, Unknown=0, NotChecked=0, Total=1806 [2021-12-16 02:29:43,008 INFO L933 BasicCegarLoop]: 411 mSDtfsCounter, 886 mSDsluCounter, 1894 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 2305 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 02:29:43,008 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [909 Valid, 2305 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 02:29:43,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3640 states. [2021-12-16 02:29:43,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3640 to 3005. [2021-12-16 02:29:43,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3005 states, 2577 states have (on average 1.3655413271245636) internal successors, (3519), 2621 states have internal predecessors, (3519), 251 states have call successors, (251), 150 states have call predecessors, (251), 175 states have return successors, (351), 241 states have call predecessors, (351), 248 states have call successors, (351) [2021-12-16 02:29:43,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3005 states to 3005 states and 4121 transitions. [2021-12-16 02:29:43,125 INFO L78 Accepts]: Start accepts. Automaton has 3005 states and 4121 transitions. Word has length 69 [2021-12-16 02:29:43,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:43,126 INFO L470 AbstractCegarLoop]: Abstraction has 3005 states and 4121 transitions. [2021-12-16 02:29:43,126 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2021-12-16 02:29:43,126 INFO L276 IsEmpty]: Start isEmpty. Operand 3005 states and 4121 transitions. [2021-12-16 02:29:43,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-12-16 02:29:43,129 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:43,129 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-16 02:29:43,175 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-16 02:29:43,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 02:29:43,330 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:43,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:43,332 INFO L85 PathProgramCache]: Analyzing trace with hash -290000336, now seen corresponding path program 1 times [2021-12-16 02:29:43,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:43,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608180234] [2021-12-16 02:29:43,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:43,332 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:43,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:43,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 02:29:43,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:43,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-16 02:29:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:43,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-16 02:29:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:43,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-16 02:29:43,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:43,386 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-16 02:29:43,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:43,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608180234] [2021-12-16 02:29:43,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608180234] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 02:29:43,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849630324] [2021-12-16 02:29:43,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:43,387 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 02:29:43,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 02:29:43,388 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-16 02:29:43,390 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-16 02:29:43,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:43,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 02:29:43,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 02:29:43,547 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-16 02:29:43,547 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 02:29:43,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849630324] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:29:43,547 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 02:29:43,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-12-16 02:29:43,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914309990] [2021-12-16 02:29:43,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:43,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 02:29:43,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:43,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 02:29:43,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 02:29:43,549 INFO L87 Difference]: Start difference. First operand 3005 states and 4121 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-16 02:29:43,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:43,633 INFO L93 Difference]: Finished difference Result 3696 states and 4996 transitions. [2021-12-16 02:29:43,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 02:29:43,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 88 [2021-12-16 02:29:43,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:43,649 INFO L225 Difference]: With dead ends: 3696 [2021-12-16 02:29:43,650 INFO L226 Difference]: Without dead ends: 2927 [2021-12-16 02:29:43,652 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 02:29:43,653 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 246 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 02:29:43,653 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [246 Valid, 390 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 02:29:43,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2927 states. [2021-12-16 02:29:43,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2927 to 2918. [2021-12-16 02:29:43,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2918 states, 2500 states have (on average 1.366) internal successors, (3415), 2543 states have internal predecessors, (3415), 247 states have call successors, (247), 146 states have call predecessors, (247), 169 states have return successors, (343), 236 states have call predecessors, (343), 244 states have call successors, (343) [2021-12-16 02:29:43,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2918 states to 2918 states and 4005 transitions. [2021-12-16 02:29:43,787 INFO L78 Accepts]: Start accepts. Automaton has 2918 states and 4005 transitions. Word has length 88 [2021-12-16 02:29:43,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:43,787 INFO L470 AbstractCegarLoop]: Abstraction has 2918 states and 4005 transitions. [2021-12-16 02:29:43,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-16 02:29:43,788 INFO L276 IsEmpty]: Start isEmpty. Operand 2918 states and 4005 transitions. [2021-12-16 02:29:43,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-12-16 02:29:43,792 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:43,792 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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-16 02:29:43,816 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-16 02:29:44,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-16 02:29:44,010 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:44,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:44,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1575033221, now seen corresponding path program 1 times [2021-12-16 02:29:44,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:44,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760630720] [2021-12-16 02:29:44,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:44,011 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:44,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:44,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 02:29:44,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:44,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-16 02:29:44,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:44,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-16 02:29:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:44,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-16 02:29:44,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:44,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-16 02:29:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:44,067 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-12-16 02:29:44,068 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:44,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760630720] [2021-12-16 02:29:44,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760630720] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 02:29:44,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775125172] [2021-12-16 02:29:44,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:44,068 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 02:29:44,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 02:29:44,069 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-16 02:29:44,070 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-16 02:29:44,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:44,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 02:29:44,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 02:29:44,221 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-16 02:29:44,222 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 02:29:44,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775125172] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:29:44,222 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 02:29:44,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-12-16 02:29:44,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578287515] [2021-12-16 02:29:44,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:44,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 02:29:44,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:44,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 02:29:44,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 02:29:44,224 INFO L87 Difference]: Start difference. First operand 2918 states and 4005 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-16 02:29:44,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:44,294 INFO L93 Difference]: Finished difference Result 3295 states and 4466 transitions. [2021-12-16 02:29:44,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 02:29:44,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 103 [2021-12-16 02:29:44,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:44,301 INFO L225 Difference]: With dead ends: 3295 [2021-12-16 02:29:44,301 INFO L226 Difference]: Without dead ends: 1977 [2021-12-16 02:29:44,303 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 02:29:44,304 INFO L933 BasicCegarLoop]: 331 mSDtfsCounter, 61 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 593 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-16 02:29:44,304 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 593 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 02:29:44,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2021-12-16 02:29:44,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1977. [2021-12-16 02:29:44,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1977 states, 1662 states have (on average 1.4380264741275572) internal successors, (2390), 1689 states have internal predecessors, (2390), 190 states have call successors, (190), 109 states have call predecessors, (190), 124 states have return successors, (251), 186 states have call predecessors, (251), 188 states have call successors, (251) [2021-12-16 02:29:44,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1977 states to 1977 states and 2831 transitions. [2021-12-16 02:29:44,369 INFO L78 Accepts]: Start accepts. Automaton has 1977 states and 2831 transitions. Word has length 103 [2021-12-16 02:29:44,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:44,369 INFO L470 AbstractCegarLoop]: Abstraction has 1977 states and 2831 transitions. [2021-12-16 02:29:44,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-16 02:29:44,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1977 states and 2831 transitions. [2021-12-16 02:29:44,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-12-16 02:29:44,373 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:44,373 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, 1] [2021-12-16 02:29:44,392 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-16 02:29:44,590 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,SelfDestructingSolverStorable16 [2021-12-16 02:29:44,590 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:44,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:44,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1375832156, now seen corresponding path program 1 times [2021-12-16 02:29:44,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:44,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416174199] [2021-12-16 02:29:44,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:44,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:44,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:44,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 02:29:44,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:44,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 02:29:44,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:44,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 02:29:44,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:44,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 02:29:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:44,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 02:29:44,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:44,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-16 02:29:44,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:44,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:29:44,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:44,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-16 02:29:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:44,718 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-16 02:29:44,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:44,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416174199] [2021-12-16 02:29:44,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416174199] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 02:29:44,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116015394] [2021-12-16 02:29:44,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:44,718 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 02:29:44,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 02:29:44,732 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-16 02:29:44,776 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-16 02:29:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:44,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 02:29:44,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 02:29:44,929 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-16 02:29:44,929 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 02:29:44,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116015394] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:29:44,929 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 02:29:44,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2021-12-16 02:29:44,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833312928] [2021-12-16 02:29:44,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:44,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 02:29:44,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:44,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 02:29:44,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-16 02:29:44,931 INFO L87 Difference]: Start difference. First operand 1977 states and 2831 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 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-16 02:29:45,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:45,025 INFO L93 Difference]: Finished difference Result 5840 states and 8421 transitions. [2021-12-16 02:29:45,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 02:29:45,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 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 111 [2021-12-16 02:29:45,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:45,041 INFO L225 Difference]: With dead ends: 5840 [2021-12-16 02:29:45,041 INFO L226 Difference]: Without dead ends: 3875 [2021-12-16 02:29:45,046 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 126 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-16 02:29:45,047 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 151 mSDsluCounter, 169 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-16 02:29:45,047 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-16 02:29:45,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3875 states. [2021-12-16 02:29:45,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3875 to 3835. [2021-12-16 02:29:45,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3835 states, 3222 states have (on average 1.4342023587833643) internal successors, (4621), 3274 states have internal predecessors, (4621), 364 states have call successors, (364), 217 states have call predecessors, (364), 248 states have return successors, (481), 351 states have call predecessors, (481), 362 states have call successors, (481) [2021-12-16 02:29:45,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3835 states to 3835 states and 5466 transitions. [2021-12-16 02:29:45,201 INFO L78 Accepts]: Start accepts. Automaton has 3835 states and 5466 transitions. Word has length 111 [2021-12-16 02:29:45,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:45,201 INFO L470 AbstractCegarLoop]: Abstraction has 3835 states and 5466 transitions. [2021-12-16 02:29:45,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 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-16 02:29:45,201 INFO L276 IsEmpty]: Start isEmpty. Operand 3835 states and 5466 transitions. [2021-12-16 02:29:45,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-12-16 02:29:45,206 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:45,206 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, 1] [2021-12-16 02:29:45,225 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-16 02:29:45,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-16 02:29:45,423 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:45,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:45,424 INFO L85 PathProgramCache]: Analyzing trace with hash 483275324, now seen corresponding path program 1 times [2021-12-16 02:29:45,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:45,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301549923] [2021-12-16 02:29:45,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:45,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:45,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:45,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 02:29:45,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:45,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 02:29:45,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:45,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 02:29:45,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:45,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 02:29:45,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:45,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 02:29:45,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:45,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-16 02:29:45,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:45,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:29:45,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:45,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-16 02:29:45,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:45,524 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-16 02:29:45,524 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:45,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301549923] [2021-12-16 02:29:45,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301549923] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 02:29:45,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432077241] [2021-12-16 02:29:45,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:45,525 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 02:29:45,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 02:29:45,526 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-16 02:29:45,527 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-16 02:29:45,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:45,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 02:29:45,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 02:29:45,698 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-16 02:29:45,699 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 02:29:45,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432077241] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:29:45,699 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 02:29:45,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-16 02:29:45,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126538636] [2021-12-16 02:29:45,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:45,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 02:29:45,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:45,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 02:29:45,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-16 02:29:45,702 INFO L87 Difference]: Start difference. First operand 3835 states and 5466 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-16 02:29:45,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:45,903 INFO L93 Difference]: Finished difference Result 11103 states and 15986 transitions. [2021-12-16 02:29:45,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 02:29:45,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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 111 [2021-12-16 02:29:45,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:45,929 INFO L225 Difference]: With dead ends: 11103 [2021-12-16 02:29:45,929 INFO L226 Difference]: Without dead ends: 7281 [2021-12-16 02:29:45,938 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 126 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-16 02:29:45,939 INFO L933 BasicCegarLoop]: 349 mSDtfsCounter, 152 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 540 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-16 02:29:45,940 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 540 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 02:29:45,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7281 states. [2021-12-16 02:29:46,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7281 to 7281. [2021-12-16 02:29:46,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7281 states, 6119 states have (on average 1.41885929073378) internal successors, (8682), 6204 states have internal predecessors, (8682), 677 states have call successors, (677), 421 states have call predecessors, (677), 484 states have return successors, (1008), 671 states have call predecessors, (1008), 675 states have call successors, (1008) [2021-12-16 02:29:46,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7281 states to 7281 states and 10367 transitions. [2021-12-16 02:29:46,260 INFO L78 Accepts]: Start accepts. Automaton has 7281 states and 10367 transitions. Word has length 111 [2021-12-16 02:29:46,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:46,261 INFO L470 AbstractCegarLoop]: Abstraction has 7281 states and 10367 transitions. [2021-12-16 02:29:46,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-16 02:29:46,261 INFO L276 IsEmpty]: Start isEmpty. Operand 7281 states and 10367 transitions. [2021-12-16 02:29:46,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-12-16 02:29:46,272 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:46,273 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, 1] [2021-12-16 02:29:46,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-16 02:29:46,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 02:29:46,507 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:46,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:46,508 INFO L85 PathProgramCache]: Analyzing trace with hash 142639029, now seen corresponding path program 1 times [2021-12-16 02:29:46,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:46,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690840608] [2021-12-16 02:29:46,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:46,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:46,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:46,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 02:29:46,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:46,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 02:29:46,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:46,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 02:29:46,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:46,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 02:29:46,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:46,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 02:29:46,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:46,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-16 02:29:46,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:46,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:29:46,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:46,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-16 02:29:46,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:46,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:29:46,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:46,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-16 02:29:46,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:46,619 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-16 02:29:46,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:46,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690840608] [2021-12-16 02:29:46,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690840608] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 02:29:46,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488336236] [2021-12-16 02:29:46,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:46,620 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 02:29:46,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 02:29:46,621 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-16 02:29:46,671 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-16 02:29:46,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:46,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 02:29:46,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 02:29:46,893 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-16 02:29:46,893 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 02:29:46,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488336236] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:29:46,893 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 02:29:46,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2021-12-16 02:29:46,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893340890] [2021-12-16 02:29:46,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:46,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 02:29:46,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:46,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 02:29:46,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-16 02:29:46,895 INFO L87 Difference]: Start difference. First operand 7281 states and 10367 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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-16 02:29:47,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:47,302 INFO L93 Difference]: Finished difference Result 21501 states and 30820 transitions. [2021-12-16 02:29:47,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 02:29:47,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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 143 [2021-12-16 02:29:47,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:47,345 INFO L225 Difference]: With dead ends: 21501 [2021-12-16 02:29:47,345 INFO L226 Difference]: Without dead ends: 14237 [2021-12-16 02:29:47,418 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 162 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-16 02:29:47,418 INFO L933 BasicCegarLoop]: 224 mSDtfsCounter, 109 mSDsluCounter, 169 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-16 02:29:47,419 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-16 02:29:47,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14237 states. [2021-12-16 02:29:47,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14237 to 14089. [2021-12-16 02:29:47,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14089 states, 11843 states have (on average 1.4141687072532299) internal successors, (16748), 12010 states have internal predecessors, (16748), 1291 states have call successors, (1291), 827 states have call predecessors, (1291), 954 states have return successors, (1906), 1267 states have call predecessors, (1906), 1289 states have call successors, (1906) [2021-12-16 02:29:47,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14089 states to 14089 states and 19945 transitions. [2021-12-16 02:29:47,909 INFO L78 Accepts]: Start accepts. Automaton has 14089 states and 19945 transitions. Word has length 143 [2021-12-16 02:29:47,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:47,910 INFO L470 AbstractCegarLoop]: Abstraction has 14089 states and 19945 transitions. [2021-12-16 02:29:47,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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-16 02:29:47,910 INFO L276 IsEmpty]: Start isEmpty. Operand 14089 states and 19945 transitions. [2021-12-16 02:29:47,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-12-16 02:29:47,937 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:47,938 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-16 02:29:47,968 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-16 02:29:48,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 02:29:48,169 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:48,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:48,170 INFO L85 PathProgramCache]: Analyzing trace with hash 28732006, now seen corresponding path program 1 times [2021-12-16 02:29:48,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:48,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522898012] [2021-12-16 02:29:48,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:48,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:48,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:48,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 02:29:48,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:48,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 02:29:48,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:48,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 02:29:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:48,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 02:29:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:48,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 02:29:48,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:48,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-16 02:29:48,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:48,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-16 02:29:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:48,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:29:48,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:48,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-12-16 02:29:48,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:48,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:29:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:48,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-16 02:29:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:48,252 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-16 02:29:48,252 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:48,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522898012] [2021-12-16 02:29:48,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522898012] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 02:29:48,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756409537] [2021-12-16 02:29:48,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:48,254 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 02:29:48,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 02:29:48,268 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-16 02:29:48,269 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-16 02:29:48,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:48,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 02:29:48,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 02:29:48,571 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-16 02:29:48,572 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 02:29:48,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756409537] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:29:48,572 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 02:29:48,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-16 02:29:48,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491774853] [2021-12-16 02:29:48,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:48,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 02:29:48,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:48,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 02:29:48,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-16 02:29:48,573 INFO L87 Difference]: Start difference. First operand 14089 states and 19945 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, (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-16 02:29:49,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:49,133 INFO L93 Difference]: Finished difference Result 23933 states and 34197 transitions. [2021-12-16 02:29:49,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 02:29:49,134 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, (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-16 02:29:49,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:49,175 INFO L225 Difference]: With dead ends: 23933 [2021-12-16 02:29:49,175 INFO L226 Difference]: Without dead ends: 12763 [2021-12-16 02:29:49,204 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-16 02:29:49,205 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 128 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 224 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-16 02:29:49,205 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 224 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 02:29:49,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12763 states. [2021-12-16 02:29:49,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12763 to 9575. [2021-12-16 02:29:49,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9575 states, 8081 states have (on average 1.3656725652765747) internal successors, (11036), 8170 states have internal predecessors, (11036), 851 states have call successors, (851), 579 states have call predecessors, (851), 642 states have return successors, (1120), 833 states have call predecessors, (1120), 849 states have call successors, (1120) [2021-12-16 02:29:49,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9575 states to 9575 states and 13007 transitions. [2021-12-16 02:29:49,699 INFO L78 Accepts]: Start accepts. Automaton has 9575 states and 13007 transitions. Word has length 160 [2021-12-16 02:29:49,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:49,699 INFO L470 AbstractCegarLoop]: Abstraction has 9575 states and 13007 transitions. [2021-12-16 02:29:49,699 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, (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-16 02:29:49,700 INFO L276 IsEmpty]: Start isEmpty. Operand 9575 states and 13007 transitions. [2021-12-16 02:29:49,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-12-16 02:29:49,713 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:49,713 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, 1] [2021-12-16 02:29:49,730 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-16 02:29:49,930 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 02:29:49,931 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:49,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:49,931 INFO L85 PathProgramCache]: Analyzing trace with hash -124896125, now seen corresponding path program 1 times [2021-12-16 02:29:49,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:49,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945999683] [2021-12-16 02:29:49,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:49,931 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:49,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:49,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 02:29:49,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:49,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 02:29:49,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:49,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 02:29:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:49,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 02:29:49,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:49,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 02:29:49,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:49,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-16 02:29:49,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:49,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-16 02:29:49,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:49,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:29:49,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:49,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-12-16 02:29:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:50,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:29:50,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:50,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-16 02:29:50,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:50,008 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-16 02:29:50,008 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:50,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945999683] [2021-12-16 02:29:50,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945999683] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 02:29:50,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195853488] [2021-12-16 02:29:50,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:50,009 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 02:29:50,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 02:29:50,010 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-16 02:29:50,011 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-16 02:29:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:50,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 02:29:50,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 02:29:50,285 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-16 02:29:50,285 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 02:29:50,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195853488] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:29:50,285 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 02:29:50,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-16 02:29:50,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643410126] [2021-12-16 02:29:50,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:50,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 02:29:50,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:50,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 02:29:50,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-16 02:29:50,287 INFO L87 Difference]: Start difference. First operand 9575 states and 13007 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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-16 02:29:50,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:50,672 INFO L93 Difference]: Finished difference Result 17866 states and 24227 transitions. [2021-12-16 02:29:50,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 02:29:50,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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-16 02:29:50,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:50,700 INFO L225 Difference]: With dead ends: 17866 [2021-12-16 02:29:50,700 INFO L226 Difference]: Without dead ends: 10555 [2021-12-16 02:29:50,718 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-16 02:29:50,720 INFO L933 BasicCegarLoop]: 215 mSDtfsCounter, 129 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 391 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-16 02:29:50,720 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 391 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 02:29:50,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10555 states. [2021-12-16 02:29:51,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10555 to 10473. [2021-12-16 02:29:51,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10473 states, 8907 states have (on average 1.338722353205344) internal successors, (11924), 8996 states have internal predecessors, (11924), 865 states have call successors, (865), 637 states have call predecessors, (865), 700 states have return successors, (1192), 847 states have call predecessors, (1192), 863 states have call successors, (1192) [2021-12-16 02:29:51,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10473 states to 10473 states and 13981 transitions. [2021-12-16 02:29:51,163 INFO L78 Accepts]: Start accepts. Automaton has 10473 states and 13981 transitions. Word has length 160 [2021-12-16 02:29:51,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:51,164 INFO L470 AbstractCegarLoop]: Abstraction has 10473 states and 13981 transitions. [2021-12-16 02:29:51,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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-16 02:29:51,164 INFO L276 IsEmpty]: Start isEmpty. Operand 10473 states and 13981 transitions. [2021-12-16 02:29:51,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-16 02:29:51,178 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:51,178 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, 1] [2021-12-16 02:29:51,211 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-16 02:29:51,395 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,SelfDestructingSolverStorable21 [2021-12-16 02:29:51,395 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:51,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:51,396 INFO L85 PathProgramCache]: Analyzing trace with hash -402645848, now seen corresponding path program 1 times [2021-12-16 02:29:51,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:51,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113170151] [2021-12-16 02:29:51,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:51,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:51,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 02:29:51,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:51,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 02:29:51,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:51,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 02:29:51,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:51,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 02:29:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:51,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 02:29:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:51,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-16 02:29:51,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:51,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:29:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:51,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-16 02:29:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:51,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-16 02:29:51,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:51,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:29:51,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:51,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-16 02:29:51,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:51,473 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-16 02:29:51,473 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:51,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113170151] [2021-12-16 02:29:51,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113170151] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 02:29:51,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465855361] [2021-12-16 02:29:51,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:51,474 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 02:29:51,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 02:29:51,488 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-16 02:29:51,545 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-16 02:29:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:51,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 02:29:51,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 02:29:51,823 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-16 02:29:51,823 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 02:29:51,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465855361] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:29:51,823 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 02:29:51,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-16 02:29:51,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896815169] [2021-12-16 02:29:51,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:51,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 02:29:51,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:51,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 02:29:51,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-16 02:29:51,824 INFO L87 Difference]: Start difference. First operand 10473 states and 13981 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, (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-16 02:29:52,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:52,637 INFO L93 Difference]: Finished difference Result 30855 states and 41623 transitions. [2021-12-16 02:29:52,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 02:29:52,637 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, (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 161 [2021-12-16 02:29:52,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:52,698 INFO L225 Difference]: With dead ends: 30855 [2021-12-16 02:29:52,698 INFO L226 Difference]: Without dead ends: 20401 [2021-12-16 02:29:52,726 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 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-16 02:29:52,726 INFO L933 BasicCegarLoop]: 358 mSDtfsCounter, 161 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 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-16 02:29:52,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 546 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 02:29:52,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20401 states. [2021-12-16 02:29:53,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20401 to 20369. [2021-12-16 02:29:53,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20369 states, 17325 states have (on average 1.3277922077922077) internal successors, (23004), 17502 states have internal predecessors, (23004), 1671 states have call successors, (1671), 1245 states have call predecessors, (1671), 1372 states have return successors, (2710), 1637 states have call predecessors, (2710), 1669 states have call successors, (2710) [2021-12-16 02:29:53,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20369 states to 20369 states and 27385 transitions. [2021-12-16 02:29:53,674 INFO L78 Accepts]: Start accepts. Automaton has 20369 states and 27385 transitions. Word has length 161 [2021-12-16 02:29:53,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:53,675 INFO L470 AbstractCegarLoop]: Abstraction has 20369 states and 27385 transitions. [2021-12-16 02:29:53,675 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, (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-16 02:29:53,675 INFO L276 IsEmpty]: Start isEmpty. Operand 20369 states and 27385 transitions. [2021-12-16 02:29:53,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-16 02:29:53,701 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:53,701 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, 1] [2021-12-16 02:29:53,731 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-16 02:29:53,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-12-16 02:29:53,918 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:53,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:53,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1546394152, now seen corresponding path program 1 times [2021-12-16 02:29:53,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:53,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198969909] [2021-12-16 02:29:53,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:53,919 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:53,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 02:29:53,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:53,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 02:29:53,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:53,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 02:29:53,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:53,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 02:29:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:53,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 02:29:53,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:53,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-16 02:29:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:53,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:29:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:53,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-16 02:29:53,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:53,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-16 02:29:53,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:53,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:29:53,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:53,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-16 02:29:53,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:53,998 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-16 02:29:53,999 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:53,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198969909] [2021-12-16 02:29:53,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198969909] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 02:29:53,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232407997] [2021-12-16 02:29:53,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:53,999 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 02:29:54,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 02:29:54,000 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-16 02:29:54,002 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-16 02:29:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:54,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 02:29:54,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 02:29:54,311 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-16 02:29:54,312 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 02:29:54,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232407997] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:29:54,312 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 02:29:54,312 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-16 02:29:54,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665724054] [2021-12-16 02:29:54,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:54,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 02:29:54,313 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:54,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 02:29:54,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-16 02:29:54,314 INFO L87 Difference]: Start difference. First operand 20369 states and 27385 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, (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-16 02:29:55,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:55,020 INFO L93 Difference]: Finished difference Result 35707 states and 48988 transitions. [2021-12-16 02:29:55,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 02:29:55,021 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, (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 161 [2021-12-16 02:29:55,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:55,079 INFO L225 Difference]: With dead ends: 35707 [2021-12-16 02:29:55,079 INFO L226 Difference]: Without dead ends: 18455 [2021-12-16 02:29:55,114 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 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-16 02:29:55,114 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 123 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 222 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-16 02:29:55,114 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 222 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 02:29:55,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18455 states. [2021-12-16 02:29:55,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18455 to 14563. [2021-12-16 02:29:55,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14563 states, 12435 states have (on average 1.2913550462404504) internal successors, (16058), 12534 states have internal predecessors, (16058), 1175 states have call successors, (1175), 889 states have call predecessors, (1175), 952 states have return successors, (1786), 1147 states have call predecessors, (1786), 1173 states have call successors, (1786) [2021-12-16 02:29:55,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14563 states to 14563 states and 19019 transitions. [2021-12-16 02:29:55,826 INFO L78 Accepts]: Start accepts. Automaton has 14563 states and 19019 transitions. Word has length 161 [2021-12-16 02:29:55,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:55,827 INFO L470 AbstractCegarLoop]: Abstraction has 14563 states and 19019 transitions. [2021-12-16 02:29:55,827 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, (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-16 02:29:55,827 INFO L276 IsEmpty]: Start isEmpty. Operand 14563 states and 19019 transitions. [2021-12-16 02:29:55,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-16 02:29:55,839 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:55,839 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, 1] [2021-12-16 02:29:55,860 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-16 02:29:56,058 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,SelfDestructingSolverStorable23 [2021-12-16 02:29:56,058 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:56,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:56,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1993102869, now seen corresponding path program 1 times [2021-12-16 02:29:56,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:56,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137793173] [2021-12-16 02:29:56,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:56,059 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:56,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:56,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 02:29:56,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:56,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 02:29:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:56,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 02:29:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:56,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 02:29:56,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:56,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 02:29:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:56,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-16 02:29:56,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:56,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:29:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:56,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-16 02:29:56,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:56,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-16 02:29:56,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:56,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:29:56,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:56,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-16 02:29:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:56,136 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-16 02:29:56,136 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:56,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137793173] [2021-12-16 02:29:56,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137793173] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 02:29:56,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95559715] [2021-12-16 02:29:56,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:56,136 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 02:29:56,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 02:29:56,137 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-16 02:29:56,138 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-16 02:29:56,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:56,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 02:29:56,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 02:29:56,425 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-16 02:29:56,425 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 02:29:56,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95559715] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:29:56,425 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 02:29:56,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-16 02:29:56,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449696592] [2021-12-16 02:29:56,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:56,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 02:29:56,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:56,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 02:29:56,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-16 02:29:56,426 INFO L87 Difference]: Start difference. First operand 14563 states and 19019 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (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-16 02:29:57,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:29:57,328 INFO L93 Difference]: Finished difference Result 41571 states and 55031 transitions. [2021-12-16 02:29:57,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 02:29:57,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (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 161 [2021-12-16 02:29:57,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:29:57,423 INFO L225 Difference]: With dead ends: 41571 [2021-12-16 02:29:57,423 INFO L226 Difference]: Without dead ends: 27037 [2021-12-16 02:29:57,460 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 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-16 02:29:57,461 INFO L933 BasicCegarLoop]: 353 mSDtfsCounter, 148 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 538 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-16 02:29:57,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 538 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 02:29:57,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27037 states. [2021-12-16 02:29:58,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27037 to 27033. [2021-12-16 02:29:58,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27033 states, 23005 states have (on average 1.2800695500978048) internal successors, (29448), 23202 states have internal predecessors, (29448), 2235 states have call successors, (2235), 1665 states have call predecessors, (2235), 1792 states have return successors, (4024), 2181 states have call predecessors, (4024), 2233 states have call successors, (4024) [2021-12-16 02:29:58,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27033 states to 27033 states and 35707 transitions. [2021-12-16 02:29:58,950 INFO L78 Accepts]: Start accepts. Automaton has 27033 states and 35707 transitions. Word has length 161 [2021-12-16 02:29:58,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:29:58,951 INFO L470 AbstractCegarLoop]: Abstraction has 27033 states and 35707 transitions. [2021-12-16 02:29:58,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (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-16 02:29:58,952 INFO L276 IsEmpty]: Start isEmpty. Operand 27033 states and 35707 transitions. [2021-12-16 02:29:58,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-16 02:29:58,971 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:29:58,972 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, 1] [2021-12-16 02:29:58,990 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-16 02:29:59,186 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,SelfDestructingSolverStorable24 [2021-12-16 02:29:59,187 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:29:59,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:29:59,187 INFO L85 PathProgramCache]: Analyzing trace with hash -129116033, now seen corresponding path program 1 times [2021-12-16 02:29:59,187 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:29:59,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210095162] [2021-12-16 02:29:59,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:59,188 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:29:59,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:59,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 02:29:59,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:59,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 02:29:59,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:59,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 02:29:59,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:59,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 02:29:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:59,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 02:29:59,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:59,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-16 02:29:59,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:59,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-16 02:29:59,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:59,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:29:59,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:59,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-16 02:29:59,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:59,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:29:59,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:59,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-16 02:29:59,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:59,269 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-16 02:29:59,269 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:29:59,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210095162] [2021-12-16 02:29:59,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210095162] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 02:29:59,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665775249] [2021-12-16 02:29:59,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:29:59,270 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 02:29:59,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 02:29:59,284 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-16 02:29:59,333 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-16 02:29:59,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:29:59,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 02:29:59,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 02:29:59,591 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-16 02:29:59,591 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 02:29:59,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665775249] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:29:59,592 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 02:29:59,592 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-16 02:29:59,592 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035252582] [2021-12-16 02:29:59,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:29:59,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 02:29:59,593 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:29:59,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 02:29:59,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-16 02:29:59,594 INFO L87 Difference]: Start difference. First operand 27033 states and 35707 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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-16 02:30:00,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:30:00,849 INFO L93 Difference]: Finished difference Result 47817 states and 63249 transitions. [2021-12-16 02:30:00,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 02:30:00,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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 161 [2021-12-16 02:30:00,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:30:00,937 INFO L225 Difference]: With dead ends: 47817 [2021-12-16 02:30:00,937 INFO L226 Difference]: Without dead ends: 27429 [2021-12-16 02:30:00,980 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 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-16 02:30:00,980 INFO L933 BasicCegarLoop]: 227 mSDtfsCounter, 149 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 396 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-16 02:30:00,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 396 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 02:30:01,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27429 states. [2021-12-16 02:30:02,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27429 to 27033. [2021-12-16 02:30:02,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27033 states, 23005 states have (on average 1.272245164094762) internal successors, (29268), 23202 states have internal predecessors, (29268), 2235 states have call successors, (2235), 1665 states have call predecessors, (2235), 1792 states have return successors, (4024), 2181 states have call predecessors, (4024), 2233 states have call successors, (4024) [2021-12-16 02:30:02,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27033 states to 27033 states and 35527 transitions. [2021-12-16 02:30:02,325 INFO L78 Accepts]: Start accepts. Automaton has 27033 states and 35527 transitions. Word has length 161 [2021-12-16 02:30:02,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:30:02,325 INFO L470 AbstractCegarLoop]: Abstraction has 27033 states and 35527 transitions. [2021-12-16 02:30:02,325 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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-16 02:30:02,326 INFO L276 IsEmpty]: Start isEmpty. Operand 27033 states and 35527 transitions. [2021-12-16 02:30:02,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-16 02:30:02,344 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:30:02,344 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, 1] [2021-12-16 02:30:02,363 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-16 02:30:02,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 02:30:02,564 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:30:02,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:30:02,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1698954724, now seen corresponding path program 1 times [2021-12-16 02:30:02,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:30:02,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26336665] [2021-12-16 02:30:02,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:30:02,565 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:30:02,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:02,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 02:30:02,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:02,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 02:30:02,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:02,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 02:30:02,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:02,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 02:30:02,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:02,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 02:30:02,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:02,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-16 02:30:02,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:02,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-16 02:30:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:02,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:30:02,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:02,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-16 02:30:02,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:02,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:30:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:02,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-16 02:30:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:02,639 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-16 02:30:02,639 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:30:02,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26336665] [2021-12-16 02:30:02,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26336665] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 02:30:02,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748248926] [2021-12-16 02:30:02,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:30:02,640 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 02:30:02,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 02:30:02,641 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-16 02:30:02,660 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-16 02:30:02,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:02,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 02:30:02,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 02:30:02,967 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-16 02:30:02,967 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 02:30:02,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748248926] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:30:02,967 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 02:30:02,967 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-16 02:30:02,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123334696] [2021-12-16 02:30:02,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:30:02,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 02:30:02,968 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:30:02,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 02:30:02,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-16 02:30:02,968 INFO L87 Difference]: Start difference. First operand 27033 states and 35527 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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-16 02:30:03,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:30:03,969 INFO L93 Difference]: Finished difference Result 48117 states and 63397 transitions. [2021-12-16 02:30:03,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 02:30:03,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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 161 [2021-12-16 02:30:03,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:30:04,058 INFO L225 Difference]: With dead ends: 48117 [2021-12-16 02:30:04,058 INFO L226 Difference]: Without dead ends: 27729 [2021-12-16 02:30:04,102 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 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-16 02:30:04,102 INFO L933 BasicCegarLoop]: 243 mSDtfsCounter, 148 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 414 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-16 02:30:04,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 414 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 02:30:04,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27729 states. [2021-12-16 02:30:05,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27729 to 26973. [2021-12-16 02:30:05,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26973 states, 22945 states have (on average 1.265112224885596) internal successors, (29028), 23142 states have internal predecessors, (29028), 2235 states have call successors, (2235), 1665 states have call predecessors, (2235), 1792 states have return successors, (4024), 2181 states have call predecessors, (4024), 2233 states have call successors, (4024) [2021-12-16 02:30:05,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26973 states to 26973 states and 35287 transitions. [2021-12-16 02:30:05,604 INFO L78 Accepts]: Start accepts. Automaton has 26973 states and 35287 transitions. Word has length 161 [2021-12-16 02:30:05,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:30:05,605 INFO L470 AbstractCegarLoop]: Abstraction has 26973 states and 35287 transitions. [2021-12-16 02:30:05,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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-16 02:30:05,605 INFO L276 IsEmpty]: Start isEmpty. Operand 26973 states and 35287 transitions. [2021-12-16 02:30:05,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-16 02:30:05,663 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:30:05,663 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, 1] [2021-12-16 02:30:05,696 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-16 02:30:05,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-12-16 02:30:05,899 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:30:05,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:30:05,899 INFO L85 PathProgramCache]: Analyzing trace with hash 590012799, now seen corresponding path program 1 times [2021-12-16 02:30:05,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:30:05,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478115036] [2021-12-16 02:30:05,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:30:05,900 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:30:05,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:05,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 02:30:05,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:05,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 02:30:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:05,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 02:30:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:05,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 02:30:05,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:05,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 02:30:05,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:05,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-16 02:30:05,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:05,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-16 02:30:05,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:05,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:30:05,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:05,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-16 02:30:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:05,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:30:05,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:05,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-16 02:30:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:05,955 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-16 02:30:05,955 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:30:05,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478115036] [2021-12-16 02:30:05,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478115036] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:30:05,955 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:30:05,955 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 02:30:05,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311103790] [2021-12-16 02:30:05,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:30:05,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 02:30:05,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:30:05,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 02:30:05,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 02:30:05,957 INFO L87 Difference]: Start difference. First operand 26973 states and 35287 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 3 states have internal predecessors, (76), 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-16 02:30:07,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:30:07,269 INFO L93 Difference]: Finished difference Result 52471 states and 68016 transitions. [2021-12-16 02:30:07,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 02:30:07,270 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 3 states have internal predecessors, (76), 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 161 [2021-12-16 02:30:07,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:30:07,336 INFO L225 Difference]: With dead ends: 52471 [2021-12-16 02:30:07,336 INFO L226 Difference]: Without dead ends: 25523 [2021-12-16 02:30:07,381 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-16 02:30:07,382 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 292 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 02:30:07,382 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [308 Valid, 344 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 02:30:07,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25523 states. [2021-12-16 02:30:08,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25523 to 23693. [2021-12-16 02:30:08,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23693 states, 20287 states have (on average 1.2658352639621433) internal successors, (25680), 20704 states have internal predecessors, (25680), 1663 states have call successors, (1663), 1249 states have call predecessors, (1663), 1742 states have return successors, (3259), 1747 states have call predecessors, (3259), 1661 states have call successors, (3259) [2021-12-16 02:30:08,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23693 states to 23693 states and 30602 transitions. [2021-12-16 02:30:08,719 INFO L78 Accepts]: Start accepts. Automaton has 23693 states and 30602 transitions. Word has length 161 [2021-12-16 02:30:08,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:30:08,720 INFO L470 AbstractCegarLoop]: Abstraction has 23693 states and 30602 transitions. [2021-12-16 02:30:08,720 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 3 states have internal predecessors, (76), 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-16 02:30:08,720 INFO L276 IsEmpty]: Start isEmpty. Operand 23693 states and 30602 transitions. [2021-12-16 02:30:08,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-16 02:30:08,734 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:30:08,734 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, 1] [2021-12-16 02:30:08,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-16 02:30:08,735 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:30:08,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:30:08,735 INFO L85 PathProgramCache]: Analyzing trace with hash -806789094, now seen corresponding path program 1 times [2021-12-16 02:30:08,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:30:08,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034952158] [2021-12-16 02:30:08,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:30:08,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:30:08,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:08,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 02:30:08,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:08,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 02:30:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:08,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 02:30:08,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:08,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 02:30:08,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:08,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 02:30:08,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:08,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-16 02:30:08,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:08,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-16 02:30:08,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:08,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:30:08,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:08,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-16 02:30:08,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:08,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:30:08,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:08,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-16 02:30:08,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:08,828 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-16 02:30:08,828 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:30:08,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034952158] [2021-12-16 02:30:08,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034952158] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:30:08,828 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:30:08,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 02:30:08,829 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692354006] [2021-12-16 02:30:08,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:30:08,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 02:30:08,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:30:08,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 02:30:08,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 02:30:08,830 INFO L87 Difference]: Start difference. First operand 23693 states and 30602 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 3 states have internal predecessors, (79), 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-16 02:30:09,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:30:09,871 INFO L93 Difference]: Finished difference Result 43029 states and 55409 transitions. [2021-12-16 02:30:09,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 02:30:09,872 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 3 states have internal predecessors, (79), 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 161 [2021-12-16 02:30:09,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:30:09,924 INFO L225 Difference]: With dead ends: 43029 [2021-12-16 02:30:09,925 INFO L226 Difference]: Without dead ends: 19353 [2021-12-16 02:30:09,955 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-16 02:30:09,955 INFO L933 BasicCegarLoop]: 188 mSDtfsCounter, 292 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 02:30:09,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [308 Valid, 342 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 02:30:09,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19353 states. [2021-12-16 02:30:10,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19353 to 17647. [2021-12-16 02:30:10,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17647 states, 15147 states have (on average 1.2758962170726877) internal successors, (19326), 15438 states have internal predecessors, (19326), 1229 states have call successors, (1229), 929 states have call predecessors, (1229), 1270 states have return successors, (2253), 1283 states have call predecessors, (2253), 1227 states have call successors, (2253) [2021-12-16 02:30:10,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17647 states to 17647 states and 22808 transitions. [2021-12-16 02:30:10,743 INFO L78 Accepts]: Start accepts. Automaton has 17647 states and 22808 transitions. Word has length 161 [2021-12-16 02:30:10,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:30:10,744 INFO L470 AbstractCegarLoop]: Abstraction has 17647 states and 22808 transitions. [2021-12-16 02:30:10,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 3 states have internal predecessors, (79), 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-16 02:30:10,744 INFO L276 IsEmpty]: Start isEmpty. Operand 17647 states and 22808 transitions. [2021-12-16 02:30:10,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-12-16 02:30:10,754 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:30:10,755 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, 1] [2021-12-16 02:30:10,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-16 02:30:10,755 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:30:10,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:30:10,755 INFO L85 PathProgramCache]: Analyzing trace with hash -994779915, now seen corresponding path program 1 times [2021-12-16 02:30:10,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:30:10,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341266204] [2021-12-16 02:30:10,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:30:10,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:30:10,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:10,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 02:30:10,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:10,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 02:30:10,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:10,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 02:30:10,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:10,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 02:30:10,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:10,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 02:30:10,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:10,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-16 02:30:10,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:10,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-16 02:30:10,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:10,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:30:10,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:10,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-16 02:30:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:10,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:30:10,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:10,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-12-16 02:30:10,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:10,829 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-16 02:30:10,829 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:30:10,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341266204] [2021-12-16 02:30:10,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341266204] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 02:30:10,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559426805] [2021-12-16 02:30:10,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:30:10,830 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 02:30:10,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 02:30:10,844 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-16 02:30:10,851 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-16 02:30:10,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:10,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 02:30:10,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 02:30:11,137 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-16 02:30:11,138 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 02:30:11,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559426805] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:30:11,138 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 02:30:11,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-16 02:30:11,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4420714] [2021-12-16 02:30:11,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:30:11,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 02:30:11,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:30:11,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 02:30:11,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-16 02:30:11,139 INFO L87 Difference]: Start difference. First operand 17647 states and 22808 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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-16 02:30:11,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:30:11,864 INFO L93 Difference]: Finished difference Result 29499 states and 39318 transitions. [2021-12-16 02:30:11,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 02:30:11,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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 163 [2021-12-16 02:30:11,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:30:11,914 INFO L225 Difference]: With dead ends: 29499 [2021-12-16 02:30:11,915 INFO L226 Difference]: Without dead ends: 17731 [2021-12-16 02:30:11,946 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-16 02:30:11,947 INFO L933 BasicCegarLoop]: 318 mSDtfsCounter, 140 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 486 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-16 02:30:11,947 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 486 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 02:30:11,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17731 states. [2021-12-16 02:30:12,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17731 to 17647. [2021-12-16 02:30:12,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17647 states, 15147 states have (on average 1.2537136066547832) internal successors, (18990), 15438 states have internal predecessors, (18990), 1229 states have call successors, (1229), 929 states have call predecessors, (1229), 1270 states have return successors, (2253), 1283 states have call predecessors, (2253), 1227 states have call successors, (2253) [2021-12-16 02:30:12,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17647 states to 17647 states and 22472 transitions. [2021-12-16 02:30:12,715 INFO L78 Accepts]: Start accepts. Automaton has 17647 states and 22472 transitions. Word has length 163 [2021-12-16 02:30:12,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:30:12,716 INFO L470 AbstractCegarLoop]: Abstraction has 17647 states and 22472 transitions. [2021-12-16 02:30:12,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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-16 02:30:12,716 INFO L276 IsEmpty]: Start isEmpty. Operand 17647 states and 22472 transitions. [2021-12-16 02:30:12,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-12-16 02:30:12,725 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:30:12,726 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-16 02:30:12,747 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-16 02:30:12,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 02:30:12,948 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:30:12,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:30:12,948 INFO L85 PathProgramCache]: Analyzing trace with hash 337114389, now seen corresponding path program 1 times [2021-12-16 02:30:12,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:30:12,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675718424] [2021-12-16 02:30:12,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:30:12,949 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:30:12,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:12,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 02:30:12,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:12,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 02:30:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:12,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 02:30:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:13,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 02:30:13,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:13,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 02:30:13,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:13,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-16 02:30:13,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:13,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-16 02:30:13,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:13,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:30:13,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:13,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-16 02:30:13,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:13,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:30:13,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:13,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-12-16 02:30:13,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:13,063 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-16 02:30:13,063 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:30:13,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675718424] [2021-12-16 02:30:13,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675718424] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 02:30:13,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714183090] [2021-12-16 02:30:13,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:30:13,064 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 02:30:13,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 02:30:13,065 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-16 02:30:13,076 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-16 02:30:13,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:13,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 02:30:13,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 02:30:13,357 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-16 02:30:13,358 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 02:30:13,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714183090] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:30:13,358 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 02:30:13,358 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-16 02:30:13,358 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459562605] [2021-12-16 02:30:13,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:30:13,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 02:30:13,359 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:30:13,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 02:30:13,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-16 02:30:13,360 INFO L87 Difference]: Start difference. First operand 17647 states and 22472 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-16 02:30:14,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:30:14,255 INFO L93 Difference]: Finished difference Result 36251 states and 46981 transitions. [2021-12-16 02:30:14,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 02:30:14,255 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-16 02:30:14,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:30:14,305 INFO L225 Difference]: With dead ends: 36251 [2021-12-16 02:30:14,305 INFO L226 Difference]: Without dead ends: 18623 [2021-12-16 02:30:14,341 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-16 02:30:14,342 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 164 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 221 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-16 02:30:14,342 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 221 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 02:30:14,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18623 states. [2021-12-16 02:30:15,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18623 to 17919. [2021-12-16 02:30:15,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17919 states, 15419 states have (on average 1.2222582528049808) internal successors, (18846), 15710 states have internal predecessors, (18846), 1229 states have call successors, (1229), 929 states have call predecessors, (1229), 1270 states have return successors, (2143), 1283 states have call predecessors, (2143), 1227 states have call successors, (2143) [2021-12-16 02:30:15,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17919 states to 17919 states and 22218 transitions. [2021-12-16 02:30:15,111 INFO L78 Accepts]: Start accepts. Automaton has 17919 states and 22218 transitions. Word has length 163 [2021-12-16 02:30:15,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:30:15,111 INFO L470 AbstractCegarLoop]: Abstraction has 17919 states and 22218 transitions. [2021-12-16 02:30:15,112 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-16 02:30:15,112 INFO L276 IsEmpty]: Start isEmpty. Operand 17919 states and 22218 transitions. [2021-12-16 02:30:15,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-12-16 02:30:15,120 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:30:15,121 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-16 02:30:15,137 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-16 02:30:15,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 02:30:15,327 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:30:15,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:30:15,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1269839222, now seen corresponding path program 1 times [2021-12-16 02:30:15,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:30:15,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766251039] [2021-12-16 02:30:15,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:30:15,329 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:30:15,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:15,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 02:30:15,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:15,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 02:30:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:15,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 02:30:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:15,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 02:30:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:15,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 02:30:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:15,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-16 02:30:15,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:15,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-16 02:30:15,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:15,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:30:15,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:15,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-16 02:30:15,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:15,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:30:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:15,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-12-16 02:30:15,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:15,462 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-16 02:30:15,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:30:15,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766251039] [2021-12-16 02:30:15,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766251039] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 02:30:15,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153567534] [2021-12-16 02:30:15,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:30:15,463 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 02:30:15,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 02:30:15,465 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-16 02:30:15,467 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-16 02:30:15,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:15,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 02:30:15,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 02:30:15,756 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-16 02:30:15,757 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 02:30:15,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153567534] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:30:15,757 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 02:30:15,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-16 02:30:15,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752767377] [2021-12-16 02:30:15,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:30:15,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 02:30:15,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:30:15,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 02:30:15,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-16 02:30:15,759 INFO L87 Difference]: Start difference. First operand 17919 states and 22218 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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-16 02:30:16,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:30:16,540 INFO L93 Difference]: Finished difference Result 29995 states and 38252 transitions. [2021-12-16 02:30:16,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 02:30:16,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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 163 [2021-12-16 02:30:16,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:30:16,582 INFO L225 Difference]: With dead ends: 29995 [2021-12-16 02:30:16,582 INFO L226 Difference]: Without dead ends: 18003 [2021-12-16 02:30:16,605 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-16 02:30:16,605 INFO L933 BasicCegarLoop]: 336 mSDtfsCounter, 134 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 504 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-16 02:30:16,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 504 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 02:30:16,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18003 states. [2021-12-16 02:30:17,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18003 to 17919. [2021-12-16 02:30:17,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17919 states, 15419 states have (on average 1.1967053635125495) internal successors, (18452), 15710 states have internal predecessors, (18452), 1229 states have call successors, (1229), 929 states have call predecessors, (1229), 1270 states have return successors, (2143), 1283 states have call predecessors, (2143), 1227 states have call successors, (2143) [2021-12-16 02:30:17,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17919 states to 17919 states and 21824 transitions. [2021-12-16 02:30:17,392 INFO L78 Accepts]: Start accepts. Automaton has 17919 states and 21824 transitions. Word has length 163 [2021-12-16 02:30:17,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:30:17,392 INFO L470 AbstractCegarLoop]: Abstraction has 17919 states and 21824 transitions. [2021-12-16 02:30:17,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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-16 02:30:17,393 INFO L276 IsEmpty]: Start isEmpty. Operand 17919 states and 21824 transitions. [2021-12-16 02:30:17,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-12-16 02:30:17,401 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:30:17,402 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, 1] [2021-12-16 02:30:17,418 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-16 02:30:17,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 02:30:17,617 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:30:17,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:30:17,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1732528486, now seen corresponding path program 1 times [2021-12-16 02:30:17,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:30:17,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186520482] [2021-12-16 02:30:17,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:30:17,618 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:30:17,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:17,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 02:30:17,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:17,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 02:30:17,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:17,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 02:30:17,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:17,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 02:30:17,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:17,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 02:30:17,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:17,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-16 02:30:17,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:17,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-16 02:30:17,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:17,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:30:17,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:17,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-16 02:30:17,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:17,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:30:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:17,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-12-16 02:30:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:17,716 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-16 02:30:17,716 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:30:17,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186520482] [2021-12-16 02:30:17,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186520482] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 02:30:17,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292661960] [2021-12-16 02:30:17,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:30:17,716 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 02:30:17,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 02:30:17,730 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 02:30:17,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-12-16 02:30:17,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:17,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 02:30:17,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 02:30:18,020 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-16 02:30:18,020 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 02:30:18,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292661960] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:30:18,021 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 02:30:18,021 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-16 02:30:18,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686444413] [2021-12-16 02:30:18,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:30:18,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 02:30:18,021 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:30:18,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 02:30:18,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-16 02:30:18,022 INFO L87 Difference]: Start difference. First operand 17919 states and 21824 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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-16 02:30:18,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:30:18,708 INFO L93 Difference]: Finished difference Result 27115 states and 33784 transitions. [2021-12-16 02:30:18,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 02:30:18,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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 164 [2021-12-16 02:30:18,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:30:18,756 INFO L225 Difference]: With dead ends: 27115 [2021-12-16 02:30:18,756 INFO L226 Difference]: Without dead ends: 17951 [2021-12-16 02:30:18,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 185 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-16 02:30:18,781 INFO L933 BasicCegarLoop]: 316 mSDtfsCounter, 155 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 476 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-16 02:30:18,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 476 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 02:30:18,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17951 states. [2021-12-16 02:30:19,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17951 to 17919. [2021-12-16 02:30:19,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17919 states, 15419 states have (on average 1.185809715286335) internal successors, (18284), 15710 states have internal predecessors, (18284), 1229 states have call successors, (1229), 929 states have call predecessors, (1229), 1270 states have return successors, (2143), 1283 states have call predecessors, (2143), 1227 states have call successors, (2143) [2021-12-16 02:30:19,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17919 states to 17919 states and 21656 transitions. [2021-12-16 02:30:19,573 INFO L78 Accepts]: Start accepts. Automaton has 17919 states and 21656 transitions. Word has length 164 [2021-12-16 02:30:19,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:30:19,574 INFO L470 AbstractCegarLoop]: Abstraction has 17919 states and 21656 transitions. [2021-12-16 02:30:19,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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-16 02:30:19,574 INFO L276 IsEmpty]: Start isEmpty. Operand 17919 states and 21656 transitions. [2021-12-16 02:30:19,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-12-16 02:30:19,584 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:30:19,584 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, 1] [2021-12-16 02:30:19,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-12-16 02:30:19,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 02:30:19,804 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:30:19,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:30:19,804 INFO L85 PathProgramCache]: Analyzing trace with hash 117096205, now seen corresponding path program 1 times [2021-12-16 02:30:19,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:30:19,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053806090] [2021-12-16 02:30:19,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:30:19,805 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:30:19,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:19,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 02:30:19,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:19,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 02:30:19,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:19,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 02:30:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:19,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 02:30:19,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:19,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 02:30:19,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:19,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-16 02:30:19,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:19,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-16 02:30:19,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:19,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:30:19,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:19,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-16 02:30:19,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:19,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:30:19,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:19,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-16 02:30:19,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:19,914 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-16 02:30:19,915 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:30:19,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053806090] [2021-12-16 02:30:19,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053806090] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 02:30:19,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621878439] [2021-12-16 02:30:19,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:30:19,915 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 02:30:19,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 02:30:19,916 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 02:30:19,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-12-16 02:30:20,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:20,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 02:30:20,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 02:30:20,257 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-16 02:30:20,257 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 02:30:20,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621878439] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:30:20,257 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 02:30:20,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-16 02:30:20,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111902678] [2021-12-16 02:30:20,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:30:20,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 02:30:20,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:30:20,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 02:30:20,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-16 02:30:20,259 INFO L87 Difference]: Start difference. First operand 17919 states and 21656 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 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-16 02:30:21,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:30:21,238 INFO L93 Difference]: Finished difference Result 35783 states and 43413 transitions. [2021-12-16 02:30:21,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 02:30:21,239 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 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 165 [2021-12-16 02:30:21,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:30:21,279 INFO L225 Difference]: With dead ends: 35783 [2021-12-16 02:30:21,279 INFO L226 Difference]: Without dead ends: 17883 [2021-12-16 02:30:21,306 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 184 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-16 02:30:21,306 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 188 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 02:30:21,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 353 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 02:30:21,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17883 states. [2021-12-16 02:30:22,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17883 to 17883. [2021-12-16 02:30:22,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17883 states, 15383 states have (on average 1.1685626990834037) internal successors, (17976), 15674 states have internal predecessors, (17976), 1229 states have call successors, (1229), 929 states have call predecessors, (1229), 1270 states have return successors, (2143), 1283 states have call predecessors, (2143), 1227 states have call successors, (2143) [2021-12-16 02:30:22,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17883 states to 17883 states and 21348 transitions. [2021-12-16 02:30:22,126 INFO L78 Accepts]: Start accepts. Automaton has 17883 states and 21348 transitions. Word has length 165 [2021-12-16 02:30:22,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:30:22,127 INFO L470 AbstractCegarLoop]: Abstraction has 17883 states and 21348 transitions. [2021-12-16 02:30:22,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 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-16 02:30:22,127 INFO L276 IsEmpty]: Start isEmpty. Operand 17883 states and 21348 transitions. [2021-12-16 02:30:22,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-12-16 02:30:22,137 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:30:22,137 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, 1] [2021-12-16 02:30:22,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-12-16 02:30:22,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-12-16 02:30:22,352 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:30:22,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:30:22,352 INFO L85 PathProgramCache]: Analyzing trace with hash 605143311, now seen corresponding path program 1 times [2021-12-16 02:30:22,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:30:22,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004934819] [2021-12-16 02:30:22,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:30:22,353 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:30:22,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:22,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 02:30:22,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:22,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 02:30:22,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:22,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 02:30:22,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:22,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 02:30:22,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:22,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 02:30:22,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:22,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-16 02:30:22,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:22,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-16 02:30:22,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:22,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:30:22,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:22,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-16 02:30:22,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:22,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:30:22,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:22,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-16 02:30:22,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:22,427 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-16 02:30:22,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:30:22,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004934819] [2021-12-16 02:30:22,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004934819] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 02:30:22,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375150160] [2021-12-16 02:30:22,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:30:22,428 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 02:30:22,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 02:30:22,444 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 02:30:22,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-12-16 02:30:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:22,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-16 02:30:22,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 02:30:22,745 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-16 02:30:22,745 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 02:30:22,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375150160] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:30:22,745 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 02:30:22,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-16 02:30:22,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655544593] [2021-12-16 02:30:22,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:30:22,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 02:30:22,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:30:22,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 02:30:22,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 02:30:22,748 INFO L87 Difference]: Start difference. First operand 17883 states and 21348 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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-16 02:30:23,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:30:23,447 INFO L93 Difference]: Finished difference Result 30086 states and 36287 transitions. [2021-12-16 02:30:23,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 02:30:23,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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 165 [2021-12-16 02:30:23,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:30:23,473 INFO L225 Difference]: With dead ends: 30086 [2021-12-16 02:30:23,474 INFO L226 Difference]: Without dead ends: 12215 [2021-12-16 02:30:23,501 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 185 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-16 02:30:23,502 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 87 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 744 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-16 02:30:23,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 744 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 02:30:23,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12215 states. [2021-12-16 02:30:24,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12215 to 11533. [2021-12-16 02:30:24,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11533 states, 9847 states have (on average 1.1479638468569107) internal successors, (11304), 10029 states have internal predecessors, (11304), 834 states have call successors, (834), 637 states have call predecessors, (834), 851 states have return successors, (1320), 868 states have call predecessors, (1320), 832 states have call successors, (1320) [2021-12-16 02:30:24,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11533 states to 11533 states and 13458 transitions. [2021-12-16 02:30:24,044 INFO L78 Accepts]: Start accepts. Automaton has 11533 states and 13458 transitions. Word has length 165 [2021-12-16 02:30:24,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:30:24,044 INFO L470 AbstractCegarLoop]: Abstraction has 11533 states and 13458 transitions. [2021-12-16 02:30:24,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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-16 02:30:24,045 INFO L276 IsEmpty]: Start isEmpty. Operand 11533 states and 13458 transitions. [2021-12-16 02:30:24,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-12-16 02:30:24,050 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:30:24,050 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, 1] [2021-12-16 02:30:24,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-12-16 02:30:24,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-12-16 02:30:24,254 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:30:24,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:30:24,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1688836692, now seen corresponding path program 1 times [2021-12-16 02:30:24,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:30:24,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673831546] [2021-12-16 02:30:24,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:30:24,255 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:30:24,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:24,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 02:30:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:24,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 02:30:24,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:24,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 02:30:24,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:24,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 02:30:24,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:24,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 02:30:24,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:24,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-16 02:30:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:24,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-16 02:30:24,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:24,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:30:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:24,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-16 02:30:24,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:24,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:30:24,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:24,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-16 02:30:24,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:24,396 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-16 02:30:24,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:30:24,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673831546] [2021-12-16 02:30:24,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673831546] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 02:30:24,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042908204] [2021-12-16 02:30:24,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:30:24,397 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 02:30:24,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 02:30:24,405 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 02:30:24,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-12-16 02:30:24,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:24,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-16 02:30:24,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 02:30:24,718 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-16 02:30:24,718 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 02:30:24,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042908204] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:30:24,718 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 02:30:24,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-16 02:30:24,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841499180] [2021-12-16 02:30:24,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:30:24,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 02:30:24,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:30:24,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 02:30:24,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 02:30:24,720 INFO L87 Difference]: Start difference. First operand 11533 states and 13458 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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-16 02:30:25,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:30:25,270 INFO L93 Difference]: Finished difference Result 21320 states and 25206 transitions. [2021-12-16 02:30:25,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 02:30:25,271 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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 165 [2021-12-16 02:30:25,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:30:25,292 INFO L225 Difference]: With dead ends: 21320 [2021-12-16 02:30:25,292 INFO L226 Difference]: Without dead ends: 9799 [2021-12-16 02:30:25,307 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-16 02:30:25,310 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 49 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 730 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-16 02:30:25,311 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 730 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 02:30:25,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9799 states. [2021-12-16 02:30:25,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9799 to 9567. [2021-12-16 02:30:25,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9567 states, 8137 states have (on average 1.1297775592970383) internal successors, (9193), 8277 states have internal predecessors, (9193), 715 states have call successors, (715), 541 states have call predecessors, (715), 714 states have return successors, (1045), 750 states have call predecessors, (1045), 713 states have call successors, (1045) [2021-12-16 02:30:25,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9567 states to 9567 states and 10953 transitions. [2021-12-16 02:30:25,912 INFO L78 Accepts]: Start accepts. Automaton has 9567 states and 10953 transitions. Word has length 165 [2021-12-16 02:30:25,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:30:25,913 INFO L470 AbstractCegarLoop]: Abstraction has 9567 states and 10953 transitions. [2021-12-16 02:30:25,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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-16 02:30:25,913 INFO L276 IsEmpty]: Start isEmpty. Operand 9567 states and 10953 transitions. [2021-12-16 02:30:25,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-12-16 02:30:25,918 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:30:25,918 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, 1] [2021-12-16 02:30:25,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-12-16 02:30:26,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 02:30:26,135 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:30:26,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:30:26,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1857225114, now seen corresponding path program 1 times [2021-12-16 02:30:26,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:30:26,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165342441] [2021-12-16 02:30:26,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:30:26,137 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:30:26,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:26,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 02:30:26,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:26,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 02:30:26,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:26,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 02:30:26,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:26,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 02:30:26,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:26,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 02:30:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:26,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-16 02:30:26,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:26,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-16 02:30:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:26,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:30:26,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:26,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-16 02:30:26,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:26,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:30:26,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:26,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-16 02:30:26,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:26,253 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-16 02:30:26,253 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:30:26,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165342441] [2021-12-16 02:30:26,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165342441] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 02:30:26,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612564952] [2021-12-16 02:30:26,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:30:26,253 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 02:30:26,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 02:30:26,263 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 02:30:26,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-12-16 02:30:26,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:26,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-16 02:30:26,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 02:30:26,568 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-16 02:30:26,568 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 02:30:26,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612564952] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:30:26,568 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 02:30:26,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-16 02:30:26,568 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286306640] [2021-12-16 02:30:26,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:30:26,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 02:30:26,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:30:26,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 02:30:26,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 02:30:26,569 INFO L87 Difference]: Start difference. First operand 9567 states and 10953 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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-16 02:30:26,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:30:26,855 INFO L93 Difference]: Finished difference Result 14294 states and 16433 transitions. [2021-12-16 02:30:26,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 02:30:26,856 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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 165 [2021-12-16 02:30:26,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:30:26,864 INFO L225 Difference]: With dead ends: 14294 [2021-12-16 02:30:26,864 INFO L226 Difference]: Without dead ends: 2852 [2021-12-16 02:30:26,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 185 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-16 02:30:26,877 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 10 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 715 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-16 02:30:26,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 715 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 02:30:26,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2021-12-16 02:30:27,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2852. [2021-12-16 02:30:27,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2852 states, 2421 states have (on average 1.103676166873193) internal successors, (2672), 2442 states have internal predecessors, (2672), 242 states have call successors, (242), 173 states have call predecessors, (242), 188 states have return successors, (265), 238 states have call predecessors, (265), 240 states have call successors, (265) [2021-12-16 02:30:27,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3179 transitions. [2021-12-16 02:30:27,006 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3179 transitions. Word has length 165 [2021-12-16 02:30:27,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:30:27,007 INFO L470 AbstractCegarLoop]: Abstraction has 2852 states and 3179 transitions. [2021-12-16 02:30:27,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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-16 02:30:27,007 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3179 transitions. [2021-12-16 02:30:27,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2021-12-16 02:30:27,009 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:30:27,010 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] [2021-12-16 02:30:27,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2021-12-16 02:30:27,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 02:30:27,227 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:30:27,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:30:27,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1928071536, now seen corresponding path program 1 times [2021-12-16 02:30:27,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:30:27,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369932742] [2021-12-16 02:30:27,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:30:27,228 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:30:27,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:27,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 02:30:27,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:27,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 02:30:27,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:27,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 02:30:27,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:27,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 02:30:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:27,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 02:30:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:27,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-16 02:30:27,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:27,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-16 02:30:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:27,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:30:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:27,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-16 02:30:27,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:27,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:30:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:27,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2021-12-16 02:30:27,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:27,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:30:27,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:27,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2021-12-16 02:30:27,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:27,416 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-16 02:30:27,416 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:30:27,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369932742] [2021-12-16 02:30:27,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369932742] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:30:27,417 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:30:27,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 02:30:27,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403213567] [2021-12-16 02:30:27,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:30:27,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 02:30:27,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:30:27,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 02:30:27,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 02:30:27,419 INFO L87 Difference]: Start difference. First operand 2852 states and 3179 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 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-16 02:30:28,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:30:28,104 INFO L93 Difference]: Finished difference Result 3030 states and 3364 transitions. [2021-12-16 02:30:28,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-16 02:30:28,105 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 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 203 [2021-12-16 02:30:28,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:30:28,110 INFO L225 Difference]: With dead ends: 3030 [2021-12-16 02:30:28,110 INFO L226 Difference]: Without dead ends: 3027 [2021-12-16 02:30:28,111 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-16 02:30:28,111 INFO L933 BasicCegarLoop]: 327 mSDtfsCounter, 677 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 906 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-16 02:30:28,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [710 Valid, 906 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-16 02:30:28,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3027 states. [2021-12-16 02:30:28,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3027 to 2851. [2021-12-16 02:30:28,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2851 states, 2421 states have (on average 1.1024370095002065) internal successors, (2669), 2441 states have internal predecessors, (2669), 241 states have call successors, (241), 173 states have call predecessors, (241), 188 states have return successors, (265), 238 states have call predecessors, (265), 240 states have call successors, (265) [2021-12-16 02:30:28,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2851 states to 2851 states and 3175 transitions. [2021-12-16 02:30:28,241 INFO L78 Accepts]: Start accepts. Automaton has 2851 states and 3175 transitions. Word has length 203 [2021-12-16 02:30:28,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:30:28,241 INFO L470 AbstractCegarLoop]: Abstraction has 2851 states and 3175 transitions. [2021-12-16 02:30:28,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 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-16 02:30:28,241 INFO L276 IsEmpty]: Start isEmpty. Operand 2851 states and 3175 transitions. [2021-12-16 02:30:28,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2021-12-16 02:30:28,244 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:30:28,244 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-16 02:30:28,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-12-16 02:30:28,244 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:30:28,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:30:28,245 INFO L85 PathProgramCache]: Analyzing trace with hash 704894808, now seen corresponding path program 1 times [2021-12-16 02:30:28,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:30:28,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052045273] [2021-12-16 02:30:28,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:30:28,245 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:30:28,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:28,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-16 02:30:28,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:28,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 02:30:28,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:28,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 02:30:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:28,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 02:30:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:28,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 02:30:28,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:28,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-16 02:30:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:28,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-16 02:30:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:28,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:30:28,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:28,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-16 02:30:28,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:28,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:30:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:28,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2021-12-16 02:30:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:28,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 02:30:28,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:28,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2021-12-16 02:30:28,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:30:28,304 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-16 02:30:28,304 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:30:28,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052045273] [2021-12-16 02:30:28,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052045273] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:30:28,304 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:30:28,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 02:30:28,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528850595] [2021-12-16 02:30:28,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:30:28,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 02:30:28,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:30:28,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 02:30:28,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 02:30:28,306 INFO L87 Difference]: Start difference. First operand 2851 states and 3175 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 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-16 02:30:28,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 02:30:28,647 INFO L93 Difference]: Finished difference Result 4431 states and 5011 transitions. [2021-12-16 02:30:28,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 02:30:28,648 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 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 207 [2021-12-16 02:30:28,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 02:30:28,655 INFO L225 Difference]: With dead ends: 4431 [2021-12-16 02:30:28,655 INFO L226 Difference]: Without dead ends: 3375 [2021-12-16 02:30:28,657 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-16 02:30:28,657 INFO L933 BasicCegarLoop]: 233 mSDtfsCounter, 195 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 588 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-16 02:30:28,657 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 588 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 02:30:28,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3375 states. [2021-12-16 02:30:28,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3375 to 2854. [2021-12-16 02:30:28,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2854 states, 2424 states have (on average 1.1023102310231023) internal successors, (2672), 2444 states have internal predecessors, (2672), 241 states have call successors, (241), 173 states have call predecessors, (241), 188 states have return successors, (265), 238 states have call predecessors, (265), 240 states have call successors, (265) [2021-12-16 02:30:28,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2854 states to 2854 states and 3178 transitions. [2021-12-16 02:30:28,791 INFO L78 Accepts]: Start accepts. Automaton has 2854 states and 3178 transitions. Word has length 207 [2021-12-16 02:30:28,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 02:30:28,792 INFO L470 AbstractCegarLoop]: Abstraction has 2854 states and 3178 transitions. [2021-12-16 02:30:28,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 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-16 02:30:28,792 INFO L276 IsEmpty]: Start isEmpty. Operand 2854 states and 3178 transitions. [2021-12-16 02:30:28,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2021-12-16 02:30:28,795 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 02:30:28,795 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, 1] [2021-12-16 02:30:28,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-12-16 02:30:28,795 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 02:30:28,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:30:28,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1606001686, now seen corresponding path program 1 times [2021-12-16 02:30:28,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:30:28,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669536688] [2021-12-16 02:30:28,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:30:28,796 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:30:28,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 02:30:28,807 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 02:30:28,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 02:30:28,867 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 02:30:28,867 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-16 02:30:28,868 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-12-16 02:30:28,869 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-12-16 02:30:28,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-12-16 02:30:28,871 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:30:28,874 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-16 02:30:28,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 02:30:28 BoogieIcfgContainer [2021-12-16 02:30:28,971 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-16 02:30:28,972 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-16 02:30:28,972 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-16 02:30:28,972 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-16 02:30:28,972 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 02:29:34" (3/4) ... [2021-12-16 02:30:28,974 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-16 02:30:29,060 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-16 02:30:29,060 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-16 02:30:29,060 INFO L158 Benchmark]: Toolchain (without parser) took 56163.38ms. Allocated memory was 102.8MB in the beginning and 7.1GB in the end (delta: 7.0GB). Free memory was 73.9MB in the beginning and 5.0GB in the end (delta: -4.9GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2021-12-16 02:30:29,061 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 102.8MB. Free memory was 61.0MB in the beginning and 61.0MB in the end (delta: 41.2kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 02:30:29,061 INFO L158 Benchmark]: CACSL2BoogieTranslator took 467.52ms. Allocated memory was 102.8MB in the beginning and 123.7MB in the end (delta: 21.0MB). Free memory was 73.6MB in the beginning and 94.3MB in the end (delta: -20.6MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. [2021-12-16 02:30:29,061 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.09ms. Allocated memory is still 123.7MB. Free memory was 94.3MB in the beginning and 91.3MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 02:30:29,061 INFO L158 Benchmark]: Boogie Preprocessor took 44.72ms. Allocated memory is still 123.7MB. Free memory was 91.3MB in the beginning and 88.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 02:30:29,061 INFO L158 Benchmark]: RCFGBuilder took 561.72ms. Allocated memory is still 123.7MB. Free memory was 88.8MB in the beginning and 65.4MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-12-16 02:30:29,062 INFO L158 Benchmark]: TraceAbstraction took 54937.11ms. Allocated memory was 123.7MB in the beginning and 7.1GB in the end (delta: 7.0GB). Free memory was 64.9MB in the beginning and 5.0GB in the end (delta: -4.9GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2021-12-16 02:30:29,062 INFO L158 Benchmark]: Witness Printer took 88.51ms. Allocated memory is still 7.1GB. Free memory was 5.0GB in the beginning and 5.0GB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2021-12-16 02:30:29,063 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.13ms. Allocated memory is still 102.8MB. Free memory was 61.0MB in the beginning and 61.0MB in the end (delta: 41.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 467.52ms. Allocated memory was 102.8MB in the beginning and 123.7MB in the end (delta: 21.0MB). Free memory was 73.6MB in the beginning and 94.3MB in the end (delta: -20.6MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.09ms. Allocated memory is still 123.7MB. Free memory was 94.3MB in the beginning and 91.3MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.72ms. Allocated memory is still 123.7MB. Free memory was 91.3MB in the beginning and 88.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 561.72ms. Allocated memory is still 123.7MB. Free memory was 88.8MB in the beginning and 65.4MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 54937.11ms. Allocated memory was 123.7MB in the beginning and 7.1GB in the end (delta: 7.0GB). Free memory was 64.9MB in the beginning and 5.0GB in the end (delta: -4.9GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. * Witness Printer took 88.51ms. Allocated memory is still 7.1GB. Free memory was 5.0GB in the beginning and 5.0GB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. 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: 390]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L32] int q_buf_0 ; [L33] int q_free ; [L34] int q_read_ev ; [L35] int q_write_ev ; [L36] int p_num_write ; [L37] int p_last_write ; [L38] int p_dw_st ; [L39] int p_dw_pc ; [L40] int p_dw_i ; [L41] int c_num_read ; [L42] int c_last_read ; [L43] int c_dr_st ; [L44] int c_dr_pc ; [L45] int c_dr_i ; [L152] static int a_t ; [L394] int m_pc = 0; [L395] int t1_pc = 0; [L396] int t2_pc = 0; [L397] int m_st ; [L398] int t1_st ; [L399] int t2_st ; [L400] int m_i ; [L401] int t1_i ; [L402] int t2_i ; [L403] int M_E = 2; [L404] int T1_E = 2; [L405] int T2_E = 2; [L406] int E_M = 2; [L407] int E_1 = 2; [L408] int E_2 = 2; [L413] int token ; [L415] int local ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L993] COND FALSE !(__VERIFIER_nondet_int()) [L996] CALL main2() [L980] int __retres1 ; [L984] CALL init_model2() [L894] m_i = 1 [L895] t1_i = 1 [L896] t2_i = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L984] RET init_model2() [L985] CALL start_simulation2() [L921] int kernel_st ; [L922] int tmp ; [L923] int tmp___0 ; [L927] kernel_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, 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, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L928] FCALL update_channels2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, 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, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L929] CALL init_threads2() [L613] COND TRUE m_i == 1 [L614] m_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L618] COND TRUE t1_i == 1 [L619] t1_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L623] COND TRUE t2_i == 1 [L624] t2_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L929] RET init_threads2() [L930] CALL fire_delta_events2() 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L726] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L731] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L736] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L741] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L746] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L751] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L930] RET fire_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, 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, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L931] CALL activate_threads2() VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L799] int tmp ; [L800] int tmp___0 ; [L801] int tmp___1 ; [L805] CALL, EXPR is_master_triggered() [L545] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L548] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L813] CALL, EXPR is_transmit1_triggered() [L564] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L567] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L577] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L579] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L821] CALL, EXPR is_transmit2_triggered() [L583] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L586] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L596] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L598] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L821] RET, EXPR is_transmit2_triggered() [L821] tmp___1 = is_transmit2_triggered() [L823] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L931] RET activate_threads2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, 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, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L932] CALL reset_delta_events2() 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L764] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L769] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L774] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L779] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L784] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L789] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L932] RET reset_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, 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, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L935] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, 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, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L938] kernel_st = 1 [L939] CALL eval2() [L659] int tmp ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L663] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L666] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L633] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L636] COND TRUE m_st == 0 [L637] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L654] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L666] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L666] tmp = exists_runnable_thread2() [L668] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L673] COND TRUE m_st == 0 [L674] int tmp_ndt_1; [L675] tmp_ndt_1 = __VERIFIER_nondet_int() [L676] COND FALSE !(\read(tmp_ndt_1)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L687] COND TRUE t1_st == 0 [L688] int tmp_ndt_2; [L689] tmp_ndt_2 = __VERIFIER_nondet_int() [L690] COND TRUE \read(tmp_ndt_2) [L692] t1_st = 1 [L693] CALL transmit1() [L476] COND TRUE t1_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L487] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L489] t1_pc = 1 [L490] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L693] RET transmit1() [L701] COND TRUE t2_st == 0 [L702] int tmp_ndt_3; [L703] tmp_ndt_3 = __VERIFIER_nondet_int() [L704] COND TRUE \read(tmp_ndt_3) [L706] t2_st = 1 [L707] CALL transmit2() [L512] COND TRUE t2_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L523] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L525] t2_pc = 1 [L526] t2_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L707] RET transmit2() [L663] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L666] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L633] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L636] COND TRUE m_st == 0 [L637] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L654] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L666] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L666] tmp = exists_runnable_thread2() [L668] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L673] COND TRUE m_st == 0 [L674] int tmp_ndt_1; [L675] tmp_ndt_1 = __VERIFIER_nondet_int() [L676] COND TRUE \read(tmp_ndt_1) [L678] m_st = 1 [L679] CALL master() [L418] int tmp_var = __VERIFIER_nondet_int(); [L420] COND TRUE m_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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_var=0, token=0] [L431] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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_var=0, token=0] [L434] token = __VERIFIER_nondet_int() [L435] local = token [L436] E_1 = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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_var=0, token=0] [L437] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L837] CALL activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L799] int tmp ; [L800] int tmp___0 ; [L801] int tmp___1 ; [L805] CALL, EXPR is_master_triggered() [L545] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L548] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L558] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L560] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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=0, token=0] [L813] CALL, EXPR is_transmit1_triggered() [L564] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L567] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L568] COND TRUE E_1 == 1 [L569] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L579] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] COND TRUE \read(tmp___0) [L816] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, 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] [L821] CALL, EXPR is_transmit2_triggered() [L583] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, 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] [L586] COND TRUE t2_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, 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] [L587] COND FALSE !(E_2 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, 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] [L596] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, 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] [L598] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, 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] [L821] RET, EXPR is_transmit2_triggered() [L821] tmp___1 = is_transmit2_triggered() [L823] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, 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] [L837] RET activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, 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] [L437] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, 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] [L438] E_1 = 2 [L439] m_pc = 1 [L440] m_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, 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] [L679] RET master() [L687] COND TRUE t1_st == 0 [L688] int tmp_ndt_2; [L689] tmp_ndt_2 = __VERIFIER_nondet_int() [L690] COND TRUE \read(tmp_ndt_2) [L692] t1_st = 1 [L693] CALL transmit1() [L476] COND FALSE !(t1_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, 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] [L479] COND TRUE t1_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, 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] [L495] token += 1 [L496] E_2 = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, 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] [L497] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, 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] [L837] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, 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] [L799] int tmp ; [L800] int tmp___0 ; [L801] int tmp___1 ; [L805] CALL, EXPR is_master_triggered() [L545] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, 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] [L548] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, 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] [L549] COND FALSE !(E_M == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, 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] [L558] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, 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] [L560] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, 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] [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] COND FALSE !(\read(tmp)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, 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] [L813] CALL, EXPR is_transmit1_triggered() [L564] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, 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] [L567] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, 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] [L568] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, 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] [L577] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, 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] [L579] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, 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] [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, 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] [L821] CALL, EXPR is_transmit2_triggered() [L583] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, 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] [L586] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, 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] [L587] COND TRUE E_2 == 1 [L588] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, 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] [L598] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, 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] [L821] RET, EXPR is_transmit2_triggered() [L821] tmp___1 = is_transmit2_triggered() [L823] COND TRUE \read(tmp___1) [L824] t2_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, 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] [L837] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, 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] [L497] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, 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] [L498] E_2 = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, 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] [L487] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, 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] [L489] t1_pc = 1 [L490] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, 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] [L693] RET transmit1() [L701] COND TRUE t2_st == 0 [L702] int tmp_ndt_3; [L703] tmp_ndt_3 = __VERIFIER_nondet_int() [L704] COND TRUE \read(tmp_ndt_3) [L706] t2_st = 1 [L707] CALL transmit2() [L512] COND FALSE !(t2_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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=1] [L515] COND TRUE t2_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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=1] [L531] token += 1 [L532] E_M = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L533] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L837] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L799] int tmp ; [L800] int tmp___0 ; [L801] int tmp___1 ; [L805] CALL, EXPR is_master_triggered() [L545] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L548] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L549] COND TRUE E_M == 1 [L550] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L560] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] COND TRUE \read(tmp) [L808] m_st = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L813] CALL, EXPR is_transmit1_triggered() [L564] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L567] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L568] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L577] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L579] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L821] CALL, EXPR is_transmit2_triggered() [L583] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L586] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L587] COND FALSE !(E_2 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L596] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L598] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L821] RET, EXPR is_transmit2_triggered() [L821] tmp___1 = is_transmit2_triggered() [L823] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L837] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L533] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L534] E_M = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L523] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L525] t2_pc = 1 [L526] t2_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L707] RET transmit2() [L663] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L666] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L633] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L636] COND TRUE m_st == 0 [L637] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L654] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L666] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L666] tmp = exists_runnable_thread2() [L668] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L673] COND TRUE m_st == 0 [L674] int tmp_ndt_1; [L675] tmp_ndt_1 = __VERIFIER_nondet_int() [L676] COND TRUE \read(tmp_ndt_1) [L678] m_st = 1 [L679] CALL master() [L418] int tmp_var = __VERIFIER_nondet_int(); [L420] COND FALSE !(m_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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_var=5, token=2] [L423] COND TRUE m_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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_var=5, token=2] [L445] COND FALSE !(token != local + 2) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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_var=5, token=2] [L450] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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_var=5, token=2] [L451] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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_var=5, token=2] [L456] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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_var=5, token=2] [L457] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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_var=5, token=2] [L458] COND TRUE tmp_var == 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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_var=5, token=2] [L459] CALL error2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] [L390] reach_error() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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] - UnprovableResult [Line: 27]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 212 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 54.8s, OverallIterations: 40, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 22.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11214 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10937 mSDsluCounter, 24798 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13741 mSDsCounter, 1243 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7664 IncrementalHoareTripleChecker+Invalid, 8907 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1243 mSolverCounterUnsat, 11057 mSDtfsCounter, 7664 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4284 GetRequests, 3973 SyntacticMatches, 8 SemanticMatches, 303 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27033occurred in iteration=25, InterpolantAutomatonStates: 253, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 16.5s AutomataMinimizationTime, 39 MinimizatonAttempts, 16835 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 8084 NumberOfCodeBlocks, 8084 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 7949 ConstructedInterpolants, 0 QuantifiedInterpolants, 13173 SizeOfPredicates, 13 NumberOfNonLiveVariables, 11172 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 64 InterpolantComputations, 38 PerfectInterpolantSequences, 3659/4278 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-16 02:30:29,102 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