./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/token_ring.01.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 327bb4ad7f981d20a6e5212aac300a9249d1857b0280531d57d587d5a0195c5f --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 01:06:37,607 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 01:06:37,616 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 01:06:37,678 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 01:06:37,679 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 01:06:37,680 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 01:06:37,685 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 01:06:37,688 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 01:06:37,689 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 01:06:37,690 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 01:06:37,691 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 01:06:37,692 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 01:06:37,693 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 01:06:37,695 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 01:06:37,697 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 01:06:37,698 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 01:06:37,701 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 01:06:37,706 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 01:06:37,707 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 01:06:37,708 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 01:06:37,715 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 01:06:37,716 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 01:06:37,717 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 01:06:37,718 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 01:06:37,720 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 01:06:37,724 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 01:06:37,724 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 01:06:37,725 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 01:06:37,725 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 01:06:37,726 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 01:06:37,726 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 01:06:37,726 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 01:06:37,727 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 01:06:37,729 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 01:06:37,729 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 01:06:37,730 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 01:06:37,731 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 01:06:37,731 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 01:06:37,732 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 01:06:37,732 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 01:06:37,733 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 01:06:37,734 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-16 01:06:37,764 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 01:06:37,764 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 01:06:37,765 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 01:06:37,765 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 01:06:37,766 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 01:06:37,766 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 01:06:37,767 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 01:06:37,767 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 01:06:37,767 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 01:06:37,767 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 01:06:37,768 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 01:06:37,768 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 01:06:37,769 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 01:06:37,769 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 01:06:37,769 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-16 01:06:37,769 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 01:06:37,769 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-16 01:06:37,769 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 01:06:37,770 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 01:06:37,770 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 01:06:37,770 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-16 01:06:37,770 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 01:06:37,770 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 01:06:37,771 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 01:06:37,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 01:06:37,771 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 01:06:37,771 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 01:06:37,771 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-16 01:06:37,772 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 01:06:37,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 01:06:37,772 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-16 01:06:37,772 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-16 01:06:37,772 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-16 01:06:37,773 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 01:06:37,773 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 -> 327bb4ad7f981d20a6e5212aac300a9249d1857b0280531d57d587d5a0195c5f [2021-12-16 01:06:38,015 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 01:06:38,045 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 01:06:38,047 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 01:06:38,048 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 01:06:38,049 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 01:06:38,050 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2021-12-16 01:06:38,101 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a442d39d/48c490f6ab6a4477aa7f2e3a8e89f95e/FLAG89a85d0c6 [2021-12-16 01:06:38,530 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 01:06:38,531 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2021-12-16 01:06:38,543 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a442d39d/48c490f6ab6a4477aa7f2e3a8e89f95e/FLAG89a85d0c6 [2021-12-16 01:06:38,904 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a442d39d/48c490f6ab6a4477aa7f2e3a8e89f95e [2021-12-16 01:06:38,909 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 01:06:38,910 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 01:06:38,912 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 01:06:38,912 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 01:06:38,914 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 01:06:38,915 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 01:06:38" (1/1) ... [2021-12-16 01:06:38,916 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d8949a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:38, skipping insertion in model container [2021-12-16 01:06:38,916 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 01:06:38" (1/1) ... [2021-12-16 01:06:38,924 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 01:06:38,949 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 01:06:39,107 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-2.c[671,684] [2021-12-16 01:06:39,182 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 01:06:39,194 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 01:06:39,206 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-2.c[671,684] [2021-12-16 01:06:39,250 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 01:06:39,263 INFO L208 MainTranslator]: Completed translation [2021-12-16 01:06:39,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:39 WrapperNode [2021-12-16 01:06:39,264 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 01:06:39,265 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 01:06:39,265 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 01:06:39,265 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 01:06:39,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:39" (1/1) ... [2021-12-16 01:06:39,280 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:39" (1/1) ... [2021-12-16 01:06:39,312 INFO L137 Inliner]: procedures = 30, calls = 35, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 220 [2021-12-16 01:06:39,313 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 01:06:39,313 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 01:06:39,314 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 01:06:39,314 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 01:06:39,324 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:39" (1/1) ... [2021-12-16 01:06:39,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:39" (1/1) ... [2021-12-16 01:06:39,327 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:39" (1/1) ... [2021-12-16 01:06:39,328 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:39" (1/1) ... [2021-12-16 01:06:39,334 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:39" (1/1) ... [2021-12-16 01:06:39,341 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:39" (1/1) ... [2021-12-16 01:06:39,343 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:39" (1/1) ... [2021-12-16 01:06:39,345 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 01:06:39,345 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 01:06:39,346 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 01:06:39,346 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 01:06:39,347 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:39" (1/1) ... [2021-12-16 01:06:39,356 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 01:06:39,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 01:06:39,382 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 01:06:39,409 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 01:06:39,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 01:06:39,435 INFO L130 BoogieDeclarations]: Found specification of procedure error [2021-12-16 01:06:39,435 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2021-12-16 01:06:39,436 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2021-12-16 01:06:39,436 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2021-12-16 01:06:39,436 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2021-12-16 01:06:39,436 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2021-12-16 01:06:39,438 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-12-16 01:06:39,438 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-12-16 01:06:39,439 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2021-12-16 01:06:39,440 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2021-12-16 01:06:39,440 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2021-12-16 01:06:39,441 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2021-12-16 01:06:39,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 01:06:39,441 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2021-12-16 01:06:39,441 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2021-12-16 01:06:39,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 01:06:39,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 01:06:39,551 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 01:06:39,554 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 01:06:39,864 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 01:06:39,878 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 01:06:39,878 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-16 01:06:39,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 01:06:39 BoogieIcfgContainer [2021-12-16 01:06:39,883 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 01:06:39,885 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 01:06:39,885 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 01:06:39,888 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 01:06:39,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 01:06:38" (1/3) ... [2021-12-16 01:06:39,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2451e2de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 01:06:39, skipping insertion in model container [2021-12-16 01:06:39,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:39" (2/3) ... [2021-12-16 01:06:39,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2451e2de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 01:06:39, skipping insertion in model container [2021-12-16 01:06:39,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 01:06:39" (3/3) ... [2021-12-16 01:06:39,892 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2021-12-16 01:06:39,897 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 01:06:39,897 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-16 01:06:39,948 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 01:06:39,955 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 01:06:39,956 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-16 01:06:39,985 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 89 states have (on average 1.550561797752809) internal successors, (138), 93 states have internal predecessors, (138), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2021-12-16 01:06:39,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-16 01:06:39,994 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:39,995 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] [2021-12-16 01:06:39,996 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:40,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:40,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1377578721, now seen corresponding path program 1 times [2021-12-16 01:06:40,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:40,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021274887] [2021-12-16 01:06:40,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:40,009 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:40,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:40,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:06:40,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:40,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 01:06:40,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:40,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 01:06:40,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:40,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-16 01:06:40,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:40,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 01:06:40,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:40,342 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 01:06:40,342 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:40,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021274887] [2021-12-16 01:06:40,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021274887] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:06:40,343 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:06:40,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 01:06:40,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143204578] [2021-12-16 01:06:40,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:06:40,351 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 01:06:40,351 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:40,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 01:06:40,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 01:06:40,442 INFO L87 Difference]: Start difference. First operand has 115 states, 89 states have (on average 1.550561797752809) internal successors, (138), 93 states have internal predecessors, (138), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 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 01:06:41,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:41,067 INFO L93 Difference]: Finished difference Result 361 states and 553 transitions. [2021-12-16 01:06:41,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 01:06:41,076 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 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 57 [2021-12-16 01:06:41,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:41,096 INFO L225 Difference]: With dead ends: 361 [2021-12-16 01:06:41,097 INFO L226 Difference]: Without dead ends: 247 [2021-12-16 01:06:41,101 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 01:06:41,106 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 309 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-16 01:06:41,107 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [317 Valid, 527 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-16 01:06:41,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-12-16 01:06:41,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 204. [2021-12-16 01:06:41,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 163 states have (on average 1.4662576687116564) internal successors, (239), 166 states have internal predecessors, (239), 27 states have call successors, (27), 13 states have call predecessors, (27), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2021-12-16 01:06:41,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 294 transitions. [2021-12-16 01:06:41,200 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 294 transitions. Word has length 57 [2021-12-16 01:06:41,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:41,201 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 294 transitions. [2021-12-16 01:06:41,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 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 01:06:41,202 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 294 transitions. [2021-12-16 01:06:41,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-16 01:06:41,208 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:41,208 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] [2021-12-16 01:06:41,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-16 01:06:41,209 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:41,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:41,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1123129379, now seen corresponding path program 1 times [2021-12-16 01:06:41,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:41,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271192421] [2021-12-16 01:06:41,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:41,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:41,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:41,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:06:41,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:41,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 01:06:41,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:41,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 01:06:41,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:41,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-16 01:06:41,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:41,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 01:06:41,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:41,359 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 01:06:41,361 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:41,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271192421] [2021-12-16 01:06:41,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271192421] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:06:41,362 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:06:41,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 01:06:41,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768652292] [2021-12-16 01:06:41,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:06:41,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 01:06:41,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:41,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 01:06:41,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:06:41,366 INFO L87 Difference]: Start difference. First operand 204 states and 294 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 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 01:06:41,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:41,783 INFO L93 Difference]: Finished difference Result 440 states and 643 transitions. [2021-12-16 01:06:41,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 01:06:41,784 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 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 57 [2021-12-16 01:06:41,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:41,785 INFO L225 Difference]: With dead ends: 440 [2021-12-16 01:06:41,785 INFO L226 Difference]: Without dead ends: 245 [2021-12-16 01:06:41,787 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 01:06:41,788 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 230 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 01:06:41,788 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [239 Valid, 406 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 01:06:41,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-12-16 01:06:41,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 204. [2021-12-16 01:06:41,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 163 states have (on average 1.4539877300613497) internal successors, (237), 166 states have internal predecessors, (237), 27 states have call successors, (27), 13 states have call predecessors, (27), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2021-12-16 01:06:41,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 292 transitions. [2021-12-16 01:06:41,817 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 292 transitions. Word has length 57 [2021-12-16 01:06:41,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:41,817 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 292 transitions. [2021-12-16 01:06:41,817 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 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 01:06:41,817 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 292 transitions. [2021-12-16 01:06:41,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-16 01:06:41,818 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:41,819 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] [2021-12-16 01:06:41,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-16 01:06:41,819 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:41,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:41,820 INFO L85 PathProgramCache]: Analyzing trace with hash -229643041, now seen corresponding path program 1 times [2021-12-16 01:06:41,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:41,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247190263] [2021-12-16 01:06:41,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:41,821 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:41,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:41,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:06:41,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:41,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 01:06:41,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:41,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 01:06:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:41,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-16 01:06:41,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:41,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 01:06:41,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:41,935 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 01:06:41,936 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:41,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247190263] [2021-12-16 01:06:41,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247190263] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:06:41,937 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:06:41,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 01:06:41,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589610922] [2021-12-16 01:06:41,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:06:41,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 01:06:41,939 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:41,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 01:06:41,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:06:41,940 INFO L87 Difference]: Start difference. First operand 204 states and 292 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 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 01:06:42,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:42,286 INFO L93 Difference]: Finished difference Result 438 states and 634 transitions. [2021-12-16 01:06:42,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 01:06:42,287 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 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 57 [2021-12-16 01:06:42,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:42,288 INFO L225 Difference]: With dead ends: 438 [2021-12-16 01:06:42,289 INFO L226 Difference]: Without dead ends: 243 [2021-12-16 01:06:42,290 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-12-16 01:06:42,291 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 226 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 01:06:42,291 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 400 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 01:06:42,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-12-16 01:06:42,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 204. [2021-12-16 01:06:42,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 163 states have (on average 1.4417177914110428) internal successors, (235), 166 states have internal predecessors, (235), 27 states have call successors, (27), 13 states have call predecessors, (27), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2021-12-16 01:06:42,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 290 transitions. [2021-12-16 01:06:42,306 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 290 transitions. Word has length 57 [2021-12-16 01:06:42,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:42,306 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 290 transitions. [2021-12-16 01:06:42,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 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 01:06:42,306 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 290 transitions. [2021-12-16 01:06:42,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-16 01:06:42,307 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:42,308 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] [2021-12-16 01:06:42,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-16 01:06:42,308 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:42,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:42,309 INFO L85 PathProgramCache]: Analyzing trace with hash 2015936413, now seen corresponding path program 1 times [2021-12-16 01:06:42,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:42,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353175466] [2021-12-16 01:06:42,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:42,309 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:42,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:06:42,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:42,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 01:06:42,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:42,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 01:06:42,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:42,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-16 01:06:42,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:42,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 01:06:42,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:42,385 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 01:06:42,385 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:42,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353175466] [2021-12-16 01:06:42,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353175466] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:06:42,386 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:06:42,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 01:06:42,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472117058] [2021-12-16 01:06:42,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:06:42,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 01:06:42,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:42,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 01:06:42,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:06:42,388 INFO L87 Difference]: Start difference. First operand 204 states and 290 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 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 01:06:42,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:42,901 INFO L93 Difference]: Finished difference Result 554 states and 786 transitions. [2021-12-16 01:06:42,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-16 01:06:42,902 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 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 57 [2021-12-16 01:06:42,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:42,904 INFO L225 Difference]: With dead ends: 554 [2021-12-16 01:06:42,904 INFO L226 Difference]: Without dead ends: 359 [2021-12-16 01:06:42,905 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2021-12-16 01:06:42,906 INFO L933 BasicCegarLoop]: 239 mSDtfsCounter, 277 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-16 01:06:42,907 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [284 Valid, 811 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-16 01:06:42,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2021-12-16 01:06:42,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 281. [2021-12-16 01:06:42,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 224 states have (on average 1.4196428571428572) internal successors, (318), 228 states have internal predecessors, (318), 36 states have call successors, (36), 19 states have call predecessors, (36), 20 states have return successors, (39), 35 states have call predecessors, (39), 34 states have call successors, (39) [2021-12-16 01:06:42,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 393 transitions. [2021-12-16 01:06:42,927 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 393 transitions. Word has length 57 [2021-12-16 01:06:42,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:42,928 INFO L470 AbstractCegarLoop]: Abstraction has 281 states and 393 transitions. [2021-12-16 01:06:42,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 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 01:06:42,928 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 393 transitions. [2021-12-16 01:06:42,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-16 01:06:42,929 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:42,929 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] [2021-12-16 01:06:42,929 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-16 01:06:42,930 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:42,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:42,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1118543135, now seen corresponding path program 1 times [2021-12-16 01:06:42,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:42,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841129479] [2021-12-16 01:06:42,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:42,931 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:42,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:06:42,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:42,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 01:06:42,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:42,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 01:06:42,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:43,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-16 01:06:43,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:43,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 01:06:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:43,021 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 01:06:43,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:43,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841129479] [2021-12-16 01:06:43,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841129479] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:06:43,022 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:06:43,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 01:06:43,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629618376] [2021-12-16 01:06:43,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:06:43,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 01:06:43,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:43,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 01:06:43,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 01:06:43,024 INFO L87 Difference]: Start difference. First operand 281 states and 393 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 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 01:06:43,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:43,502 INFO L93 Difference]: Finished difference Result 807 states and 1140 transitions. [2021-12-16 01:06:43,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 01:06:43,502 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 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 57 [2021-12-16 01:06:43,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:43,505 INFO L225 Difference]: With dead ends: 807 [2021-12-16 01:06:43,507 INFO L226 Difference]: Without dead ends: 536 [2021-12-16 01:06:43,508 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 01:06:43,509 INFO L933 BasicCegarLoop]: 261 mSDtfsCounter, 393 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-16 01:06:43,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [416 Valid, 583 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-16 01:06:43,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2021-12-16 01:06:43,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 453. [2021-12-16 01:06:43,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 361 states have (on average 1.3933518005540166) internal successors, (503), 369 states have internal predecessors, (503), 57 states have call successors, (57), 31 states have call predecessors, (57), 34 states have return successors, (63), 54 states have call predecessors, (63), 55 states have call successors, (63) [2021-12-16 01:06:43,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 623 transitions. [2021-12-16 01:06:43,550 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 623 transitions. Word has length 57 [2021-12-16 01:06:43,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:43,552 INFO L470 AbstractCegarLoop]: Abstraction has 453 states and 623 transitions. [2021-12-16 01:06:43,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 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 01:06:43,552 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 623 transitions. [2021-12-16 01:06:43,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-12-16 01:06:43,556 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:43,556 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:06:43,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-16 01:06:43,556 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:43,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:43,557 INFO L85 PathProgramCache]: Analyzing trace with hash -712241775, now seen corresponding path program 1 times [2021-12-16 01:06:43,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:43,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069137693] [2021-12-16 01:06:43,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:43,557 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:43,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:43,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:06:43,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:43,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 01:06:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:43,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 01:06:43,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:43,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-16 01:06:43,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:43,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 01:06:43,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:43,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-16 01:06:43,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:43,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:06:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:43,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-16 01:06:43,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:43,668 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-16 01:06:43,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:43,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069137693] [2021-12-16 01:06:43,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069137693] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 01:06:43,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939200308] [2021-12-16 01:06:43,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:43,669 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:06:43,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 01:06:43,675 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 01:06:43,706 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 01:06:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:43,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 01:06:43,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 01:06:43,985 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-16 01:06:43,985 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 01:06:43,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939200308] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:06:43,985 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 01:06:43,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-16 01:06:43,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930923799] [2021-12-16 01:06:43,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:06:43,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 01:06:43,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:43,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 01:06:43,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-16 01:06:43,987 INFO L87 Difference]: Start difference. First operand 453 states and 623 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 01:06:44,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:44,054 INFO L93 Difference]: Finished difference Result 1299 states and 1811 transitions. [2021-12-16 01:06:44,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 01:06:44,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 92 [2021-12-16 01:06:44,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:44,061 INFO L225 Difference]: With dead ends: 1299 [2021-12-16 01:06:44,061 INFO L226 Difference]: Without dead ends: 857 [2021-12-16 01:06:44,062 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 107 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 01:06:44,063 INFO L933 BasicCegarLoop]: 268 mSDtfsCounter, 112 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 416 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 01:06:44,063 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 416 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:06:44,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2021-12-16 01:06:44,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 857. [2021-12-16 01:06:44,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 681 states have (on average 1.3729809104258444) internal successors, (935), 694 states have internal predecessors, (935), 107 states have call successors, (107), 61 states have call predecessors, (107), 68 states have return successors, (139), 105 states have call predecessors, (139), 105 states have call successors, (139) [2021-12-16 01:06:44,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1181 transitions. [2021-12-16 01:06:44,106 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1181 transitions. Word has length 92 [2021-12-16 01:06:44,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:44,107 INFO L470 AbstractCegarLoop]: Abstraction has 857 states and 1181 transitions. [2021-12-16 01:06:44,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 01:06:44,107 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1181 transitions. [2021-12-16 01:06:44,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-12-16 01:06:44,109 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:44,110 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:06:44,135 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 01:06:44,331 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,SelfDestructingSolverStorable5 [2021-12-16 01:06:44,332 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:44,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:44,332 INFO L85 PathProgramCache]: Analyzing trace with hash -2098539431, now seen corresponding path program 1 times [2021-12-16 01:06:44,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:44,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488622515] [2021-12-16 01:06:44,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:44,332 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:44,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:06:44,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:44,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 01:06:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:44,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 01:06:44,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:44,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-16 01:06:44,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:44,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 01:06:44,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:44,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-16 01:06:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:44,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:06:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:44,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-16 01:06:44,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:44,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:06:44,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:44,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-16 01:06:44,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:44,491 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-16 01:06:44,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:44,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488622515] [2021-12-16 01:06:44,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488622515] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 01:06:44,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774601574] [2021-12-16 01:06:44,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:44,492 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:06:44,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 01:06:44,493 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 01:06:44,495 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 01:06:44,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:44,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 01:06:44,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 01:06:44,812 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-16 01:06:44,812 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 01:06:44,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774601574] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:06:44,813 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 01:06:44,813 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2021-12-16 01:06:44,813 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652755812] [2021-12-16 01:06:44,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:06:44,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 01:06:44,814 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:44,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 01:06:44,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-16 01:06:44,815 INFO L87 Difference]: Start difference. First operand 857 states and 1181 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 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 01:06:44,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:44,902 INFO L93 Difference]: Finished difference Result 2473 states and 3425 transitions. [2021-12-16 01:06:44,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 01:06:44,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 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 118 [2021-12-16 01:06:44,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:44,910 INFO L225 Difference]: With dead ends: 2473 [2021-12-16 01:06:44,910 INFO L226 Difference]: Without dead ends: 1630 [2021-12-16 01:06:44,912 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 137 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 01:06:44,913 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 79 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 311 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 01:06:44,913 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 311 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:06:44,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1630 states. [2021-12-16 01:06:44,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1630 to 1606. [2021-12-16 01:06:44,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1286 states have (on average 1.369362363919129) internal successors, (1761), 1309 states have internal predecessors, (1761), 189 states have call successors, (189), 115 states have call predecessors, (189), 130 states have return successors, (242), 185 states have call predecessors, (242), 187 states have call successors, (242) [2021-12-16 01:06:44,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 2192 transitions. [2021-12-16 01:06:44,986 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 2192 transitions. Word has length 118 [2021-12-16 01:06:44,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:44,986 INFO L470 AbstractCegarLoop]: Abstraction has 1606 states and 2192 transitions. [2021-12-16 01:06:44,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 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 01:06:44,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 2192 transitions. [2021-12-16 01:06:44,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-12-16 01:06:44,990 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:44,990 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:06:45,017 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 01:06:45,203 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,SelfDestructingSolverStorable6 [2021-12-16 01:06:45,204 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:45,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:45,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1491695225, now seen corresponding path program 1 times [2021-12-16 01:06:45,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:45,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194429657] [2021-12-16 01:06:45,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:45,205 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:45,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:45,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:06:45,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:45,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 01:06:45,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:45,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 01:06:45,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:45,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-16 01:06:45,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:45,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 01:06:45,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:45,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-16 01:06:45,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:45,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-16 01:06:45,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:45,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:06:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:45,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-16 01:06:45,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:45,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:06:45,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:45,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-16 01:06:45,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:45,317 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2021-12-16 01:06:45,317 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:45,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194429657] [2021-12-16 01:06:45,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194429657] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 01:06:45,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743675444] [2021-12-16 01:06:45,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:45,318 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:06:45,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 01:06:45,324 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 01:06:45,352 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 01:06:45,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:45,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 01:06:45,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 01:06:45,616 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-16 01:06:45,617 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 01:06:45,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743675444] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:06:45,617 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 01:06:45,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-16 01:06:45,617 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425778543] [2021-12-16 01:06:45,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:06:45,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 01:06:45,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:45,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 01:06:45,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-16 01:06:45,619 INFO L87 Difference]: Start difference. First operand 1606 states and 2192 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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 01:06:45,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:45,716 INFO L93 Difference]: Finished difference Result 2892 states and 3959 transitions. [2021-12-16 01:06:45,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 01:06:45,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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 134 [2021-12-16 01:06:45,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:45,726 INFO L225 Difference]: With dead ends: 2892 [2021-12-16 01:06:45,726 INFO L226 Difference]: Without dead ends: 1740 [2021-12-16 01:06:45,731 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 155 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 01:06:45,733 INFO L933 BasicCegarLoop]: 173 mSDtfsCounter, 99 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 311 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 01:06:45,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 311 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:06:45,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1740 states. [2021-12-16 01:06:45,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1740 to 1728. [2021-12-16 01:06:45,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1728 states, 1392 states have (on average 1.3426724137931034) internal successors, (1869), 1415 states have internal predecessors, (1869), 193 states have call successors, (193), 127 states have call predecessors, (193), 142 states have return successors, (258), 189 states have call predecessors, (258), 191 states have call successors, (258) [2021-12-16 01:06:45,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1728 states to 1728 states and 2320 transitions. [2021-12-16 01:06:45,811 INFO L78 Accepts]: Start accepts. Automaton has 1728 states and 2320 transitions. Word has length 134 [2021-12-16 01:06:45,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:45,811 INFO L470 AbstractCegarLoop]: Abstraction has 1728 states and 2320 transitions. [2021-12-16 01:06:45,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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 01:06:45,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1728 states and 2320 transitions. [2021-12-16 01:06:45,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-16 01:06:45,815 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:45,816 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:06:45,839 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 01:06:46,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:06:46,030 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:46,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:46,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1657376431, now seen corresponding path program 1 times [2021-12-16 01:06:46,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:46,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164439138] [2021-12-16 01:06:46,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:46,031 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:46,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:06:46,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:46,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 01:06:46,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:46,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 01:06:46,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:46,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-16 01:06:46,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:46,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 01:06:46,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:46,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-16 01:06:46,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:46,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-16 01:06:46,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:46,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:06:46,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:46,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-16 01:06:46,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:46,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:06:46,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:46,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-16 01:06:46,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:46,134 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-12-16 01:06:46,134 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:46,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164439138] [2021-12-16 01:06:46,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164439138] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 01:06:46,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497950900] [2021-12-16 01:06:46,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:46,135 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:06:46,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 01:06:46,140 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 01:06:46,141 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 01:06:46,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:46,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 01:06:46,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 01:06:46,487 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-16 01:06:46,488 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 01:06:46,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497950900] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:06:46,488 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 01:06:46,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-16 01:06:46,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701122050] [2021-12-16 01:06:46,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:06:46,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 01:06:46,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:46,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 01:06:46,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-16 01:06:46,490 INFO L87 Difference]: Start difference. First operand 1728 states and 2320 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, (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 01:06:46,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:46,572 INFO L93 Difference]: Finished difference Result 2662 states and 3640 transitions. [2021-12-16 01:06:46,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 01:06:46,572 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, (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 135 [2021-12-16 01:06:46,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:46,580 INFO L225 Difference]: With dead ends: 2662 [2021-12-16 01:06:46,580 INFO L226 Difference]: Without dead ends: 1752 [2021-12-16 01:06:46,583 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 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 01:06:46,585 INFO L933 BasicCegarLoop]: 255 mSDtfsCounter, 109 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 394 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 01:06:46,585 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 394 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:06:46,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2021-12-16 01:06:46,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1728. [2021-12-16 01:06:46,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1728 states, 1392 states have (on average 1.3182471264367817) internal successors, (1835), 1415 states have internal predecessors, (1835), 193 states have call successors, (193), 127 states have call predecessors, (193), 142 states have return successors, (258), 189 states have call predecessors, (258), 191 states have call successors, (258) [2021-12-16 01:06:46,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1728 states to 1728 states and 2286 transitions. [2021-12-16 01:06:46,656 INFO L78 Accepts]: Start accepts. Automaton has 1728 states and 2286 transitions. Word has length 135 [2021-12-16 01:06:46,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:46,657 INFO L470 AbstractCegarLoop]: Abstraction has 1728 states and 2286 transitions. [2021-12-16 01:06:46,657 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, (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 01:06:46,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1728 states and 2286 transitions. [2021-12-16 01:06:46,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-16 01:06:46,661 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:46,661 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-16 01:06:46,687 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 01:06:46,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:06:46,885 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:46,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:46,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1768717425, now seen corresponding path program 1 times [2021-12-16 01:06:46,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:46,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731836699] [2021-12-16 01:06:46,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:46,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:46,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:46,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:06:46,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:46,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 01:06:46,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:46,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 01:06:46,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:46,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-16 01:06:46,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:46,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 01:06:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:46,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-16 01:06:46,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:46,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-16 01:06:46,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:46,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:06:46,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:46,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-16 01:06:46,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:46,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:06:46,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:46,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-16 01:06:46,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:46,996 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-12-16 01:06:46,996 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:46,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731836699] [2021-12-16 01:06:46,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731836699] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 01:06:46,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907692452] [2021-12-16 01:06:46,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:46,997 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:06:46,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 01:06:46,998 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 01:06:47,023 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 01:06:47,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:47,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 01:06:47,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 01:06:47,299 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-16 01:06:47,299 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 01:06:47,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907692452] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:06:47,299 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 01:06:47,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-16 01:06:47,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313328349] [2021-12-16 01:06:47,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:06:47,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 01:06:47,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:47,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 01:06:47,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-16 01:06:47,301 INFO L87 Difference]: Start difference. First operand 1728 states and 2286 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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 01:06:47,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:47,363 INFO L93 Difference]: Finished difference Result 3394 states and 4549 transitions. [2021-12-16 01:06:47,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 01:06:47,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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 135 [2021-12-16 01:06:47,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:47,371 INFO L225 Difference]: With dead ends: 3394 [2021-12-16 01:06:47,371 INFO L226 Difference]: Without dead ends: 1804 [2021-12-16 01:06:47,375 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 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 01:06:47,375 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 129 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 01:06:47,375 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 176 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:06:47,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2021-12-16 01:06:47,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1550. [2021-12-16 01:06:47,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1550 states, 1252 states have (on average 1.2675718849840256) internal successors, (1587), 1267 states have internal predecessors, (1587), 175 states have call successors, (175), 115 states have call predecessors, (175), 122 states have return successors, (203), 169 states have call predecessors, (203), 173 states have call successors, (203) [2021-12-16 01:06:47,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 1965 transitions. [2021-12-16 01:06:47,434 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 1965 transitions. Word has length 135 [2021-12-16 01:06:47,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:47,434 INFO L470 AbstractCegarLoop]: Abstraction has 1550 states and 1965 transitions. [2021-12-16 01:06:47,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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 01:06:47,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 1965 transitions. [2021-12-16 01:06:47,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-12-16 01:06:47,438 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:47,438 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-16 01:06:47,464 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 01:06:47,658 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,SelfDestructingSolverStorable9 [2021-12-16 01:06:47,658 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:47,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:47,658 INFO L85 PathProgramCache]: Analyzing trace with hash -829055518, now seen corresponding path program 1 times [2021-12-16 01:06:47,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:47,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267890957] [2021-12-16 01:06:47,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:47,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:47,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:47,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:06:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:47,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 01:06:47,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:47,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 01:06:47,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:47,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-16 01:06:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:47,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 01:06:47,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:47,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-16 01:06:47,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:47,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-16 01:06:47,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:47,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:06:47,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:47,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-16 01:06:47,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:47,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:06:47,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:47,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-16 01:06:47,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:47,760 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-12-16 01:06:47,760 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:47,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267890957] [2021-12-16 01:06:47,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267890957] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 01:06:47,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836563866] [2021-12-16 01:06:47,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:47,761 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:06:47,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 01:06:47,762 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 01:06:47,800 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 01:06:47,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:47,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 01:06:47,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 01:06:48,216 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-16 01:06:48,216 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 01:06:48,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836563866] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:06:48,216 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 01:06:48,216 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-16 01:06:48,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092209002] [2021-12-16 01:06:48,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:06:48,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 01:06:48,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:48,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 01:06:48,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-16 01:06:48,217 INFO L87 Difference]: Start difference. First operand 1550 states and 1965 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 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 01:06:48,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:48,395 INFO L93 Difference]: Finished difference Result 3084 states and 3931 transitions. [2021-12-16 01:06:48,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 01:06:48,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 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 136 [2021-12-16 01:06:48,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:48,403 INFO L225 Difference]: With dead ends: 3084 [2021-12-16 01:06:48,404 INFO L226 Difference]: Without dead ends: 1550 [2021-12-16 01:06:48,408 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-16 01:06:48,408 INFO L933 BasicCegarLoop]: 131 mSDtfsCounter, 148 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 01:06:48,409 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 285 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 01:06:48,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1550 states. [2021-12-16 01:06:48,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1550 to 1550. [2021-12-16 01:06:48,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1550 states, 1252 states have (on average 1.2340255591054312) internal successors, (1545), 1267 states have internal predecessors, (1545), 175 states have call successors, (175), 115 states have call predecessors, (175), 122 states have return successors, (203), 169 states have call predecessors, (203), 173 states have call successors, (203) [2021-12-16 01:06:48,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 1923 transitions. [2021-12-16 01:06:48,481 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 1923 transitions. Word has length 136 [2021-12-16 01:06:48,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:48,481 INFO L470 AbstractCegarLoop]: Abstraction has 1550 states and 1923 transitions. [2021-12-16 01:06:48,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 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 01:06:48,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 1923 transitions. [2021-12-16 01:06:48,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-12-16 01:06:48,485 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:48,485 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-16 01:06:48,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-16 01:06:48,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:06:48,708 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:48,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:48,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1599203104, now seen corresponding path program 1 times [2021-12-16 01:06:48,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:48,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625337089] [2021-12-16 01:06:48,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:48,708 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:48,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:48,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:06:48,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:48,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 01:06:48,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:48,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 01:06:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:48,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-16 01:06:48,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:48,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 01:06:48,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:48,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-16 01:06:48,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:48,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-16 01:06:48,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:48,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:06:48,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:48,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-16 01:06:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:48,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:06:48,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:48,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-16 01:06:48,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:48,865 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-12-16 01:06:48,865 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:48,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625337089] [2021-12-16 01:06:48,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625337089] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 01:06:48,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597029418] [2021-12-16 01:06:48,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:48,866 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:06:48,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 01:06:48,867 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 01:06:48,869 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 01:06:48,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:48,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 01:06:48,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 01:06:49,232 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-16 01:06:49,232 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 01:06:49,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597029418] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:06:49,233 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 01:06:49,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-16 01:06:49,233 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68306594] [2021-12-16 01:06:49,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:06:49,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 01:06:49,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:49,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 01:06:49,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-16 01:06:49,235 INFO L87 Difference]: Start difference. First operand 1550 states and 1923 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 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 01:06:49,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:49,461 INFO L93 Difference]: Finished difference Result 3264 states and 4081 transitions. [2021-12-16 01:06:49,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 01:06:49,462 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 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 136 [2021-12-16 01:06:49,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:49,469 INFO L225 Difference]: With dead ends: 3264 [2021-12-16 01:06:49,470 INFO L226 Difference]: Without dead ends: 1730 [2021-12-16 01:06:49,474 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-12-16 01:06:49,475 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 171 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 01:06:49,475 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 296 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 01:06:49,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2021-12-16 01:06:49,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 1674. [2021-12-16 01:06:49,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1674 states, 1368 states have (on average 1.192251461988304) internal successors, (1631), 1383 states have internal predecessors, (1631), 175 states have call successors, (175), 123 states have call predecessors, (175), 130 states have return successors, (203), 169 states have call predecessors, (203), 173 states have call successors, (203) [2021-12-16 01:06:49,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 2009 transitions. [2021-12-16 01:06:49,576 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 2009 transitions. Word has length 136 [2021-12-16 01:06:49,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:49,576 INFO L470 AbstractCegarLoop]: Abstraction has 1674 states and 2009 transitions. [2021-12-16 01:06:49,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 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 01:06:49,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2009 transitions. [2021-12-16 01:06:49,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-12-16 01:06:49,579 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:49,580 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-16 01:06:49,607 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 01:06:49,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:06:49,808 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:49,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:49,808 INFO L85 PathProgramCache]: Analyzing trace with hash 292060706, now seen corresponding path program 1 times [2021-12-16 01:06:49,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:49,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720269027] [2021-12-16 01:06:49,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:49,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:49,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:49,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:06:49,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:49,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 01:06:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:49,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 01:06:49,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:49,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-16 01:06:49,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:49,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 01:06:49,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:49,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-16 01:06:49,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:49,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-16 01:06:49,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:49,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:06:49,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:49,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-16 01:06:49,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:49,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:06:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:49,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-16 01:06:49,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:49,918 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-12-16 01:06:49,918 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:49,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720269027] [2021-12-16 01:06:49,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720269027] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 01:06:49,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799495298] [2021-12-16 01:06:49,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:49,919 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:06:49,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 01:06:49,920 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 01:06:49,921 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 01:06:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:49,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-16 01:06:49,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 01:06:50,219 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-12-16 01:06:50,219 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 01:06:50,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799495298] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:06:50,220 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 01:06:50,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-16 01:06:50,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145061595] [2021-12-16 01:06:50,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:06:50,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 01:06:50,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:50,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 01:06:50,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:06:50,222 INFO L87 Difference]: Start difference. First operand 1674 states and 2009 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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 01:06:50,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:50,318 INFO L93 Difference]: Finished difference Result 2813 states and 3395 transitions. [2021-12-16 01:06:50,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 01:06:50,319 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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 136 [2021-12-16 01:06:50,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:50,324 INFO L225 Difference]: With dead ends: 2813 [2021-12-16 01:06:50,324 INFO L226 Difference]: Without dead ends: 1149 [2021-12-16 01:06:50,328 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 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 01:06:50,329 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 48 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 585 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 01:06:50,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 585 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:06:50,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2021-12-16 01:06:50,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1113. [2021-12-16 01:06:50,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 914 states have (on average 1.163019693654267) internal successors, (1063), 925 states have internal predecessors, (1063), 112 states have call successors, (112), 80 states have call predecessors, (112), 86 states have return successors, (121), 108 states have call predecessors, (121), 110 states have call successors, (121) [2021-12-16 01:06:50,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1296 transitions. [2021-12-16 01:06:50,402 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1296 transitions. Word has length 136 [2021-12-16 01:06:50,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:50,403 INFO L470 AbstractCegarLoop]: Abstraction has 1113 states and 1296 transitions. [2021-12-16 01:06:50,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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 01:06:50,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1296 transitions. [2021-12-16 01:06:50,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-12-16 01:06:50,405 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:50,405 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-16 01:06:50,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-16 01:06:50,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-16 01:06:50,619 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:50,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:50,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1014844378, now seen corresponding path program 1 times [2021-12-16 01:06:50,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:50,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052121765] [2021-12-16 01:06:50,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:50,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:50,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:06:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:50,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 01:06:50,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:50,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 01:06:50,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:50,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-16 01:06:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:50,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 01:06:50,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:50,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-16 01:06:50,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:50,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-16 01:06:50,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:50,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:06:50,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:50,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-16 01:06:50,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:50,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:06:50,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:50,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-16 01:06:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:50,710 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-12-16 01:06:50,710 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:50,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052121765] [2021-12-16 01:06:50,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052121765] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 01:06:50,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546204700] [2021-12-16 01:06:50,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:50,711 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:06:50,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 01:06:50,712 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 01:06:50,713 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 01:06:50,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:50,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-16 01:06:50,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 01:06:50,987 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-12-16 01:06:50,987 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 01:06:50,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546204700] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:06:50,987 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 01:06:50,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-16 01:06:50,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923068048] [2021-12-16 01:06:50,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:06:50,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 01:06:50,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:50,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 01:06:50,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:06:50,989 INFO L87 Difference]: Start difference. First operand 1113 states and 1296 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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 01:06:51,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:51,072 INFO L93 Difference]: Finished difference Result 2244 states and 2657 transitions. [2021-12-16 01:06:51,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 01:06:51,073 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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 136 [2021-12-16 01:06:51,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:51,080 INFO L225 Difference]: With dead ends: 2244 [2021-12-16 01:06:51,081 INFO L226 Difference]: Without dead ends: 1141 [2021-12-16 01:06:51,083 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 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 01:06:51,084 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 10 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 571 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 01:06:51,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 571 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:06:51,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2021-12-16 01:06:51,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1125. [2021-12-16 01:06:51,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 926 states have (on average 1.1382289416846652) internal successors, (1054), 937 states have internal predecessors, (1054), 112 states have call successors, (112), 80 states have call predecessors, (112), 86 states have return successors, (121), 108 states have call predecessors, (121), 110 states have call successors, (121) [2021-12-16 01:06:51,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1287 transitions. [2021-12-16 01:06:51,164 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1287 transitions. Word has length 136 [2021-12-16 01:06:51,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:51,164 INFO L470 AbstractCegarLoop]: Abstraction has 1125 states and 1287 transitions. [2021-12-16 01:06:51,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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 01:06:51,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1287 transitions. [2021-12-16 01:06:51,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-12-16 01:06:51,167 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:51,167 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:06:51,193 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 01:06:51,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-16 01:06:51,383 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:51,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:51,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1278811050, now seen corresponding path program 1 times [2021-12-16 01:06:51,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:51,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176739854] [2021-12-16 01:06:51,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:51,384 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:51,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:06:51,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:51,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 01:06:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:51,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 01:06:51,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:51,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-16 01:06:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:51,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 01:06:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:51,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-16 01:06:51,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:51,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-16 01:06:51,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:51,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:06:51,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:51,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-16 01:06:51,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:51,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:06:51,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:51,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-16 01:06:51,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:51,517 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2021-12-16 01:06:51,517 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:51,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176739854] [2021-12-16 01:06:51,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176739854] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:06:51,518 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:06:51,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 01:06:51,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660232072] [2021-12-16 01:06:51,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:06:51,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 01:06:51,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:51,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 01:06:51,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 01:06:51,520 INFO L87 Difference]: Start difference. First operand 1125 states and 1287 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-16 01:06:51,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:51,966 INFO L93 Difference]: Finished difference Result 2085 states and 2361 transitions. [2021-12-16 01:06:51,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 01:06:51,967 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 136 [2021-12-16 01:06:51,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:51,975 INFO L225 Difference]: With dead ends: 2085 [2021-12-16 01:06:51,975 INFO L226 Difference]: Without dead ends: 2082 [2021-12-16 01:06:51,976 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-12-16 01:06:51,977 INFO L933 BasicCegarLoop]: 214 mSDtfsCounter, 486 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 01:06:51,977 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [509 Valid, 532 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 01:06:51,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2082 states. [2021-12-16 01:06:52,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2082 to 1501. [2021-12-16 01:06:52,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1501 states, 1236 states have (on average 1.1375404530744337) internal successors, (1406), 1251 states have internal predecessors, (1406), 146 states have call successors, (146), 104 states have call predecessors, (146), 118 states have return successors, (163), 146 states have call predecessors, (163), 144 states have call successors, (163) [2021-12-16 01:06:52,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 1715 transitions. [2021-12-16 01:06:52,076 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 1715 transitions. Word has length 136 [2021-12-16 01:06:52,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:52,076 INFO L470 AbstractCegarLoop]: Abstraction has 1501 states and 1715 transitions. [2021-12-16 01:06:52,077 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-16 01:06:52,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 1715 transitions. [2021-12-16 01:06:52,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-12-16 01:06:52,079 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:52,079 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:06:52,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-16 01:06:52,079 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:52,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:52,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1930463342, now seen corresponding path program 1 times [2021-12-16 01:06:52,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:52,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500374681] [2021-12-16 01:06:52,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:52,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:52,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:52,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:06:52,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:52,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 01:06:52,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:52,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 01:06:52,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:52,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-16 01:06:52,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:52,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 01:06:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:52,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-16 01:06:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:52,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-16 01:06:52,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:52,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:06:52,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:52,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-16 01:06:52,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:52,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:06:52,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:52,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-16 01:06:52,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:52,153 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-12-16 01:06:52,153 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:52,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500374681] [2021-12-16 01:06:52,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500374681] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:06:52,153 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:06:52,153 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 01:06:52,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113890832] [2021-12-16 01:06:52,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:06:52,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 01:06:52,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:52,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 01:06:52,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 01:06:52,155 INFO L87 Difference]: Start difference. First operand 1501 states and 1715 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-16 01:06:52,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:52,398 INFO L93 Difference]: Finished difference Result 2724 states and 3203 transitions. [2021-12-16 01:06:52,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 01:06:52,399 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 140 [2021-12-16 01:06:52,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:52,407 INFO L225 Difference]: With dead ends: 2724 [2021-12-16 01:06:52,407 INFO L226 Difference]: Without dead ends: 1864 [2021-12-16 01:06:52,410 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 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 01:06:52,411 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 142 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 01:06:52,411 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 485 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 01:06:52,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2021-12-16 01:06:52,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1503. [2021-12-16 01:06:52,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1503 states, 1238 states have (on average 1.137318255250404) internal successors, (1408), 1253 states have internal predecessors, (1408), 146 states have call successors, (146), 104 states have call predecessors, (146), 118 states have return successors, (163), 146 states have call predecessors, (163), 144 states have call successors, (163) [2021-12-16 01:06:52,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1717 transitions. [2021-12-16 01:06:52,525 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1717 transitions. Word has length 140 [2021-12-16 01:06:52,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:52,526 INFO L470 AbstractCegarLoop]: Abstraction has 1503 states and 1717 transitions. [2021-12-16 01:06:52,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-16 01:06:52,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1717 transitions. [2021-12-16 01:06:52,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-12-16 01:06:52,528 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:52,528 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:06:52,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-16 01:06:52,529 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:52,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:52,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1514412424, now seen corresponding path program 1 times [2021-12-16 01:06:52,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:52,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932553811] [2021-12-16 01:06:52,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:52,530 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:52,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 01:06:52,542 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 01:06:52,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 01:06:52,586 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 01:06:52,587 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-16 01:06:52,588 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-16 01:06:52,589 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-16 01:06:52,592 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:06:52,596 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-16 01:06:52,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 01:06:52 BoogieIcfgContainer [2021-12-16 01:06:52,718 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-16 01:06:52,719 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-16 01:06:52,719 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-16 01:06:52,720 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-16 01:06:52,720 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 01:06:39" (3/4) ... [2021-12-16 01:06:52,721 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-16 01:06:52,821 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-16 01:06:52,822 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-16 01:06:52,822 INFO L158 Benchmark]: Toolchain (without parser) took 13911.99ms. Allocated memory was 104.9MB in the beginning and 251.7MB in the end (delta: 146.8MB). Free memory was 75.3MB in the beginning and 145.2MB in the end (delta: -70.0MB). Peak memory consumption was 76.6MB. Max. memory is 16.1GB. [2021-12-16 01:06:52,823 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 104.9MB. Free memory was 63.7MB in the beginning and 63.6MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 01:06:52,823 INFO L158 Benchmark]: CACSL2BoogieTranslator took 352.46ms. Allocated memory was 104.9MB in the beginning and 144.7MB in the end (delta: 39.8MB). Free memory was 75.0MB in the beginning and 117.4MB in the end (delta: -42.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-16 01:06:52,824 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.88ms. Allocated memory is still 144.7MB. Free memory was 117.4MB in the beginning and 115.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 01:06:52,824 INFO L158 Benchmark]: Boogie Preprocessor took 31.55ms. Allocated memory is still 144.7MB. Free memory was 115.4MB in the beginning and 113.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 01:06:52,824 INFO L158 Benchmark]: RCFGBuilder took 538.11ms. Allocated memory is still 144.7MB. Free memory was 113.8MB in the beginning and 98.2MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-16 01:06:52,825 INFO L158 Benchmark]: TraceAbstraction took 12833.46ms. Allocated memory was 144.7MB in the beginning and 251.7MB in the end (delta: 107.0MB). Free memory was 97.6MB in the beginning and 158.9MB in the end (delta: -61.3MB). Peak memory consumption was 48.3MB. Max. memory is 16.1GB. [2021-12-16 01:06:52,825 INFO L158 Benchmark]: Witness Printer took 102.50ms. Allocated memory is still 251.7MB. Free memory was 157.8MB in the beginning and 145.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-16 01:06:52,831 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.20ms. Allocated memory is still 104.9MB. Free memory was 63.7MB in the beginning and 63.6MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 352.46ms. Allocated memory was 104.9MB in the beginning and 144.7MB in the end (delta: 39.8MB). Free memory was 75.0MB in the beginning and 117.4MB in the end (delta: -42.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.88ms. Allocated memory is still 144.7MB. Free memory was 117.4MB in the beginning and 115.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.55ms. Allocated memory is still 144.7MB. Free memory was 115.4MB in the beginning and 113.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 538.11ms. Allocated memory is still 144.7MB. Free memory was 113.8MB in the beginning and 98.2MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 12833.46ms. Allocated memory was 144.7MB in the beginning and 251.7MB in the end (delta: 107.0MB). Free memory was 97.6MB in the beginning and 158.9MB in the end (delta: -61.3MB). Peak memory consumption was 48.3MB. Max. memory is 16.1GB. * Witness Printer took 102.50ms. Allocated memory is still 251.7MB. Free memory was 157.8MB in the beginning and 145.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.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: 20]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] int m_pc = 0; [L25] int t1_pc = 0; [L26] int m_st ; [L27] int t1_st ; [L28] int m_i ; [L29] int t1_i ; [L30] int M_E = 2; [L31] int T1_E = 2; [L32] int E_M = 2; [L33] int E_1 = 2; [L37] int token ; [L39] int local ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L485] int __retres1 ; [L489] CALL init_model() [L400] m_i = 1 [L401] t1_i = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L489] RET init_model() [L490] CALL start_simulation() [L426] int kernel_st ; [L427] int tmp ; [L428] int tmp___0 ; [L432] kernel_st = 0 VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L433] FCALL update_channels() VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L434] CALL init_threads() [L182] COND TRUE m_i == 1 [L183] m_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L187] COND TRUE t1_i == 1 [L188] t1_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L434] RET init_threads() [L435] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L271] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L276] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L281] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L286] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L435] RET fire_delta_events() VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L436] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L324] int tmp ; [L325] int tmp___0 ; [L329] CALL, EXPR is_master_triggered() [L133] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L136] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L146] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L148] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L329] RET, EXPR is_master_triggered() [L329] tmp = is_master_triggered() [L331] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L337] CALL, EXPR is_transmit1_triggered() [L152] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L155] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L165] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L167] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L337] RET, EXPR is_transmit1_triggered() [L337] tmp___0 = is_transmit1_triggered() [L339] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L436] RET activate_threads() VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L437] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L299] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L304] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L309] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L314] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L437] RET reset_delta_events() VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L440] COND TRUE 1 VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L443] kernel_st = 1 [L444] CALL eval() [L218] int tmp ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L222] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L225] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L197] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L200] COND TRUE m_st == 0 [L201] __retres1 = 1 VAL [__retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L213] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L225] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L225] tmp = exists_runnable_thread() [L227] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L232] COND TRUE m_st == 0 [L233] int tmp_ndt_1; [L234] tmp_ndt_1 = __VERIFIER_nondet_int() [L235] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L246] COND TRUE t1_st == 0 [L247] int tmp_ndt_2; [L248] tmp_ndt_2 = __VERIFIER_nondet_int() [L249] COND TRUE \read(tmp_ndt_2) [L251] t1_st = 1 [L252] CALL transmit1() [L100] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L111] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L113] t1_pc = 1 [L114] t1_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L252] RET transmit1() [L222] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L225] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L197] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L200] COND TRUE m_st == 0 [L201] __retres1 = 1 VAL [__retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L213] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L225] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L225] tmp = exists_runnable_thread() [L227] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L232] COND TRUE m_st == 0 [L233] int tmp_ndt_1; [L234] tmp_ndt_1 = __VERIFIER_nondet_int() [L235] COND TRUE \read(tmp_ndt_1) [L237] m_st = 1 [L238] CALL master() [L42] int tmp_var = __VERIFIER_nondet_int(); [L44] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L55] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L58] token = __VERIFIER_nondet_int() [L59] local = token [L60] E_1 = 1 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L61] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L353] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L324] int tmp ; [L325] int tmp___0 ; [L329] CALL, EXPR is_master_triggered() [L133] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L136] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L146] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L148] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=0, __retres1=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L329] RET, EXPR is_master_triggered() [L329] tmp = is_master_triggered() [L331] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L337] CALL, EXPR is_transmit1_triggered() [L152] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L155] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L156] COND TRUE E_1 == 1 [L157] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=1, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L167] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=1, __retres1=1, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L337] RET, EXPR is_transmit1_triggered() [L337] tmp___0 = is_transmit1_triggered() [L339] COND TRUE \read(tmp___0) [L340] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=0] [L353] RET activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L61] RET immediate_notify() VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L62] E_1 = 2 [L63] m_pc = 1 [L64] m_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L238] RET master() [L246] COND TRUE t1_st == 0 [L247] int tmp_ndt_2; [L248] tmp_ndt_2 = __VERIFIER_nondet_int() [L249] COND TRUE \read(tmp_ndt_2) [L251] t1_st = 1 [L252] CALL transmit1() [L100] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L103] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L119] token += 1 [L120] E_M = 1 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L121] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L353] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L324] int tmp ; [L325] int tmp___0 ; [L329] CALL, EXPR is_master_triggered() [L133] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L136] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L137] COND TRUE E_M == 1 [L138] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L148] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \result=1, __retres1=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L329] RET, EXPR is_master_triggered() [L329] tmp = is_master_triggered() [L331] COND TRUE \read(tmp) [L332] m_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L337] CALL, EXPR is_transmit1_triggered() [L152] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L155] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L156] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L165] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L167] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \result=0, __retres1=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L337] RET, EXPR is_transmit1_triggered() [L337] tmp___0 = is_transmit1_triggered() [L339] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L353] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L121] RET immediate_notify() VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L122] E_M = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L111] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L113] t1_pc = 1 [L114] t1_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L252] RET transmit1() [L222] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, token=1] [L225] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L197] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L200] COND TRUE m_st == 0 [L201] __retres1 = 1 VAL [__retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L213] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L225] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, token=1] [L225] tmp = exists_runnable_thread() [L227] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, token=1] [L232] COND TRUE m_st == 0 [L233] int tmp_ndt_1; [L234] tmp_ndt_1 = __VERIFIER_nondet_int() [L235] COND TRUE \read(tmp_ndt_1) [L237] m_st = 1 [L238] CALL master() [L42] int tmp_var = __VERIFIER_nondet_int(); [L44] COND FALSE !(m_pc == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L47] COND TRUE m_pc == 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L69] COND FALSE !(token != local + 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L74] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L75] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L80] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L81] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L82] COND TRUE tmp_var == 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L83] CALL error() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L20] reach_error() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 115 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.6s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3075 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2968 mSDsluCounter, 7089 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4140 mSDsCounter, 528 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2899 IncrementalHoareTripleChecker+Invalid, 3427 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 528 mSolverCounterUnsat, 2949 mSDtfsCounter, 2899 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1580 GetRequests, 1447 SyntacticMatches, 4 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1728occurred in iteration=8, InterpolantAutomatonStates: 104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 1648 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 3018 NumberOfCodeBlocks, 3018 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2852 ConstructedInterpolants, 0 QuantifiedInterpolants, 4631 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3590 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 25 InterpolantComputations, 16 PerfectInterpolantSequences, 1302/1472 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 01:06:52,876 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