./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/kundu1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/kundu1.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c114a15ea6b1c9b012290758a6a9559b9c02a944706c9768958a3bd9c86822a7 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-07 01:37:15,131 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-07 01:37:15,133 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-07 01:37:15,162 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-07 01:37:15,163 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-07 01:37:15,164 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-07 01:37:15,166 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-07 01:37:15,168 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-07 01:37:15,170 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-07 01:37:15,171 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-07 01:37:15,172 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-07 01:37:15,173 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-07 01:37:15,174 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-07 01:37:15,175 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-07 01:37:15,177 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-07 01:37:15,178 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-07 01:37:15,179 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-07 01:37:15,180 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-07 01:37:15,183 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-07 01:37:15,186 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-07 01:37:15,188 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-07 01:37:15,189 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-07 01:37:15,190 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-07 01:37:15,191 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-07 01:37:15,195 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-07 01:37:15,195 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-07 01:37:15,196 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-07 01:37:15,197 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-07 01:37:15,198 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-07 01:37:15,199 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-07 01:37:15,199 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-07 01:37:15,200 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-07 01:37:15,201 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-07 01:37:15,201 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-07 01:37:15,202 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-07 01:37:15,203 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-07 01:37:15,203 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-07 01:37:15,203 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-07 01:37:15,203 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-07 01:37:15,204 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-07 01:37:15,204 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-07 01:37:15,205 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-07 01:37:15,228 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-07 01:37:15,228 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-07 01:37:15,228 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-07 01:37:15,228 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-07 01:37:15,229 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-07 01:37:15,229 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-07 01:37:15,230 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-07 01:37:15,230 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-07 01:37:15,230 INFO L138 SettingsManager]: * Use SBE=true [2021-12-07 01:37:15,230 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-07 01:37:15,231 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-07 01:37:15,231 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-07 01:37:15,231 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-07 01:37:15,231 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-07 01:37:15,231 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-07 01:37:15,231 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-07 01:37:15,232 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-07 01:37:15,232 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-07 01:37:15,232 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-07 01:37:15,232 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-07 01:37:15,232 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-07 01:37:15,232 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-07 01:37:15,232 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-07 01:37:15,233 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-07 01:37:15,233 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 01:37:15,233 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-07 01:37:15,233 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-07 01:37:15,233 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-07 01:37:15,233 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-07 01:37:15,233 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-07 01:37:15,233 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-07 01:37:15,234 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-07 01:37:15,234 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-07 01:37:15,234 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-07 01:37:15,234 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c114a15ea6b1c9b012290758a6a9559b9c02a944706c9768958a3bd9c86822a7 [2021-12-07 01:37:15,425 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-07 01:37:15,445 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-07 01:37:15,448 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-07 01:37:15,449 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-07 01:37:15,450 INFO L275 PluginConnector]: CDTParser initialized [2021-12-07 01:37:15,451 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/systemc/kundu1.cil.c [2021-12-07 01:37:15,514 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/data/0733af4f0/61cfa08c347f4b3196cd62c0ffd1c3a5/FLAGe62bb40ca [2021-12-07 01:37:15,847 INFO L306 CDTParser]: Found 1 translation units. [2021-12-07 01:37:15,847 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/sv-benchmarks/c/systemc/kundu1.cil.c [2021-12-07 01:37:15,856 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/data/0733af4f0/61cfa08c347f4b3196cd62c0ffd1c3a5/FLAGe62bb40ca [2021-12-07 01:37:16,253 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/data/0733af4f0/61cfa08c347f4b3196cd62c0ffd1c3a5 [2021-12-07 01:37:16,255 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-07 01:37:16,257 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-07 01:37:16,258 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-07 01:37:16,258 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-07 01:37:16,261 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-07 01:37:16,261 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:37:16" (1/1) ... [2021-12-07 01:37:16,262 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d460243 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:37:16, skipping insertion in model container [2021-12-07 01:37:16,262 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:37:16" (1/1) ... [2021-12-07 01:37:16,267 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-07 01:37:16,288 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-07 01:37:16,406 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/sv-benchmarks/c/systemc/kundu1.cil.c[636,649] [2021-12-07 01:37:16,455 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 01:37:16,465 INFO L203 MainTranslator]: Completed pre-run [2021-12-07 01:37:16,476 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/sv-benchmarks/c/systemc/kundu1.cil.c[636,649] [2021-12-07 01:37:16,500 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 01:37:16,516 INFO L208 MainTranslator]: Completed translation [2021-12-07 01:37:16,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:37:16 WrapperNode [2021-12-07 01:37:16,517 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-07 01:37:16,518 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-07 01:37:16,518 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-07 01:37:16,518 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-07 01:37:16,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:37:16" (1/1) ... [2021-12-07 01:37:16,534 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:37:16" (1/1) ... [2021-12-07 01:37:16,561 INFO L137 Inliner]: procedures = 32, calls = 36, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 257 [2021-12-07 01:37:16,561 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-07 01:37:16,562 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-07 01:37:16,562 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-07 01:37:16,562 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-07 01:37:16,571 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:37:16" (1/1) ... [2021-12-07 01:37:16,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:37:16" (1/1) ... [2021-12-07 01:37:16,574 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:37:16" (1/1) ... [2021-12-07 01:37:16,574 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:37:16" (1/1) ... [2021-12-07 01:37:16,581 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:37:16" (1/1) ... [2021-12-07 01:37:16,587 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:37:16" (1/1) ... [2021-12-07 01:37:16,589 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:37:16" (1/1) ... [2021-12-07 01:37:16,592 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-07 01:37:16,593 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-07 01:37:16,593 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-07 01:37:16,593 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-07 01:37:16,595 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:37:16" (1/1) ... [2021-12-07 01:37:16,603 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 01:37:16,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:37:16,628 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-07 01:37:16,633 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-07 01:37:16,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-07 01:37:16,661 INFO L130 BoogieDeclarations]: Found specification of procedure error [2021-12-07 01:37:16,662 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2021-12-07 01:37:16,662 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2021-12-07 01:37:16,662 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2021-12-07 01:37:16,662 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2021-12-07 01:37:16,662 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2021-12-07 01:37:16,662 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2021-12-07 01:37:16,662 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2021-12-07 01:37:16,662 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2021-12-07 01:37:16,662 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2021-12-07 01:37:16,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-07 01:37:16,663 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2021-12-07 01:37:16,663 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2021-12-07 01:37:16,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-07 01:37:16,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-07 01:37:16,726 INFO L236 CfgBuilder]: Building ICFG [2021-12-07 01:37:16,727 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-07 01:37:16,980 INFO L277 CfgBuilder]: Performing block encoding [2021-12-07 01:37:16,989 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-07 01:37:16,989 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-07 01:37:16,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:37:16 BoogieIcfgContainer [2021-12-07 01:37:16,992 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-07 01:37:16,994 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-07 01:37:16,994 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-07 01:37:16,998 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-07 01:37:16,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:37:16" (1/3) ... [2021-12-07 01:37:16,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16782a41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:37:16, skipping insertion in model container [2021-12-07 01:37:16,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:37:16" (2/3) ... [2021-12-07 01:37:17,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16782a41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:37:16, skipping insertion in model container [2021-12-07 01:37:17,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:37:16" (3/3) ... [2021-12-07 01:37:17,001 INFO L111 eAbstractionObserver]: Analyzing ICFG kundu1.cil.c [2021-12-07 01:37:17,007 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-07 01:37:17,008 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-07 01:37:17,062 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-07 01:37:17,069 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-07 01:37:17,069 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-07 01:37:17,091 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 85 states have (on average 1.4941176470588236) internal successors, (127), 89 states have internal predecessors, (127), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-07 01:37:17,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-07 01:37:17,099 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:37:17,100 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] [2021-12-07 01:37:17,100 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:37:17,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:37:17,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1847694624, now seen corresponding path program 1 times [2021-12-07 01:37:17,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:37:17,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248254046] [2021-12-07 01:37:17,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:37:17,117 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:37:17,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:17,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:37:17,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:17,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:37:17,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:17,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-07 01:37:17,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:17,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-07 01:37:17,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:17,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-07 01:37:17,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:17,386 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-07 01:37:17,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:37:17,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248254046] [2021-12-07 01:37:17,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248254046] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:37:17,388 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:37:17,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-07 01:37:17,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837353085] [2021-12-07 01:37:17,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:37:17,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 01:37:17,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:37:17,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 01:37:17,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:37:17,427 INFO L87 Difference]: Start difference. First operand has 108 states, 85 states have (on average 1.4941176470588236) internal successors, (127), 89 states have internal predecessors, (127), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-07 01:37:17,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:37:17,712 INFO L93 Difference]: Finished difference Result 317 states and 469 transitions. [2021-12-07 01:37:17,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-07 01:37:17,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2021-12-07 01:37:17,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:37:17,728 INFO L225 Difference]: With dead ends: 317 [2021-12-07 01:37:17,728 INFO L226 Difference]: Without dead ends: 211 [2021-12-07 01:37:17,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-07 01:37:17,737 INFO L933 BasicCegarLoop]: 286 mSDtfsCounter, 295 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:37:17,738 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [308 Valid, 656 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-07 01:37:17,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-12-07 01:37:17,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 180. [2021-12-07 01:37:17,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 146 states have (on average 1.404109589041096) internal successors, (205), 149 states have internal predecessors, (205), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2021-12-07 01:37:17,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 248 transitions. [2021-12-07 01:37:17,790 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 248 transitions. Word has length 51 [2021-12-07 01:37:17,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:37:17,790 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 248 transitions. [2021-12-07 01:37:17,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-07 01:37:17,791 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 248 transitions. [2021-12-07 01:37:17,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-07 01:37:17,793 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:37:17,794 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] [2021-12-07 01:37:17,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-07 01:37:17,794 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:37:17,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:37:17,795 INFO L85 PathProgramCache]: Analyzing trace with hash 682456063, now seen corresponding path program 1 times [2021-12-07 01:37:17,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:37:17,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759237287] [2021-12-07 01:37:17,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:37:17,796 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:37:17,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:17,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:37:17,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:17,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:37:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:17,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-07 01:37:17,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:17,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-07 01:37:17,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:17,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-07 01:37:17,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:17,914 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-07 01:37:17,915 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:37:17,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759237287] [2021-12-07 01:37:17,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759237287] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:37:17,915 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:37:17,915 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-07 01:37:17,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235205663] [2021-12-07 01:37:17,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:37:17,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-07 01:37:17,917 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:37:17,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-07 01:37:17,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-07 01:37:17,918 INFO L87 Difference]: Start difference. First operand 180 states and 248 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-07 01:37:18,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:37:18,090 INFO L93 Difference]: Finished difference Result 381 states and 534 transitions. [2021-12-07 01:37:18,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-07 01:37:18,091 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2021-12-07 01:37:18,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:37:18,094 INFO L225 Difference]: With dead ends: 381 [2021-12-07 01:37:18,095 INFO L226 Difference]: Without dead ends: 211 [2021-12-07 01:37:18,097 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-12-07 01:37:18,099 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 117 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:37:18,099 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 664 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:37:18,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-12-07 01:37:18,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 183. [2021-12-07 01:37:18,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 149 states have (on average 1.389261744966443) internal successors, (207), 152 states have internal predecessors, (207), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2021-12-07 01:37:18,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 250 transitions. [2021-12-07 01:37:18,124 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 250 transitions. Word has length 51 [2021-12-07 01:37:18,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:37:18,125 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 250 transitions. [2021-12-07 01:37:18,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-07 01:37:18,125 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 250 transitions. [2021-12-07 01:37:18,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-07 01:37:18,127 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:37:18,127 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] [2021-12-07 01:37:18,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-07 01:37:18,128 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:37:18,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:37:18,129 INFO L85 PathProgramCache]: Analyzing trace with hash 957215677, now seen corresponding path program 1 times [2021-12-07 01:37:18,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:37:18,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953283939] [2021-12-07 01:37:18,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:37:18,129 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:37:18,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:18,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:37:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:18,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:37:18,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:18,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-07 01:37:18,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:18,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-07 01:37:18,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:18,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-07 01:37:18,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:18,230 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-07 01:37:18,230 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:37:18,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953283939] [2021-12-07 01:37:18,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953283939] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:37:18,231 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:37:18,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-07 01:37:18,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647564390] [2021-12-07 01:37:18,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:37:18,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-07 01:37:18,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:37:18,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-07 01:37:18,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-07 01:37:18,233 INFO L87 Difference]: Start difference. First operand 183 states and 250 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-07 01:37:18,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:37:18,567 INFO L93 Difference]: Finished difference Result 719 states and 999 transitions. [2021-12-07 01:37:18,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-07 01:37:18,568 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2021-12-07 01:37:18,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:37:18,574 INFO L225 Difference]: With dead ends: 719 [2021-12-07 01:37:18,574 INFO L226 Difference]: Without dead ends: 546 [2021-12-07 01:37:18,576 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-12-07 01:37:18,578 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 566 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:37:18,578 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [579 Valid, 714 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-07 01:37:18,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2021-12-07 01:37:18,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 333. [2021-12-07 01:37:18,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 273 states have (on average 1.36996336996337) internal successors, (374), 276 states have internal predecessors, (374), 39 states have call successors, (39), 21 states have call predecessors, (39), 20 states have return successors, (38), 36 states have call predecessors, (38), 36 states have call successors, (38) [2021-12-07 01:37:18,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 451 transitions. [2021-12-07 01:37:18,632 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 451 transitions. Word has length 51 [2021-12-07 01:37:18,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:37:18,633 INFO L470 AbstractCegarLoop]: Abstraction has 333 states and 451 transitions. [2021-12-07 01:37:18,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-07 01:37:18,633 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 451 transitions. [2021-12-07 01:37:18,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-07 01:37:18,635 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:37:18,636 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] [2021-12-07 01:37:18,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-07 01:37:18,636 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:37:18,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:37:18,637 INFO L85 PathProgramCache]: Analyzing trace with hash 758872208, now seen corresponding path program 1 times [2021-12-07 01:37:18,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:37:18,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094985441] [2021-12-07 01:37:18,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:37:18,638 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:37:18,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:18,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:37:18,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:18,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:37:18,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:18,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-07 01:37:18,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:18,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-07 01:37:18,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:18,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:37:18,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:18,707 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-07 01:37:18,707 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:37:18,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094985441] [2021-12-07 01:37:18,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094985441] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:37:18,708 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:37:18,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-07 01:37:18,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852490985] [2021-12-07 01:37:18,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:37:18,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 01:37:18,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:37:18,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 01:37:18,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:37:18,710 INFO L87 Difference]: Start difference. First operand 333 states and 451 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-07 01:37:18,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:37:18,971 INFO L93 Difference]: Finished difference Result 1182 states and 1638 transitions. [2021-12-07 01:37:18,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-07 01:37:18,972 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2021-12-07 01:37:18,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:37:18,981 INFO L225 Difference]: With dead ends: 1182 [2021-12-07 01:37:18,981 INFO L226 Difference]: Without dead ends: 859 [2021-12-07 01:37:18,983 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-07 01:37:18,985 INFO L933 BasicCegarLoop]: 285 mSDtfsCounter, 294 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:37:18,986 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [307 Valid, 744 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-07 01:37:18,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2021-12-07 01:37:19,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 758. [2021-12-07 01:37:19,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 620 states have (on average 1.320967741935484) internal successors, (819), 623 states have internal predecessors, (819), 87 states have call successors, (87), 51 states have call predecessors, (87), 50 states have return successors, (98), 84 states have call predecessors, (98), 84 states have call successors, (98) [2021-12-07 01:37:19,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1004 transitions. [2021-12-07 01:37:19,065 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1004 transitions. Word has length 52 [2021-12-07 01:37:19,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:37:19,066 INFO L470 AbstractCegarLoop]: Abstraction has 758 states and 1004 transitions. [2021-12-07 01:37:19,066 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-07 01:37:19,066 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1004 transitions. [2021-12-07 01:37:19,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-07 01:37:19,068 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:37:19,068 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] [2021-12-07 01:37:19,068 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-07 01:37:19,068 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:37:19,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:37:19,069 INFO L85 PathProgramCache]: Analyzing trace with hash 701727983, now seen corresponding path program 1 times [2021-12-07 01:37:19,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:37:19,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103611078] [2021-12-07 01:37:19,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:37:19,070 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:37:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:19,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:37:19,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:19,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:37:19,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:19,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-07 01:37:19,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:19,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-07 01:37:19,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:19,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:37:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:19,157 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-07 01:37:19,158 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:37:19,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103611078] [2021-12-07 01:37:19,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103611078] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:37:19,158 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:37:19,159 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-07 01:37:19,159 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641440669] [2021-12-07 01:37:19,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:37:19,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-07 01:37:19,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:37:19,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-07 01:37:19,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-07 01:37:19,161 INFO L87 Difference]: Start difference. First operand 758 states and 1004 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-07 01:37:19,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:37:19,354 INFO L93 Difference]: Finished difference Result 1587 states and 2170 transitions. [2021-12-07 01:37:19,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-07 01:37:19,355 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2021-12-07 01:37:19,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:37:19,362 INFO L225 Difference]: With dead ends: 1587 [2021-12-07 01:37:19,362 INFO L226 Difference]: Without dead ends: 839 [2021-12-07 01:37:19,365 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-12-07 01:37:19,373 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 58 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:37:19,374 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 605 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:37:19,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2021-12-07 01:37:19,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 776. [2021-12-07 01:37:19,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 638 states have (on average 1.3056426332288402) internal successors, (833), 641 states have internal predecessors, (833), 87 states have call successors, (87), 51 states have call predecessors, (87), 50 states have return successors, (98), 84 states have call predecessors, (98), 84 states have call successors, (98) [2021-12-07 01:37:19,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1018 transitions. [2021-12-07 01:37:19,449 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1018 transitions. Word has length 52 [2021-12-07 01:37:19,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:37:19,449 INFO L470 AbstractCegarLoop]: Abstraction has 776 states and 1018 transitions. [2021-12-07 01:37:19,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-07 01:37:19,450 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1018 transitions. [2021-12-07 01:37:19,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-07 01:37:19,451 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:37:19,451 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] [2021-12-07 01:37:19,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-07 01:37:19,452 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:37:19,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:37:19,452 INFO L85 PathProgramCache]: Analyzing trace with hash 763767597, now seen corresponding path program 1 times [2021-12-07 01:37:19,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:37:19,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828098188] [2021-12-07 01:37:19,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:37:19,453 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:37:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:19,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:37:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:19,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:37:19,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:19,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-07 01:37:19,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:19,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-07 01:37:19,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:19,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:37:19,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:19,513 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-07 01:37:19,514 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:37:19,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828098188] [2021-12-07 01:37:19,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828098188] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:37:19,514 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:37:19,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-07 01:37:19,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798663221] [2021-12-07 01:37:19,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:37:19,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 01:37:19,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:37:19,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 01:37:19,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:37:19,516 INFO L87 Difference]: Start difference. First operand 776 states and 1018 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-12-07 01:37:19,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:37:19,816 INFO L93 Difference]: Finished difference Result 2629 states and 3632 transitions. [2021-12-07 01:37:19,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-07 01:37:19,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 52 [2021-12-07 01:37:19,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:37:19,831 INFO L225 Difference]: With dead ends: 2629 [2021-12-07 01:37:19,831 INFO L226 Difference]: Without dead ends: 1931 [2021-12-07 01:37:19,835 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-07 01:37:19,836 INFO L933 BasicCegarLoop]: 244 mSDtfsCounter, 272 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:37:19,836 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [285 Valid, 673 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-07 01:37:19,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2021-12-07 01:37:19,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1302. [2021-12-07 01:37:19,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1302 states, 1073 states have (on average 1.3019571295433365) internal successors, (1397), 1076 states have internal predecessors, (1397), 143 states have call successors, (143), 86 states have call predecessors, (143), 85 states have return successors, (166), 140 states have call predecessors, (166), 140 states have call successors, (166) [2021-12-07 01:37:19,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 1706 transitions. [2021-12-07 01:37:19,949 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 1706 transitions. Word has length 52 [2021-12-07 01:37:19,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:37:19,949 INFO L470 AbstractCegarLoop]: Abstraction has 1302 states and 1706 transitions. [2021-12-07 01:37:19,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-12-07 01:37:19,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1706 transitions. [2021-12-07 01:37:19,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-07 01:37:19,951 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:37:19,951 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:37:19,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-07 01:37:19,952 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:37:19,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:37:19,952 INFO L85 PathProgramCache]: Analyzing trace with hash -938478105, now seen corresponding path program 1 times [2021-12-07 01:37:19,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:37:19,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837319942] [2021-12-07 01:37:19,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:37:19,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:37:19,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:19,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:37:19,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:19,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:37:19,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:20,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-07 01:37:20,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:20,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-07 01:37:20,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:20,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:37:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:20,022 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-07 01:37:20,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:37:20,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837319942] [2021-12-07 01:37:20,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837319942] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:37:20,023 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:37:20,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-07 01:37:20,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312191763] [2021-12-07 01:37:20,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:37:20,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-07 01:37:20,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:37:20,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-07 01:37:20,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-07 01:37:20,025 INFO L87 Difference]: Start difference. First operand 1302 states and 1706 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-12-07 01:37:20,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:37:20,307 INFO L93 Difference]: Finished difference Result 2502 states and 3310 transitions. [2021-12-07 01:37:20,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-07 01:37:20,308 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2021-12-07 01:37:20,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:37:20,319 INFO L225 Difference]: With dead ends: 2502 [2021-12-07 01:37:20,319 INFO L226 Difference]: Without dead ends: 1573 [2021-12-07 01:37:20,323 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-07 01:37:20,324 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 505 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:37:20,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [522 Valid, 606 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:37:20,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2021-12-07 01:37:20,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1462. [2021-12-07 01:37:20,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1462 states, 1207 states have (on average 1.2999171499585749) internal successors, (1569), 1210 states have internal predecessors, (1569), 159 states have call successors, (159), 96 states have call predecessors, (159), 95 states have return successors, (184), 156 states have call predecessors, (184), 156 states have call successors, (184) [2021-12-07 01:37:20,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 1912 transitions. [2021-12-07 01:37:20,436 INFO L78 Accepts]: Start accepts. Automaton has 1462 states and 1912 transitions. Word has length 60 [2021-12-07 01:37:20,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:37:20,436 INFO L470 AbstractCegarLoop]: Abstraction has 1462 states and 1912 transitions. [2021-12-07 01:37:20,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-12-07 01:37:20,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 1912 transitions. [2021-12-07 01:37:20,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-12-07 01:37:20,438 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:37:20,438 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:37:20,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-07 01:37:20,439 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:37:20,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:37:20,439 INFO L85 PathProgramCache]: Analyzing trace with hash 2020590272, now seen corresponding path program 1 times [2021-12-07 01:37:20,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:37:20,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818147599] [2021-12-07 01:37:20,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:37:20,440 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:37:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:20,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:37:20,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:20,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:37:20,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:20,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-07 01:37:20,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:20,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-07 01:37:20,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:20,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:37:20,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:20,515 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-07 01:37:20,516 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:37:20,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818147599] [2021-12-07 01:37:20,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818147599] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:37:20,516 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:37:20,516 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-07 01:37:20,517 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630504289] [2021-12-07 01:37:20,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:37:20,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-07 01:37:20,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:37:20,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-07 01:37:20,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-07 01:37:20,518 INFO L87 Difference]: Start difference. First operand 1462 states and 1912 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-12-07 01:37:21,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:37:21,058 INFO L93 Difference]: Finished difference Result 4674 states and 6439 transitions. [2021-12-07 01:37:21,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-07 01:37:21,058 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 63 [2021-12-07 01:37:21,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:37:21,084 INFO L225 Difference]: With dead ends: 4674 [2021-12-07 01:37:21,084 INFO L226 Difference]: Without dead ends: 3290 [2021-12-07 01:37:21,090 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-12-07 01:37:21,091 INFO L933 BasicCegarLoop]: 252 mSDtfsCounter, 583 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-07 01:37:21,091 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [602 Valid, 978 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-07 01:37:21,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3290 states. [2021-12-07 01:37:21,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3290 to 2074. [2021-12-07 01:37:21,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2074 states, 1715 states have (on average 1.2979591836734694) internal successors, (2226), 1718 states have internal predecessors, (2226), 223 states have call successors, (223), 136 states have call predecessors, (223), 135 states have return successors, (262), 220 states have call predecessors, (262), 220 states have call successors, (262) [2021-12-07 01:37:21,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 2711 transitions. [2021-12-07 01:37:21,292 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 2711 transitions. Word has length 63 [2021-12-07 01:37:21,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:37:21,292 INFO L470 AbstractCegarLoop]: Abstraction has 2074 states and 2711 transitions. [2021-12-07 01:37:21,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-12-07 01:37:21,293 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 2711 transitions. [2021-12-07 01:37:21,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-07 01:37:21,294 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:37:21,294 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:37:21,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-07 01:37:21,295 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:37:21,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:37:21,295 INFO L85 PathProgramCache]: Analyzing trace with hash -285621863, now seen corresponding path program 1 times [2021-12-07 01:37:21,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:37:21,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691729363] [2021-12-07 01:37:21,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:37:21,296 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:37:21,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:21,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:37:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:21,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:37:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:21,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-07 01:37:21,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:21,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-07 01:37:21,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:21,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:37:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:21,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-07 01:37:21,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:21,365 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-07 01:37:21,365 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:37:21,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691729363] [2021-12-07 01:37:21,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691729363] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:37:21,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642074636] [2021-12-07 01:37:21,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:37:21,366 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:37:21,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:37:21,368 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:37:21,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-07 01:37:21,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:21,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-07 01:37:21,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:37:21,586 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:37:21,587 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:37:21,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642074636] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:37:21,587 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 01:37:21,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-12-07 01:37:21,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972824648] [2021-12-07 01:37:21,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:37:21,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 01:37:21,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:37:21,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 01:37:21,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-07 01:37:21,589 INFO L87 Difference]: Start difference. First operand 2074 states and 2711 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-07 01:37:21,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:37:21,842 INFO L93 Difference]: Finished difference Result 5786 states and 7696 transitions. [2021-12-07 01:37:21,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 01:37:21,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 68 [2021-12-07 01:37:21,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:37:21,873 INFO L225 Difference]: With dead ends: 5786 [2021-12-07 01:37:21,873 INFO L226 Difference]: Without dead ends: 3723 [2021-12-07 01:37:21,881 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-07 01:37:21,882 INFO L933 BasicCegarLoop]: 234 mSDtfsCounter, 92 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:37:21,883 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 364 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:37:21,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2021-12-07 01:37:22,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 3585. [2021-12-07 01:37:22,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3585 states, 2937 states have (on average 1.275110657133129) internal successors, (3745), 2941 states have internal predecessors, (3745), 402 states have call successors, (402), 246 states have call predecessors, (402), 245 states have return successors, (553), 399 states have call predecessors, (553), 399 states have call successors, (553) [2021-12-07 01:37:22,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3585 states to 3585 states and 4700 transitions. [2021-12-07 01:37:22,175 INFO L78 Accepts]: Start accepts. Automaton has 3585 states and 4700 transitions. Word has length 68 [2021-12-07 01:37:22,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:37:22,176 INFO L470 AbstractCegarLoop]: Abstraction has 3585 states and 4700 transitions. [2021-12-07 01:37:22,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-07 01:37:22,176 INFO L276 IsEmpty]: Start isEmpty. Operand 3585 states and 4700 transitions. [2021-12-07 01:37:22,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-07 01:37:22,177 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:37:22,178 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:37:22,213 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-07 01:37:22,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:37:22,379 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:37:22,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:37:22,379 INFO L85 PathProgramCache]: Analyzing trace with hash -914471196, now seen corresponding path program 1 times [2021-12-07 01:37:22,379 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:37:22,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537544328] [2021-12-07 01:37:22,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:37:22,380 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:37:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:22,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:37:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:22,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:37:22,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:22,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-07 01:37:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:22,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-07 01:37:22,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:22,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:37:22,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:22,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-07 01:37:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:22,442 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-07 01:37:22,443 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:37:22,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537544328] [2021-12-07 01:37:22,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537544328] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:37:22,443 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:37:22,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-07 01:37:22,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331573281] [2021-12-07 01:37:22,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:37:22,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 01:37:22,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:37:22,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 01:37:22,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:37:22,446 INFO L87 Difference]: Start difference. First operand 3585 states and 4700 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-07 01:37:22,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:37:22,847 INFO L93 Difference]: Finished difference Result 7440 states and 9799 transitions. [2021-12-07 01:37:22,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-07 01:37:22,847 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 71 [2021-12-07 01:37:22,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:37:22,874 INFO L225 Difference]: With dead ends: 7440 [2021-12-07 01:37:22,874 INFO L226 Difference]: Without dead ends: 3870 [2021-12-07 01:37:22,887 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-12-07 01:37:22,887 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 163 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:37:22,888 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 435 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:37:22,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3870 states. [2021-12-07 01:37:23,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3870 to 3623. [2021-12-07 01:37:23,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3623 states, 2956 states have (on average 1.257104194857916) internal successors, (3716), 2979 states have internal predecessors, (3716), 402 states have call successors, (402), 246 states have call predecessors, (402), 264 states have return successors, (553), 399 states have call predecessors, (553), 399 states have call successors, (553) [2021-12-07 01:37:23,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3623 states to 3623 states and 4671 transitions. [2021-12-07 01:37:23,124 INFO L78 Accepts]: Start accepts. Automaton has 3623 states and 4671 transitions. Word has length 71 [2021-12-07 01:37:23,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:37:23,124 INFO L470 AbstractCegarLoop]: Abstraction has 3623 states and 4671 transitions. [2021-12-07 01:37:23,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-07 01:37:23,125 INFO L276 IsEmpty]: Start isEmpty. Operand 3623 states and 4671 transitions. [2021-12-07 01:37:23,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-07 01:37:23,126 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:37:23,126 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:37:23,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-07 01:37:23,126 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:37:23,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:37:23,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1331867802, now seen corresponding path program 1 times [2021-12-07 01:37:23,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:37:23,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280030753] [2021-12-07 01:37:23,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:37:23,127 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:37:23,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:23,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:37:23,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:23,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:37:23,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:23,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-07 01:37:23,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:23,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-07 01:37:23,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:23,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:37:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:23,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-07 01:37:23,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:23,160 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-07 01:37:23,160 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:37:23,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280030753] [2021-12-07 01:37:23,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280030753] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:37:23,161 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:37:23,161 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:37:23,161 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404709077] [2021-12-07 01:37:23,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:37:23,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:37:23,162 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:37:23,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:37:23,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:37:23,162 INFO L87 Difference]: Start difference. First operand 3623 states and 4671 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-07 01:37:23,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:37:23,397 INFO L93 Difference]: Finished difference Result 4090 states and 5308 transitions. [2021-12-07 01:37:23,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-07 01:37:23,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2021-12-07 01:37:23,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:37:23,424 INFO L225 Difference]: With dead ends: 4090 [2021-12-07 01:37:23,425 INFO L226 Difference]: Without dead ends: 3885 [2021-12-07 01:37:23,427 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:37:23,428 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 174 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:37:23,429 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 215 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:37:23,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3885 states. [2021-12-07 01:37:23,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3885 to 3554. [2021-12-07 01:37:23,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3554 states, 2903 states have (on average 1.258008956252153) internal successors, (3652), 2925 states have internal predecessors, (3652), 391 states have call successors, (391), 241 states have call predecessors, (391), 259 states have return successors, (542), 388 states have call predecessors, (542), 388 states have call successors, (542) [2021-12-07 01:37:23,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3554 states to 3554 states and 4585 transitions. [2021-12-07 01:37:23,718 INFO L78 Accepts]: Start accepts. Automaton has 3554 states and 4585 transitions. Word has length 71 [2021-12-07 01:37:23,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:37:23,718 INFO L470 AbstractCegarLoop]: Abstraction has 3554 states and 4585 transitions. [2021-12-07 01:37:23,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-07 01:37:23,719 INFO L276 IsEmpty]: Start isEmpty. Operand 3554 states and 4585 transitions. [2021-12-07 01:37:23,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-12-07 01:37:23,720 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:37:23,720 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:37:23,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-07 01:37:23,721 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:37:23,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:37:23,721 INFO L85 PathProgramCache]: Analyzing trace with hash -2052507104, now seen corresponding path program 1 times [2021-12-07 01:37:23,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:37:23,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869444808] [2021-12-07 01:37:23,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:37:23,722 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:37:23,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:23,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:37:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:23,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:37:23,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:23,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-07 01:37:23,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:23,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-07 01:37:23,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:23,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:37:23,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:23,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-07 01:37:23,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:23,781 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-07 01:37:23,781 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:37:23,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869444808] [2021-12-07 01:37:23,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869444808] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:37:23,781 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:37:23,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-07 01:37:23,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244118802] [2021-12-07 01:37:23,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:37:23,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-07 01:37:23,782 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:37:23,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-07 01:37:23,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-07 01:37:23,783 INFO L87 Difference]: Start difference. First operand 3554 states and 4585 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-07 01:37:24,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:37:24,480 INFO L93 Difference]: Finished difference Result 10646 states and 14120 transitions. [2021-12-07 01:37:24,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-07 01:37:24,481 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 72 [2021-12-07 01:37:24,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:37:24,528 INFO L225 Difference]: With dead ends: 10646 [2021-12-07 01:37:24,528 INFO L226 Difference]: Without dead ends: 6920 [2021-12-07 01:37:24,542 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-12-07 01:37:24,543 INFO L933 BasicCegarLoop]: 257 mSDtfsCounter, 634 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:37:24,543 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [646 Valid, 770 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-07 01:37:24,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6920 states. [2021-12-07 01:37:25,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6920 to 6782. [2021-12-07 01:37:25,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6782 states, 5504 states have (on average 1.2185683139534884) internal successors, (6707), 5566 states have internal predecessors, (6707), 754 states have call successors, (754), 466 states have call predecessors, (754), 523 states have return successors, (1151), 751 states have call predecessors, (1151), 751 states have call successors, (1151) [2021-12-07 01:37:25,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6782 states to 6782 states and 8612 transitions. [2021-12-07 01:37:25,071 INFO L78 Accepts]: Start accepts. Automaton has 6782 states and 8612 transitions. Word has length 72 [2021-12-07 01:37:25,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:37:25,071 INFO L470 AbstractCegarLoop]: Abstraction has 6782 states and 8612 transitions. [2021-12-07 01:37:25,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-07 01:37:25,071 INFO L276 IsEmpty]: Start isEmpty. Operand 6782 states and 8612 transitions. [2021-12-07 01:37:25,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-12-07 01:37:25,077 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:37:25,077 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:37:25,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-07 01:37:25,078 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:37:25,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:37:25,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1221595769, now seen corresponding path program 1 times [2021-12-07 01:37:25,078 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:37:25,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883581958] [2021-12-07 01:37:25,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:37:25,078 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:37:25,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:25,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:37:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:25,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:37:25,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:25,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-07 01:37:25,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:25,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-07 01:37:25,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:25,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:37:25,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:25,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-07 01:37:25,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:25,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-07 01:37:25,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:25,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-07 01:37:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:25,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-07 01:37:25,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:25,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-07 01:37:25,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:25,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-07 01:37:25,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:25,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-07 01:37:25,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:25,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-07 01:37:25,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:25,165 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2021-12-07 01:37:25,165 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:37:25,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883581958] [2021-12-07 01:37:25,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883581958] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:37:25,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433797829] [2021-12-07 01:37:25,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:37:25,166 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:37:25,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:37:25,167 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:37:25,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-07 01:37:25,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:25,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-07 01:37:25,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:37:25,420 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-12-07 01:37:25,420 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:37:25,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433797829] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:37:25,421 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 01:37:25,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2021-12-07 01:37:25,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618526308] [2021-12-07 01:37:25,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:37:25,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 01:37:25,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:37:25,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 01:37:25,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-07 01:37:25,423 INFO L87 Difference]: Start difference. First operand 6782 states and 8612 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-07 01:37:25,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:37:25,666 INFO L93 Difference]: Finished difference Result 11268 states and 14376 transitions. [2021-12-07 01:37:25,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 01:37:25,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 127 [2021-12-07 01:37:25,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:37:25,683 INFO L225 Difference]: With dead ends: 11268 [2021-12-07 01:37:25,683 INFO L226 Difference]: Without dead ends: 4297 [2021-12-07 01:37:25,702 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-07 01:37:25,703 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 76 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:37:25,703 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 135 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:37:25,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4297 states. [2021-12-07 01:37:25,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4297 to 4293. [2021-12-07 01:37:25,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4293 states, 3485 states have (on average 1.20545193687231) internal successors, (4201), 3521 states have internal predecessors, (4201), 478 states have call successors, (478), 296 states have call predecessors, (478), 329 states have return successors, (694), 476 states have call predecessors, (694), 476 states have call successors, (694) [2021-12-07 01:37:25,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4293 states to 4293 states and 5373 transitions. [2021-12-07 01:37:25,916 INFO L78 Accepts]: Start accepts. Automaton has 4293 states and 5373 transitions. Word has length 127 [2021-12-07 01:37:25,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:37:25,916 INFO L470 AbstractCegarLoop]: Abstraction has 4293 states and 5373 transitions. [2021-12-07 01:37:25,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-07 01:37:25,916 INFO L276 IsEmpty]: Start isEmpty. Operand 4293 states and 5373 transitions. [2021-12-07 01:37:25,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-12-07 01:37:25,920 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:37:25,920 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:37:25,952 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-07 01:37:26,120 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:37:26,121 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:37:26,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:37:26,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1343258013, now seen corresponding path program 1 times [2021-12-07 01:37:26,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:37:26,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423863355] [2021-12-07 01:37:26,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:37:26,122 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:37:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:26,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:37:26,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:26,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:37:26,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:26,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-07 01:37:26,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:26,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-07 01:37:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:26,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:37:26,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:26,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-07 01:37:26,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:26,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-07 01:37:26,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:26,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-07 01:37:26,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:26,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-07 01:37:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:26,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-07 01:37:26,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:26,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-07 01:37:26,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:26,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-07 01:37:26,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:26,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2021-12-07 01:37:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:26,214 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-12-07 01:37:26,214 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:37:26,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423863355] [2021-12-07 01:37:26,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423863355] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:37:26,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052503952] [2021-12-07 01:37:26,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:37:26,215 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:37:26,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:37:26,216 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:37:26,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-07 01:37:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:26,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-07 01:37:26,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:37:26,439 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-07 01:37:26,440 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:37:26,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052503952] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:37:26,440 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 01:37:26,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2021-12-07 01:37:26,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900011998] [2021-12-07 01:37:26,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:37:26,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 01:37:26,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:37:26,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 01:37:26,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-07 01:37:26,442 INFO L87 Difference]: Start difference. First operand 4293 states and 5373 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-07 01:37:26,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:37:26,727 INFO L93 Difference]: Finished difference Result 9150 states and 11419 transitions. [2021-12-07 01:37:26,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 01:37:26,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 131 [2021-12-07 01:37:26,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:37:26,748 INFO L225 Difference]: With dead ends: 9150 [2021-12-07 01:37:26,748 INFO L226 Difference]: Without dead ends: 5190 [2021-12-07 01:37:26,760 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-07 01:37:26,761 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 45 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:37:26,762 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 266 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:37:26,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5190 states. [2021-12-07 01:37:27,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5190 to 5190. [2021-12-07 01:37:27,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5190 states, 4198 states have (on average 1.193425440686041) internal successors, (5010), 4238 states have internal predecessors, (5010), 583 states have call successors, (583), 371 states have call predecessors, (583), 408 states have return successors, (809), 581 states have call predecessors, (809), 581 states have call successors, (809) [2021-12-07 01:37:27,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5190 states to 5190 states and 6402 transitions. [2021-12-07 01:37:27,076 INFO L78 Accepts]: Start accepts. Automaton has 5190 states and 6402 transitions. Word has length 131 [2021-12-07 01:37:27,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:37:27,076 INFO L470 AbstractCegarLoop]: Abstraction has 5190 states and 6402 transitions. [2021-12-07 01:37:27,077 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-07 01:37:27,077 INFO L276 IsEmpty]: Start isEmpty. Operand 5190 states and 6402 transitions. [2021-12-07 01:37:27,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-12-07 01:37:27,082 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:37:27,082 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:37:27,102 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-07 01:37:27,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:37:27,282 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:37:27,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:37:27,283 INFO L85 PathProgramCache]: Analyzing trace with hash 844943966, now seen corresponding path program 1 times [2021-12-07 01:37:27,283 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:37:27,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727971839] [2021-12-07 01:37:27,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:37:27,283 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:37:27,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:27,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:37:27,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:27,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:37:27,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:27,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-07 01:37:27,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:27,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-07 01:37:27,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:27,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:37:27,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:27,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-07 01:37:27,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:27,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-07 01:37:27,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:27,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-07 01:37:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:27,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-07 01:37:27,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:27,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-07 01:37:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:27,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-07 01:37:27,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:27,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-07 01:37:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:27,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-07 01:37:27,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:27,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-07 01:37:27,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:27,376 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2021-12-07 01:37:27,376 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:37:27,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727971839] [2021-12-07 01:37:27,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727971839] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:37:27,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16640911] [2021-12-07 01:37:27,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:37:27,377 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:37:27,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:37:27,379 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:37:27,389 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-07 01:37:27,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:27,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-07 01:37:27,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:37:27,667 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-12-07 01:37:27,667 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:37:27,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16640911] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:37:27,667 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 01:37:27,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2021-12-07 01:37:27,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431322958] [2021-12-07 01:37:27,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:37:27,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 01:37:27,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:37:27,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 01:37:27,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-07 01:37:27,670 INFO L87 Difference]: Start difference. First operand 5190 states and 6402 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2021-12-07 01:37:28,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:37:28,047 INFO L93 Difference]: Finished difference Result 13673 states and 17010 transitions. [2021-12-07 01:37:28,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 01:37:28,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 154 [2021-12-07 01:37:28,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:37:28,066 INFO L225 Difference]: With dead ends: 13673 [2021-12-07 01:37:28,066 INFO L226 Difference]: Without dead ends: 8722 [2021-12-07 01:37:28,075 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-07 01:37:28,076 INFO L933 BasicCegarLoop]: 234 mSDtfsCounter, 95 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:37:28,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 356 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:37:28,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8722 states. [2021-12-07 01:37:28,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8722 to 8718. [2021-12-07 01:37:28,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8718 states, 7074 states have (on average 1.1707661860333616) internal successors, (8282), 7130 states have internal predecessors, (8282), 947 states have call successors, (947), 643 states have call predecessors, (947), 696 states have return successors, (1365), 945 states have call predecessors, (1365), 945 states have call successors, (1365) [2021-12-07 01:37:28,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8718 states to 8718 states and 10594 transitions. [2021-12-07 01:37:28,439 INFO L78 Accepts]: Start accepts. Automaton has 8718 states and 10594 transitions. Word has length 154 [2021-12-07 01:37:28,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:37:28,440 INFO L470 AbstractCegarLoop]: Abstraction has 8718 states and 10594 transitions. [2021-12-07 01:37:28,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2021-12-07 01:37:28,440 INFO L276 IsEmpty]: Start isEmpty. Operand 8718 states and 10594 transitions. [2021-12-07 01:37:28,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-12-07 01:37:28,444 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:37:28,445 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:37:28,478 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-07 01:37:28,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-07 01:37:28,645 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:37:28,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:37:28,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1688949468, now seen corresponding path program 1 times [2021-12-07 01:37:28,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:37:28,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494768867] [2021-12-07 01:37:28,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:37:28,646 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:37:28,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:28,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:37:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:28,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:37:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:28,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-07 01:37:28,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:28,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-07 01:37:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:28,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:37:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:28,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-07 01:37:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:28,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-07 01:37:28,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:28,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-07 01:37:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:28,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-07 01:37:28,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:28,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-07 01:37:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:28,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-07 01:37:28,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:28,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-07 01:37:28,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:28,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-07 01:37:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:28,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-07 01:37:28,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:28,733 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2021-12-07 01:37:28,733 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:37:28,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494768867] [2021-12-07 01:37:28,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494768867] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:37:28,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922976044] [2021-12-07 01:37:28,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:37:28,734 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:37:28,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:37:28,735 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:37:28,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-07 01:37:28,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:28,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-07 01:37:28,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:37:29,002 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-07 01:37:29,002 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:37:29,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922976044] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:37:29,002 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 01:37:29,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2021-12-07 01:37:29,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281561344] [2021-12-07 01:37:29,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:37:29,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-07 01:37:29,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:37:29,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-07 01:37:29,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-07 01:37:29,004 INFO L87 Difference]: Start difference. First operand 8718 states and 10594 transitions. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-07 01:37:29,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:37:29,311 INFO L93 Difference]: Finished difference Result 14114 states and 17190 transitions. [2021-12-07 01:37:29,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-07 01:37:29,312 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 154 [2021-12-07 01:37:29,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:37:29,327 INFO L225 Difference]: With dead ends: 14114 [2021-12-07 01:37:29,327 INFO L226 Difference]: Without dead ends: 5407 [2021-12-07 01:37:29,344 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-12-07 01:37:29,345 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 46 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:37:29,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 621 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:37:29,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5407 states. [2021-12-07 01:37:29,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5407 to 5115. [2021-12-07 01:37:29,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5115 states, 4342 states have (on average 1.1706586826347305) internal successors, (5083), 4354 states have internal predecessors, (5083), 440 states have call successors, (440), 276 states have call predecessors, (440), 332 states have return successors, (645), 484 states have call predecessors, (645), 438 states have call successors, (645) [2021-12-07 01:37:29,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5115 states to 5115 states and 6168 transitions. [2021-12-07 01:37:29,655 INFO L78 Accepts]: Start accepts. Automaton has 5115 states and 6168 transitions. Word has length 154 [2021-12-07 01:37:29,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:37:29,655 INFO L470 AbstractCegarLoop]: Abstraction has 5115 states and 6168 transitions. [2021-12-07 01:37:29,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-07 01:37:29,656 INFO L276 IsEmpty]: Start isEmpty. Operand 5115 states and 6168 transitions. [2021-12-07 01:37:29,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-12-07 01:37:29,659 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:37:29,659 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:37:29,692 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-07 01:37:29,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-07 01:37:29,860 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:37:29,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:37:29,860 INFO L85 PathProgramCache]: Analyzing trace with hash -493377335, now seen corresponding path program 1 times [2021-12-07 01:37:29,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:37:29,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908523452] [2021-12-07 01:37:29,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:37:29,861 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:37:29,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:29,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:37:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:29,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:37:29,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:29,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-07 01:37:29,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:29,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-07 01:37:29,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:29,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:37:29,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:29,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-07 01:37:29,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:29,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-07 01:37:29,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:29,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-07 01:37:29,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:29,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-12-07 01:37:29,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:29,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-07 01:37:29,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:29,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-07 01:37:29,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:29,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-07 01:37:29,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:29,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-12-07 01:37:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:29,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-07 01:37:29,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:29,946 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-12-07 01:37:29,946 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:37:29,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908523452] [2021-12-07 01:37:29,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908523452] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:37:29,947 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:37:29,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:37:29,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699621020] [2021-12-07 01:37:29,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:37:29,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:37:29,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:37:29,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:37:29,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:37:29,948 INFO L87 Difference]: Start difference. First operand 5115 states and 6168 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-12-07 01:37:30,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:37:30,243 INFO L93 Difference]: Finished difference Result 5302 states and 6385 transitions. [2021-12-07 01:37:30,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 01:37:30,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 158 [2021-12-07 01:37:30,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:37:30,252 INFO L225 Difference]: With dead ends: 5302 [2021-12-07 01:37:30,252 INFO L226 Difference]: Without dead ends: 5025 [2021-12-07 01:37:30,254 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:37:30,254 INFO L933 BasicCegarLoop]: 129 mSDtfsCounter, 94 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:37:30,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 305 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:37:30,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5025 states. [2021-12-07 01:37:30,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5025 to 4841. [2021-12-07 01:37:30,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4841 states, 4110 states have (on average 1.1734793187347932) internal successors, (4823), 4121 states have internal predecessors, (4823), 417 states have call successors, (417), 260 states have call predecessors, (417), 313 states have return successors, (619), 459 states have call predecessors, (619), 415 states have call successors, (619) [2021-12-07 01:37:30,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4841 states to 4841 states and 5859 transitions. [2021-12-07 01:37:30,442 INFO L78 Accepts]: Start accepts. Automaton has 4841 states and 5859 transitions. Word has length 158 [2021-12-07 01:37:30,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:37:30,442 INFO L470 AbstractCegarLoop]: Abstraction has 4841 states and 5859 transitions. [2021-12-07 01:37:30,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-12-07 01:37:30,442 INFO L276 IsEmpty]: Start isEmpty. Operand 4841 states and 5859 transitions. [2021-12-07 01:37:30,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-12-07 01:37:30,444 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:37:30,444 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:37:30,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-07 01:37:30,444 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:37:30,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:37:30,445 INFO L85 PathProgramCache]: Analyzing trace with hash -850407883, now seen corresponding path program 1 times [2021-12-07 01:37:30,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:37:30,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589346697] [2021-12-07 01:37:30,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:37:30,445 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:37:30,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:30,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:37:30,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:30,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:37:30,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:30,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-07 01:37:30,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:30,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-07 01:37:30,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:30,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:37:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:30,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-07 01:37:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:30,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-07 01:37:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:30,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-07 01:37:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:30,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-07 01:37:30,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:30,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-07 01:37:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:30,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-07 01:37:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:30,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-07 01:37:30,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:30,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-12-07 01:37:30,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:30,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-07 01:37:30,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:30,522 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 16 proven. 28 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-12-07 01:37:30,522 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:37:30,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589346697] [2021-12-07 01:37:30,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589346697] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:37:30,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412667547] [2021-12-07 01:37:30,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:37:30,523 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:37:30,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:37:30,524 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:37:30,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-07 01:37:30,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:30,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-07 01:37:30,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:37:30,730 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-12-07 01:37:30,731 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:37:30,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412667547] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:37:30,731 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 01:37:30,731 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2021-12-07 01:37:30,731 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535365592] [2021-12-07 01:37:30,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:37:30,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 01:37:30,732 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:37:30,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 01:37:30,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-07 01:37:30,732 INFO L87 Difference]: Start difference. First operand 4841 states and 5859 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-12-07 01:37:30,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:37:30,919 INFO L93 Difference]: Finished difference Result 9087 states and 11040 transitions. [2021-12-07 01:37:30,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 01:37:30,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 164 [2021-12-07 01:37:30,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:37:30,930 INFO L225 Difference]: With dead ends: 9087 [2021-12-07 01:37:30,930 INFO L226 Difference]: Without dead ends: 4503 [2021-12-07 01:37:30,935 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-07 01:37:30,936 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 25 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:37:30,936 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 259 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:37:30,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4503 states. [2021-12-07 01:37:31,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4503 to 4503. [2021-12-07 01:37:31,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4503 states, 3841 states have (on average 1.1759958344181203) internal successors, (4517), 3852 states have internal predecessors, (4517), 377 states have call successors, (377), 234 states have call predecessors, (377), 284 states have return successors, (568), 416 states have call predecessors, (568), 375 states have call successors, (568) [2021-12-07 01:37:31,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4503 states to 4503 states and 5462 transitions. [2021-12-07 01:37:31,173 INFO L78 Accepts]: Start accepts. Automaton has 4503 states and 5462 transitions. Word has length 164 [2021-12-07 01:37:31,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:37:31,174 INFO L470 AbstractCegarLoop]: Abstraction has 4503 states and 5462 transitions. [2021-12-07 01:37:31,174 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-12-07 01:37:31,174 INFO L276 IsEmpty]: Start isEmpty. Operand 4503 states and 5462 transitions. [2021-12-07 01:37:31,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-12-07 01:37:31,176 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:37:31,176 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:37:31,200 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-07 01:37:31,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-07 01:37:31,377 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:37:31,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:37:31,377 INFO L85 PathProgramCache]: Analyzing trace with hash 990777910, now seen corresponding path program 1 times [2021-12-07 01:37:31,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:37:31,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387955029] [2021-12-07 01:37:31,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:37:31,378 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:37:31,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:31,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:37:31,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:31,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:37:31,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:31,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-07 01:37:31,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:31,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-07 01:37:31,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:31,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:37:31,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:31,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-07 01:37:31,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:31,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-07 01:37:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:31,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-07 01:37:31,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:31,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-07 01:37:31,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:31,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-07 01:37:31,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:31,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-07 01:37:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:31,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-07 01:37:31,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:31,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-12-07 01:37:31,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:31,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-07 01:37:31,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:31,453 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2021-12-07 01:37:31,453 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:37:31,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387955029] [2021-12-07 01:37:31,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387955029] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:37:31,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113319104] [2021-12-07 01:37:31,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:37:31,454 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:37:31,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:37:31,455 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:37:31,465 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-07 01:37:31,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:31,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-07 01:37:31,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:37:31,662 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-07 01:37:31,662 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:37:31,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113319104] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:37:31,662 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 01:37:31,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2021-12-07 01:37:31,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862253507] [2021-12-07 01:37:31,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:37:31,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 01:37:31,663 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:37:31,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 01:37:31,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:37:31,664 INFO L87 Difference]: Start difference. First operand 4503 states and 5462 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-07 01:37:31,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:37:31,831 INFO L93 Difference]: Finished difference Result 8682 states and 10665 transitions. [2021-12-07 01:37:31,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 01:37:31,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 164 [2021-12-07 01:37:31,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:37:31,840 INFO L225 Difference]: With dead ends: 8682 [2021-12-07 01:37:31,841 INFO L226 Difference]: Without dead ends: 4330 [2021-12-07 01:37:31,846 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:37:31,847 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 84 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:37:31,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 301 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:37:31,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4330 states. [2021-12-07 01:37:31,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4330 to 4327. [2021-12-07 01:37:32,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4327 states, 3665 states have (on average 1.1607094133697136) internal successors, (4254), 3676 states have internal predecessors, (4254), 377 states have call successors, (377), 234 states have call predecessors, (377), 284 states have return successors, (568), 416 states have call predecessors, (568), 375 states have call successors, (568) [2021-12-07 01:37:32,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4327 states to 4327 states and 5199 transitions. [2021-12-07 01:37:32,009 INFO L78 Accepts]: Start accepts. Automaton has 4327 states and 5199 transitions. Word has length 164 [2021-12-07 01:37:32,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:37:32,009 INFO L470 AbstractCegarLoop]: Abstraction has 4327 states and 5199 transitions. [2021-12-07 01:37:32,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-07 01:37:32,009 INFO L276 IsEmpty]: Start isEmpty. Operand 4327 states and 5199 transitions. [2021-12-07 01:37:32,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-12-07 01:37:32,011 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:37:32,011 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:37:32,031 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-07 01:37:32,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:37:32,211 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:37:32,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:37:32,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1614442849, now seen corresponding path program 1 times [2021-12-07 01:37:32,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:37:32,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427313138] [2021-12-07 01:37:32,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:37:32,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:37:32,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:32,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:37:32,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:32,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:37:32,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:32,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-07 01:37:32,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:32,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-07 01:37:32,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:32,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:37:32,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:32,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-07 01:37:32,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:32,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-07 01:37:32,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:32,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-07 01:37:32,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:32,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-07 01:37:32,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:32,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-07 01:37:32,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:32,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-07 01:37:32,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:32,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-07 01:37:32,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:32,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-12-07 01:37:32,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:32,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-12-07 01:37:32,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:32,293 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2021-12-07 01:37:32,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:37:32,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427313138] [2021-12-07 01:37:32,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427313138] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:37:32,294 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:37:32,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-07 01:37:32,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369528721] [2021-12-07 01:37:32,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:37:32,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-07 01:37:32,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:37:32,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-07 01:37:32,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-07 01:37:32,296 INFO L87 Difference]: Start difference. First operand 4327 states and 5199 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-12-07 01:37:32,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:37:32,819 INFO L93 Difference]: Finished difference Result 11283 states and 13998 transitions. [2021-12-07 01:37:32,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-07 01:37:32,819 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 165 [2021-12-07 01:37:32,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:37:32,833 INFO L225 Difference]: With dead ends: 11283 [2021-12-07 01:37:32,833 INFO L226 Difference]: Without dead ends: 6881 [2021-12-07 01:37:32,840 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-12-07 01:37:32,840 INFO L933 BasicCegarLoop]: 232 mSDtfsCounter, 430 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:37:32,840 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [451 Valid, 842 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-07 01:37:32,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6881 states. [2021-12-07 01:37:33,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6881 to 4783. [2021-12-07 01:37:33,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4783 states, 4052 states have (on average 1.1581934846989141) internal successors, (4693), 4067 states have internal predecessors, (4693), 415 states have call successors, (415), 257 states have call predecessors, (415), 315 states have return successors, (623), 458 states have call predecessors, (623), 413 states have call successors, (623) [2021-12-07 01:37:33,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4783 states to 4783 states and 5731 transitions. [2021-12-07 01:37:33,048 INFO L78 Accepts]: Start accepts. Automaton has 4783 states and 5731 transitions. Word has length 165 [2021-12-07 01:37:33,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:37:33,048 INFO L470 AbstractCegarLoop]: Abstraction has 4783 states and 5731 transitions. [2021-12-07 01:37:33,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-12-07 01:37:33,049 INFO L276 IsEmpty]: Start isEmpty. Operand 4783 states and 5731 transitions. [2021-12-07 01:37:33,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2021-12-07 01:37:33,050 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:37:33,050 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:37:33,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-07 01:37:33,050 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:37:33,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:37:33,051 INFO L85 PathProgramCache]: Analyzing trace with hash 2040758312, now seen corresponding path program 1 times [2021-12-07 01:37:33,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:37:33,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288163713] [2021-12-07 01:37:33,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:37:33,051 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:37:33,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:33,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:37:33,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:33,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:37:33,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:33,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-07 01:37:33,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:33,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-07 01:37:33,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:33,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:37:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:33,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-07 01:37:33,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:33,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-07 01:37:33,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:33,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-07 01:37:33,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:33,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-07 01:37:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:33,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-07 01:37:33,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:33,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-07 01:37:33,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:33,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-12-07 01:37:33,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:33,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-07 01:37:33,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:33,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-12-07 01:37:33,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:33,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-12-07 01:37:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:33,105 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 40 proven. 6 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2021-12-07 01:37:33,105 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:37:33,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288163713] [2021-12-07 01:37:33,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288163713] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:37:33,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65849759] [2021-12-07 01:37:33,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:37:33,106 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:37:33,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:37:33,107 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:37:33,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-07 01:37:33,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:33,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-07 01:37:33,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:37:33,340 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-07 01:37:33,340 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:37:33,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65849759] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:37:33,341 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 01:37:33,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-12-07 01:37:33,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635054072] [2021-12-07 01:37:33,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:37:33,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 01:37:33,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:37:33,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 01:37:33,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-07 01:37:33,342 INFO L87 Difference]: Start difference. First operand 4783 states and 5731 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-07 01:37:33,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:37:33,529 INFO L93 Difference]: Finished difference Result 8862 states and 10649 transitions. [2021-12-07 01:37:33,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 01:37:33,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 170 [2021-12-07 01:37:33,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:37:33,540 INFO L225 Difference]: With dead ends: 8862 [2021-12-07 01:37:33,541 INFO L226 Difference]: Without dead ends: 4169 [2021-12-07 01:37:33,546 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-07 01:37:33,547 INFO L933 BasicCegarLoop]: 173 mSDtfsCounter, 58 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:37:33,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 279 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:37:33,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4169 states. [2021-12-07 01:37:33,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4169 to 3893. [2021-12-07 01:37:33,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3893 states, 3313 states have (on average 1.15333534560821) internal successors, (3821), 3324 states have internal predecessors, (3821), 329 states have call successors, (329), 203 states have call predecessors, (329), 250 states have return successors, (444), 365 states have call predecessors, (444), 327 states have call successors, (444) [2021-12-07 01:37:33,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3893 states to 3893 states and 4594 transitions. [2021-12-07 01:37:33,737 INFO L78 Accepts]: Start accepts. Automaton has 3893 states and 4594 transitions. Word has length 170 [2021-12-07 01:37:33,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:37:33,738 INFO L470 AbstractCegarLoop]: Abstraction has 3893 states and 4594 transitions. [2021-12-07 01:37:33,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-07 01:37:33,738 INFO L276 IsEmpty]: Start isEmpty. Operand 3893 states and 4594 transitions. [2021-12-07 01:37:33,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2021-12-07 01:37:33,739 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:37:33,739 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:37:33,769 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-07 01:37:33,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:37:33,940 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:37:33,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:37:33,940 INFO L85 PathProgramCache]: Analyzing trace with hash -606151675, now seen corresponding path program 1 times [2021-12-07 01:37:33,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:37:33,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034636011] [2021-12-07 01:37:33,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:37:33,941 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:37:33,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:33,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:37:33,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:33,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:37:33,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:33,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-07 01:37:33,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:33,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-07 01:37:33,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:33,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:37:33,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:33,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-07 01:37:33,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:33,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-07 01:37:33,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:33,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-07 01:37:33,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:33,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-07 01:37:33,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:33,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-07 01:37:33,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:33,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-07 01:37:33,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:33,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-12-07 01:37:34,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:34,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-07 01:37:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:34,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-12-07 01:37:34,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:34,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-12-07 01:37:34,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:34,012 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 40 proven. 7 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2021-12-07 01:37:34,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:37:34,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034636011] [2021-12-07 01:37:34,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034636011] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:37:34,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251772878] [2021-12-07 01:37:34,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:37:34,013 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:37:34,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:37:34,014 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:37:34,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-07 01:37:34,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:34,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-07 01:37:34,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:37:34,240 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-12-07 01:37:34,240 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:37:34,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251772878] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:37:34,240 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 01:37:34,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2021-12-07 01:37:34,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129418425] [2021-12-07 01:37:34,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:37:34,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 01:37:34,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:37:34,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 01:37:34,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:37:34,242 INFO L87 Difference]: Start difference. First operand 3893 states and 4594 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-07 01:37:34,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:37:34,371 INFO L93 Difference]: Finished difference Result 4506 states and 5322 transitions. [2021-12-07 01:37:34,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 01:37:34,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 170 [2021-12-07 01:37:34,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:37:34,378 INFO L225 Difference]: With dead ends: 4506 [2021-12-07 01:37:34,378 INFO L226 Difference]: Without dead ends: 3896 [2021-12-07 01:37:34,380 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:37:34,381 INFO L933 BasicCegarLoop]: 212 mSDtfsCounter, 51 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:37:34,381 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 332 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:37:34,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3896 states. [2021-12-07 01:37:34,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3896 to 3893. [2021-12-07 01:37:34,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3893 states, 3313 states have (on average 1.1494114095985513) internal successors, (3808), 3324 states have internal predecessors, (3808), 329 states have call successors, (329), 203 states have call predecessors, (329), 250 states have return successors, (444), 365 states have call predecessors, (444), 327 states have call successors, (444) [2021-12-07 01:37:34,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3893 states to 3893 states and 4581 transitions. [2021-12-07 01:37:34,529 INFO L78 Accepts]: Start accepts. Automaton has 3893 states and 4581 transitions. Word has length 170 [2021-12-07 01:37:34,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:37:34,529 INFO L470 AbstractCegarLoop]: Abstraction has 3893 states and 4581 transitions. [2021-12-07 01:37:34,529 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-07 01:37:34,529 INFO L276 IsEmpty]: Start isEmpty. Operand 3893 states and 4581 transitions. [2021-12-07 01:37:34,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-12-07 01:37:34,531 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:37:34,531 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:37:34,550 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-07 01:37:34,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:37:34,731 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:37:34,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:37:34,732 INFO L85 PathProgramCache]: Analyzing trace with hash -635607035, now seen corresponding path program 1 times [2021-12-07 01:37:34,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:37:34,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063249759] [2021-12-07 01:37:34,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:37:34,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:37:34,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:34,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:37:34,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:34,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:37:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:34,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-07 01:37:34,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:34,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-07 01:37:34,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:34,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:37:34,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:34,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-07 01:37:34,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:34,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-07 01:37:34,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:34,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-07 01:37:34,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:34,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-07 01:37:34,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:34,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-07 01:37:34,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:34,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-07 01:37:34,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:34,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-07 01:37:34,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:34,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-12-07 01:37:34,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:34,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-07 01:37:34,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:34,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-12-07 01:37:34,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:34,843 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2021-12-07 01:37:34,843 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:37:34,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063249759] [2021-12-07 01:37:34,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063249759] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:37:34,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982683201] [2021-12-07 01:37:34,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:37:34,843 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:37:34,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:37:34,844 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:37:34,849 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-07 01:37:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:34,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-07 01:37:34,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:37:35,351 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2021-12-07 01:37:35,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:37:35,576 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2021-12-07 01:37:35,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982683201] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:37:35,576 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:37:35,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2021-12-07 01:37:35,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411952212] [2021-12-07 01:37:35,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:37:35,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-07 01:37:35,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:37:35,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-07 01:37:35,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-07 01:37:35,577 INFO L87 Difference]: Start difference. First operand 3893 states and 4581 transitions. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 5 states have internal predecessors, (136), 3 states have call successors, (30), 5 states have call predecessors, (30), 3 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2021-12-07 01:37:35,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:37:35,973 INFO L93 Difference]: Finished difference Result 8406 states and 10203 transitions. [2021-12-07 01:37:35,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-07 01:37:35,974 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 5 states have internal predecessors, (136), 3 states have call successors, (30), 5 states have call predecessors, (30), 3 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 172 [2021-12-07 01:37:35,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:37:35,983 INFO L225 Difference]: With dead ends: 8406 [2021-12-07 01:37:35,983 INFO L226 Difference]: Without dead ends: 5794 [2021-12-07 01:37:35,986 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 371 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-07 01:37:35,987 INFO L933 BasicCegarLoop]: 352 mSDtfsCounter, 250 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:37:35,987 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 1153 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:37:35,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5794 states. [2021-12-07 01:37:36,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5794 to 4184. [2021-12-07 01:37:36,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4184 states, 3559 states have (on average 1.1469513908401237) internal successors, (4082), 3570 states have internal predecessors, (4082), 355 states have call successors, (355), 219 states have call predecessors, (355), 269 states have return successors, (474), 394 states have call predecessors, (474), 353 states have call successors, (474) [2021-12-07 01:37:36,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4184 states to 4184 states and 4911 transitions. [2021-12-07 01:37:36,164 INFO L78 Accepts]: Start accepts. Automaton has 4184 states and 4911 transitions. Word has length 172 [2021-12-07 01:37:36,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:37:36,165 INFO L470 AbstractCegarLoop]: Abstraction has 4184 states and 4911 transitions. [2021-12-07 01:37:36,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 5 states have internal predecessors, (136), 3 states have call successors, (30), 5 states have call predecessors, (30), 3 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2021-12-07 01:37:36,165 INFO L276 IsEmpty]: Start isEmpty. Operand 4184 states and 4911 transitions. [2021-12-07 01:37:36,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2021-12-07 01:37:36,169 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:37:36,169 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:37:36,188 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-12-07 01:37:36,369 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-12-07 01:37:36,369 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:37:36,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:37:36,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1410851743, now seen corresponding path program 1 times [2021-12-07 01:37:36,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:37:36,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384384768] [2021-12-07 01:37:36,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:37:36,370 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:37:36,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:36,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:37:36,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:36,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:37:36,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:36,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-07 01:37:36,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:36,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-07 01:37:36,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:36,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:37:36,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:36,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-07 01:37:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:36,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-07 01:37:36,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:36,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-07 01:37:36,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:36,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-07 01:37:36,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:36,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-07 01:37:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:36,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-07 01:37:36,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:36,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-07 01:37:36,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:36,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-12-07 01:37:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:36,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-07 01:37:36,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:36,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-12-07 01:37:36,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:36,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2021-12-07 01:37:36,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:36,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2021-12-07 01:37:36,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:36,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2021-12-07 01:37:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:36,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2021-12-07 01:37:36,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:36,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-07 01:37:36,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:36,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2021-12-07 01:37:36,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:36,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-12-07 01:37:36,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:36,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2021-12-07 01:37:36,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:36,450 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 113 proven. 30 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2021-12-07 01:37:36,450 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:37:36,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384384768] [2021-12-07 01:37:36,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384384768] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:37:36,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611969477] [2021-12-07 01:37:36,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:37:36,451 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:37:36,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:37:36,451 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:37:36,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-07 01:37:36,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:36,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-07 01:37:36,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:37:36,738 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 319 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2021-12-07 01:37:36,738 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:37:36,738 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611969477] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:37:36,738 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 01:37:36,738 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-12-07 01:37:36,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490284650] [2021-12-07 01:37:36,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:37:36,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 01:37:36,739 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:37:36,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 01:37:36,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-07 01:37:36,740 INFO L87 Difference]: Start difference. First operand 4184 states and 4911 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2021-12-07 01:37:36,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:37:36,987 INFO L93 Difference]: Finished difference Result 10503 states and 12364 transitions. [2021-12-07 01:37:36,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 01:37:36,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 252 [2021-12-07 01:37:36,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:37:36,998 INFO L225 Difference]: With dead ends: 10503 [2021-12-07 01:37:36,998 INFO L226 Difference]: Without dead ends: 6523 [2021-12-07 01:37:37,002 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-07 01:37:37,003 INFO L933 BasicCegarLoop]: 213 mSDtfsCounter, 61 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:37:37,003 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 340 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:37:37,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6523 states. [2021-12-07 01:37:37,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6523 to 6406. [2021-12-07 01:37:37,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6406 states, 5441 states have (on average 1.139680205844514) internal successors, (6201), 5452 states have internal predecessors, (6201), 561 states have call successors, (561), 346 states have call predecessors, (561), 403 states have return successors, (711), 607 states have call predecessors, (711), 559 states have call successors, (711) [2021-12-07 01:37:37,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6406 states to 6406 states and 7473 transitions. [2021-12-07 01:37:37,355 INFO L78 Accepts]: Start accepts. Automaton has 6406 states and 7473 transitions. Word has length 252 [2021-12-07 01:37:37,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:37:37,355 INFO L470 AbstractCegarLoop]: Abstraction has 6406 states and 7473 transitions. [2021-12-07 01:37:37,355 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2021-12-07 01:37:37,356 INFO L276 IsEmpty]: Start isEmpty. Operand 6406 states and 7473 transitions. [2021-12-07 01:37:37,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2021-12-07 01:37:37,362 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:37:37,362 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:37:37,393 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-12-07 01:37:37,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-12-07 01:37:37,562 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:37:37,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:37:37,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1078208605, now seen corresponding path program 1 times [2021-12-07 01:37:37,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:37:37,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687586710] [2021-12-07 01:37:37,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:37:37,563 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:37:37,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:37,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:37:37,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:37,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:37:37,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:37,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-07 01:37:37,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:37,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-07 01:37:37,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:37,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:37:37,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:37,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-07 01:37:37,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:37,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-07 01:37:37,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:37,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-07 01:37:37,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:37,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-07 01:37:37,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:37,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-07 01:37:37,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:37,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-07 01:37:37,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:37,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-07 01:37:37,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:37,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-12-07 01:37:37,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:37,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-07 01:37:37,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:37,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-12-07 01:37:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:37,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2021-12-07 01:37:37,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:37,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2021-12-07 01:37:37,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:37,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2021-12-07 01:37:37,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:37,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2021-12-07 01:37:37,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:37,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-07 01:37:37,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:37,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2021-12-07 01:37:37,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:37,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-12-07 01:37:37,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:37,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2021-12-07 01:37:37,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:37,641 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 94 proven. 13 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2021-12-07 01:37:37,641 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:37:37,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687586710] [2021-12-07 01:37:37,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687586710] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:37:37,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034690552] [2021-12-07 01:37:37,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:37:37,642 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:37:37,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:37:37,643 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:37:37,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-07 01:37:37,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:37,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-07 01:37:37,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:37:37,922 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 279 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-12-07 01:37:37,922 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:37:37,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034690552] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:37:37,923 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 01:37:37,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2021-12-07 01:37:37,923 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417936993] [2021-12-07 01:37:37,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:37:37,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 01:37:37,924 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:37:37,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 01:37:37,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:37:37,924 INFO L87 Difference]: Start difference. First operand 6406 states and 7473 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2021-12-07 01:37:38,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:37:38,037 INFO L93 Difference]: Finished difference Result 8806 states and 10273 transitions. [2021-12-07 01:37:38,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 01:37:38,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 252 [2021-12-07 01:37:38,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:37:38,042 INFO L225 Difference]: With dead ends: 8806 [2021-12-07 01:37:38,042 INFO L226 Difference]: Without dead ends: 2546 [2021-12-07 01:37:38,049 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:37:38,049 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 7 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:37:38,050 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 270 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:37:38,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2021-12-07 01:37:38,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2546. [2021-12-07 01:37:38,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2546 states, 2145 states have (on average 1.116083916083916) internal successors, (2394), 2158 states have internal predecessors, (2394), 220 states have call successors, (220), 149 states have call predecessors, (220), 180 states have return successors, (280), 238 states have call predecessors, (280), 218 states have call successors, (280) [2021-12-07 01:37:38,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 2894 transitions. [2021-12-07 01:37:38,158 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 2894 transitions. Word has length 252 [2021-12-07 01:37:38,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:37:38,158 INFO L470 AbstractCegarLoop]: Abstraction has 2546 states and 2894 transitions. [2021-12-07 01:37:38,158 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2021-12-07 01:37:38,158 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 2894 transitions. [2021-12-07 01:37:38,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2021-12-07 01:37:38,161 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:37:38,161 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:37:38,191 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-07 01:37:38,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-12-07 01:37:38,361 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:37:38,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:37:38,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1480841608, now seen corresponding path program 1 times [2021-12-07 01:37:38,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:37:38,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132429140] [2021-12-07 01:37:38,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:37:38,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:37:38,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 01:37:38,375 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 01:37:38,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 01:37:38,454 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 01:37:38,454 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-07 01:37:38,455 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-07 01:37:38,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-07 01:37:38,459 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:37:38,461 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-07 01:37:38,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:37:38 BoogieIcfgContainer [2021-12-07 01:37:38,621 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-07 01:37:38,622 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-07 01:37:38,622 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-07 01:37:38,622 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-07 01:37:38,622 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:37:16" (3/4) ... [2021-12-07 01:37:38,624 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-07 01:37:38,777 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-07 01:37:38,777 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-07 01:37:38,777 INFO L158 Benchmark]: Toolchain (without parser) took 22520.65ms. Allocated memory was 121.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 89.9MB in the beginning and 653.1MB in the end (delta: -563.2MB). Peak memory consumption was 622.2MB. Max. memory is 16.1GB. [2021-12-07 01:37:38,778 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 81.8MB. Free memory was 42.6MB in the beginning and 42.5MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-07 01:37:38,778 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.62ms. Allocated memory is still 121.6MB. Free memory was 89.9MB in the beginning and 96.3MB in the end (delta: -6.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-07 01:37:38,778 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.92ms. Allocated memory is still 121.6MB. Free memory was 96.3MB in the beginning and 94.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-07 01:37:38,778 INFO L158 Benchmark]: Boogie Preprocessor took 30.19ms. Allocated memory is still 121.6MB. Free memory was 94.2MB in the beginning and 92.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-07 01:37:38,779 INFO L158 Benchmark]: RCFGBuilder took 398.61ms. Allocated memory is still 121.6MB. Free memory was 92.8MB in the beginning and 77.4MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-07 01:37:38,779 INFO L158 Benchmark]: TraceAbstraction took 21627.31ms. Allocated memory was 121.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 77.0MB in the beginning and 681.4MB in the end (delta: -604.4MB). Peak memory consumption was 580.9MB. Max. memory is 16.1GB. [2021-12-07 01:37:38,779 INFO L158 Benchmark]: Witness Printer took 155.25ms. Allocated memory is still 1.3GB. Free memory was 681.4MB in the beginning and 653.1MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2021-12-07 01:37:38,781 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 81.8MB. Free memory was 42.6MB in the beginning and 42.5MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 258.62ms. Allocated memory is still 121.6MB. Free memory was 89.9MB in the beginning and 96.3MB in the end (delta: -6.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.92ms. Allocated memory is still 121.6MB. Free memory was 96.3MB in the beginning and 94.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.19ms. Allocated memory is still 121.6MB. Free memory was 94.2MB in the beginning and 92.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 398.61ms. Allocated memory is still 121.6MB. Free memory was 92.8MB in the beginning and 77.4MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 21627.31ms. Allocated memory was 121.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 77.0MB in the beginning and 681.4MB in the end (delta: -604.4MB). Peak memory consumption was 580.9MB. Max. memory is 16.1GB. * Witness Printer took 155.25ms. Allocated memory is still 1.3GB. Free memory was 681.4MB in the beginning and 653.1MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int max_loop ; [L26] int num ; [L27] int i ; [L28] int e ; [L29] int timer ; [L30] char data_0 ; [L31] char data_1 ; [L74] int P_1_pc; [L75] int P_1_st ; [L76] int P_1_i ; [L77] int P_1_ev ; [L132] int C_1_pc ; [L133] int C_1_st ; [L134] int C_1_i ; [L135] int C_1_ev ; [L136] int C_1_pr ; VAL [C_1_ev=0, C_1_i=0, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=0, num=0, P_1_ev=0, P_1_i=0, P_1_pc=0, P_1_st=0, timer=0] [L500] int count ; [L501] int __retres2 ; [L505] num = 0 [L506] i = 0 [L507] max_loop = 2 [L509] timer = 0 [L510] P_1_pc = 0 [L511] C_1_pc = 0 [L513] count = 0 [L514] CALL init_model() [L493] P_1_i = 1 [L494] C_1_i = 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L514] RET init_model() [L515] CALL start_simulation() [L431] int kernel_st ; [L432] int tmp ; [L433] int tmp___0 ; [L437] kernel_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L438] FCALL update_channels() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L439] CALL init_threads() [L236] COND TRUE (int )P_1_i == 1 [L237] P_1_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L241] COND TRUE (int )C_1_i == 1 [L242] C_1_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L439] RET init_threads() [L440] FCALL fire_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L441] CALL activate_threads() VAL [\old(C_1_st)=0, \old(P_1_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [\old(C_1_st)=0, \old(P_1_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L117] COND FALSE !((int )P_1_pc == 1) VAL [\old(C_1_st)=0, \old(P_1_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L127] __retres1 = 0 VAL [\old(C_1_st)=0, \old(P_1_st)=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L129] return (__retres1); VAL [\old(C_1_st)=0, \old(P_1_st)=0, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND FALSE !(\read(tmp)) VAL [\old(C_1_st)=0, \old(P_1_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0, tmp=0] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [\old(C_1_st)=0, \old(P_1_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L199] COND FALSE !((int )C_1_pc == 1) VAL [\old(C_1_st)=0, \old(P_1_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L209] COND FALSE !((int )C_1_pc == 2) VAL [\old(C_1_st)=0, \old(P_1_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L219] __retres1 = 0 VAL [\old(C_1_st)=0, \old(P_1_st)=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L221] return (__retres1); VAL [\old(C_1_st)=0, \old(P_1_st)=0, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [\old(C_1_st)=0, \old(P_1_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0, tmp=0, tmp___1=0] [L441] RET activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L442] FCALL reset_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L445] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L448] kernel_st = 1 [L449] CALL eval() [L272] int tmp ; [L273] int tmp___0 ; [L274] int tmp___1 ; [L275] int tmp___2 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L279] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L251] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [__retres1=1, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L268] return (__retres1); VAL [\result=1, __retres1=1, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, exists_runnable_thread()=1, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0, tmp___2=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND FALSE !(\read(tmp)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0, tmp=0, tmp___2=1] [L304] COND TRUE (int )C_1_st == 0 [L306] tmp___1 = __VERIFIER_nondet_int() [L308] COND TRUE \read(tmp___1) [L310] C_1_st = 1 [L311] CALL C_1() [L138] char c ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L141] COND TRUE (int )C_1_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L156] COND TRUE i < max_loop VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L158] COND TRUE num == 0 [L159] timer = 1 [L160] i += 1 [L161] C_1_pc = 1 [L162] C_1_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L311] RET C_1() [L279] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1, tmp=0, tmp___1=1, tmp___2=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L251] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [__retres1=1, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L268] return (__retres1); VAL [\result=1, __retres1=1, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, exists_runnable_thread()=1, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1, tmp=0, tmp___1=1, tmp___2=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1, tmp=0, tmp___1=1, tmp___2=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND TRUE \read(tmp) [L295] P_1_st = 1 [L296] CALL P_1() [L82] COND TRUE (int )P_1_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, timer=1] [L93] COND TRUE i < max_loop VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, timer=1] [L96] CALL write_data(num, 'A') [L59] COND TRUE i___0 == 0 [L60] data_0 = c VAL [\old(c)=65, \old(i___0)=0, c=65, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, i___0=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, timer=1] [L96] RET write_data(num, 'A') [L97] num += 1 [L98] P_1_pc = 1 [L99] P_1_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L296] RET P_1() [L304] COND FALSE !((int )C_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=-1, tmp___1=1, tmp___2=1] [L279] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=-1, tmp___1=1, tmp___2=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L251] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L254] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 VAL [__retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L268] return (__retres1); VAL [\result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, exists_runnable_thread()=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=-1, tmp___1=1, tmp___2=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND FALSE !(\read(tmp___2)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=-1, tmp___1=1, tmp___2=0] [L449] RET eval() [L452] kernel_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=2, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L453] FCALL update_channels() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=2, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L456] kernel_st = 3 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=3, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L457] FCALL fire_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=3, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L458] CALL activate_threads() VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L118] COND FALSE !((int )P_1_ev == 1) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L127] __retres1 = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L129] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND FALSE !(\read(tmp)) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L200] COND FALSE !((int )e == 1) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L219] __retres1 = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L221] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0, tmp___1=0] [L458] RET activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=3, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L459] FCALL reset_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=3, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L462] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L251] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L254] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 VAL [__retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L268] return (__retres1); VAL [\result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L462] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, exists_runnable_thread()=0, i=1, kernel_st=3, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L462] tmp = exists_runnable_thread() [L464] COND TRUE tmp == 0 [L466] kernel_st = 4 [L467] CALL fire_time_events() [L346] C_1_ev = 1 [L348] P_1_ev = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L467] RET fire_time_events() [L468] CALL activate_threads() VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L118] COND TRUE (int )P_1_ev == 1 [L119] __retres1 = 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L129] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \result=1, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND TRUE \read(tmp) [L384] P_1_st = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=1] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L200] COND FALSE !((int )e == 1) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L219] __retres1 = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L221] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \result=0, __retres1=0, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=1, tmp___1=0] [L468] RET activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=4, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=0] [L469] CALL reset_time_events() [L360] COND TRUE (int )P_1_ev == 1 [L361] P_1_ev = 2 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L365] COND TRUE (int )C_1_ev == 1 [L366] C_1_ev = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L469] RET reset_time_events() [L475] CALL, EXPR stop_simulation() [L412] int tmp ; [L413] int __retres2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L417] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [__retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L268] return (__retres1); VAL [\result=1, __retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L417] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, exists_runnable_thread()=1, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L417] tmp = exists_runnable_thread() [L419] COND TRUE \read(tmp) [L420] __retres2 = 0 VAL [__retres2=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=1] [L427] return (__retres2); VAL [\result=0, __retres2=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=1] [L475] RET, EXPR stop_simulation() [L475] tmp___0 = stop_simulation() [L477] COND FALSE !(\read(tmp___0)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=4, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=0, tmp___0=0] [L445] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=4, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=0, tmp___0=0] [L448] kernel_st = 1 [L449] CALL eval() [L272] int tmp ; [L273] int tmp___0 ; [L274] int tmp___1 ; [L275] int tmp___2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L279] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [__retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L268] return (__retres1); VAL [\result=1, __retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, exists_runnable_thread()=1, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp___2=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND TRUE \read(tmp) [L295] P_1_st = 1 [L296] CALL P_1() [L82] COND FALSE !((int )P_1_pc == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L85] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L93] COND TRUE i < max_loop VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L96] CALL write_data(num, 'A') [L59] COND FALSE !(i___0 == 0) VAL [\old(c)=65, \old(i___0)=1, c=65, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, i___0=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L62] COND TRUE i___0 == 1 [L63] data_1 = c VAL [\old(c)=65, \old(i___0)=1, c=65, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, i___0=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L96] RET write_data(num, 'A') [L97] num += 1 [L98] P_1_pc = 1 [L99] P_1_st = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L296] RET P_1() [L304] COND FALSE !((int )C_1_st == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=-2, tmp___2=1] [L279] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=-2, tmp___2=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L254] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 VAL [__retres1=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L268] return (__retres1); VAL [\result=0, __retres1=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, exists_runnable_thread()=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=-2, tmp___2=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND FALSE !(\read(tmp___2)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=-2, tmp___2=0] [L449] RET eval() [L452] kernel_st = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=2, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0, tmp___0=0] [L453] FCALL update_channels() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=2, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0, tmp___0=0] [L456] kernel_st = 3 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=3, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0, tmp___0=0] [L457] FCALL fire_delta_events() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=3, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0, tmp___0=0] [L458] CALL activate_threads() VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L118] COND FALSE !((int )P_1_ev == 1) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L127] __retres1 = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L129] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \result=0, __retres1=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND FALSE !(\read(tmp)) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L200] COND FALSE !((int )e == 1) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L219] __retres1 = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L221] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \result=0, __retres1=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0, tmp___1=0] [L458] RET activate_threads() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=3, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0, tmp___0=0] [L459] FCALL reset_delta_events() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=3, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0, tmp___0=0] [L462] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L254] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 VAL [__retres1=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L268] return (__retres1); VAL [\result=0, __retres1=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L462] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, exists_runnable_thread()=0, i=1, kernel_st=3, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0, tmp___0=0] [L462] tmp = exists_runnable_thread() [L464] COND TRUE tmp == 0 [L466] kernel_st = 4 [L467] CALL fire_time_events() [L346] C_1_ev = 1 [L348] P_1_ev = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L467] RET fire_time_events() [L468] CALL activate_threads() VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L118] COND TRUE (int )P_1_ev == 1 [L119] __retres1 = 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L129] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \result=1, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND TRUE \read(tmp) [L384] P_1_st = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=1] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L200] COND FALSE !((int )e == 1) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L219] __retres1 = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L221] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \result=0, __retres1=0, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=1, tmp___1=0] [L468] RET activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=4, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=0, tmp___0=0] [L469] CALL reset_time_events() [L360] COND TRUE (int )P_1_ev == 1 [L361] P_1_ev = 2 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L365] COND TRUE (int )C_1_ev == 1 [L366] C_1_ev = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L469] RET reset_time_events() [L475] CALL, EXPR stop_simulation() [L412] int tmp ; [L413] int __retres2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L417] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [__retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L268] return (__retres1); VAL [\result=1, __retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L417] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, exists_runnable_thread()=1, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L417] tmp = exists_runnable_thread() [L419] COND TRUE \read(tmp) [L420] __retres2 = 0 VAL [__retres2=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=1] [L427] return (__retres2); VAL [\result=0, __retres2=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=1] [L475] RET, EXPR stop_simulation() [L475] tmp___0 = stop_simulation() [L477] COND FALSE !(\read(tmp___0)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=4, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=0, tmp___0=0] [L445] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=4, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=0, tmp___0=0] [L448] kernel_st = 1 [L449] CALL eval() [L272] int tmp ; [L273] int tmp___0 ; [L274] int tmp___1 ; [L275] int tmp___2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L279] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [__retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L268] return (__retres1); VAL [\result=1, __retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, exists_runnable_thread()=1, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp___2=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND TRUE \read(tmp) [L295] P_1_st = 1 [L296] CALL P_1() [L82] COND FALSE !((int )P_1_pc == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L85] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L93] COND TRUE i < max_loop VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L96] CALL write_data(num, 'A') [L59] COND FALSE !(i___0 == 0) VAL [\old(c)=65, \old(i___0)=2, c=65, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, i___0=2, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L62] COND FALSE !(i___0 == 1) VAL [\old(c)=65, \old(i___0)=2, c=65, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, i___0=2, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L66] CALL error() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L19] reach_error() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 108 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.4s, OverallIterations: 26, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5227 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5075 mSDsluCounter, 12883 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7783 mSDsCounter, 798 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2594 IncrementalHoareTripleChecker+Invalid, 3392 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 798 mSolverCounterUnsat, 5100 mSDtfsCounter, 2594 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2880 GetRequests, 2719 SyntacticMatches, 4 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8718occurred in iteration=15, InterpolantAutomatonStates: 155, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.0s AutomataMinimizationTime, 25 MinimizatonAttempts, 7837 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 5201 NumberOfCodeBlocks, 5201 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 5059 ConstructedInterpolants, 0 QuantifiedInterpolants, 9315 SizeOfPredicates, 3 NumberOfNonLiveVariables, 5501 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 38 InterpolantComputations, 24 PerfectInterpolantSequences, 4284/4568 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-07 01:37:38,824 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06f8449c-4d6c-47b0-841a-a1404799d647/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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