./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/kundu2.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/kundu2.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8 --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 87760fc84dfa44e1b5109b35af0fae7e5f68f814afbb1ba90e7b46e4e9e3b4bf --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 17:05:46,786 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 17:05:46,788 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 17:05:46,799 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 17:05:46,799 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 17:05:46,800 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 17:05:46,801 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 17:05:46,802 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 17:05:46,803 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 17:05:46,803 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 17:05:46,804 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 17:05:46,805 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 17:05:46,805 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 17:05:46,806 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 17:05:46,806 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 17:05:46,807 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 17:05:46,808 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 17:05:46,809 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 17:05:46,809 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 17:05:46,811 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 17:05:46,812 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 17:05:46,813 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 17:05:46,813 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 17:05:46,814 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 17:05:46,816 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 17:05:46,817 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 17:05:46,817 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 17:05:46,817 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 17:05:46,818 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 17:05:46,818 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 17:05:46,819 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 17:05:46,819 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 17:05:46,820 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 17:05:46,820 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 17:05:46,821 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 17:05:46,821 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 17:05:46,822 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 17:05:46,822 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 17:05:46,823 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 17:05:46,823 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 17:05:46,824 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 17:05:46,824 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 17:05:46,839 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 17:05:46,839 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 17:05:46,839 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 17:05:46,839 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 17:05:46,840 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 17:05:46,840 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 17:05:46,841 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 17:05:46,841 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 17:05:46,841 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 17:05:46,841 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 17:05:46,841 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 17:05:46,841 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 17:05:46,842 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 17:05:46,842 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 17:05:46,842 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 17:05:46,842 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 17:05:46,842 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 17:05:46,842 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 17:05:46,842 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 17:05:46,843 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 17:05:46,843 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 17:05:46,843 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 17:05:46,843 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 17:05:46,843 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 17:05:46,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 17:05:46,844 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 17:05:46,844 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 17:05:46,844 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 17:05:46,844 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 17:05:46,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 17:05:46,844 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 17:05:46,844 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 17:05:46,845 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 17:05:46,845 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 17:05:46,845 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 17:05:46,845 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/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_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8 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 -> 87760fc84dfa44e1b5109b35af0fae7e5f68f814afbb1ba90e7b46e4e9e3b4bf [2022-12-13 17:05:47,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 17:05:47,045 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 17:05:47,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 17:05:47,049 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 17:05:47,049 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 17:05:47,050 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/systemc/kundu2.cil.c [2022-12-13 17:05:49,762 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 17:05:49,907 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 17:05:49,908 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/sv-benchmarks/c/systemc/kundu2.cil.c [2022-12-13 17:05:49,917 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/data/8997e2da5/ceb485e5116b435a87cbaa1f757787ea/FLAGab47f8c3f [2022-12-13 17:05:49,929 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/data/8997e2da5/ceb485e5116b435a87cbaa1f757787ea [2022-12-13 17:05:49,932 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 17:05:49,933 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 17:05:49,934 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 17:05:49,935 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 17:05:49,938 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 17:05:49,938 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:05:49" (1/1) ... [2022-12-13 17:05:49,939 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@209c104c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:05:49, skipping insertion in model container [2022-12-13 17:05:49,939 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:05:49" (1/1) ... [2022-12-13 17:05:49,945 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 17:05:49,964 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 17:05:50,060 WARN L237 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_327387b8-981f-4fca-88f6-2179b10cfc03/sv-benchmarks/c/systemc/kundu2.cil.c[636,649] [2022-12-13 17:05:50,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 17:05:50,121 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 17:05:50,131 WARN L237 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_327387b8-981f-4fca-88f6-2179b10cfc03/sv-benchmarks/c/systemc/kundu2.cil.c[636,649] [2022-12-13 17:05:50,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 17:05:50,168 INFO L208 MainTranslator]: Completed translation [2022-12-13 17:05:50,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:05:50 WrapperNode [2022-12-13 17:05:50,169 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 17:05:50,170 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 17:05:50,170 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 17:05:50,170 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 17:05:50,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:05:50" (1/1) ... [2022-12-13 17:05:50,183 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:05:50" (1/1) ... [2022-12-13 17:05:50,210 INFO L138 Inliner]: procedures = 34, calls = 40, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 310 [2022-12-13 17:05:50,211 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 17:05:50,211 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 17:05:50,212 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 17:05:50,212 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 17:05:50,220 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:05:50" (1/1) ... [2022-12-13 17:05:50,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:05:50" (1/1) ... [2022-12-13 17:05:50,221 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:05:50" (1/1) ... [2022-12-13 17:05:50,222 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:05:50" (1/1) ... [2022-12-13 17:05:50,225 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:05:50" (1/1) ... [2022-12-13 17:05:50,229 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:05:50" (1/1) ... [2022-12-13 17:05:50,231 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:05:50" (1/1) ... [2022-12-13 17:05:50,232 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:05:50" (1/1) ... [2022-12-13 17:05:50,234 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 17:05:50,234 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 17:05:50,234 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 17:05:50,234 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 17:05:50,235 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:05:50" (1/1) ... [2022-12-13 17:05:50,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 17:05:50,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:05:50,262 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 17:05:50,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 17:05:50,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 17:05:50,289 INFO L130 BoogieDeclarations]: Found specification of procedure write_data [2022-12-13 17:05:50,289 INFO L138 BoogieDeclarations]: Found implementation of procedure write_data [2022-12-13 17:05:50,289 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-12-13 17:05:50,290 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-12-13 17:05:50,290 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-12-13 17:05:50,290 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-12-13 17:05:50,290 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-12-13 17:05:50,290 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-12-13 17:05:50,290 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-12-13 17:05:50,290 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-12-13 17:05:50,290 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-12-13 17:05:50,290 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-12-13 17:05:50,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 17:05:50,291 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-12-13 17:05:50,291 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-12-13 17:05:50,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 17:05:50,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 17:05:50,360 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 17:05:50,362 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 17:05:50,646 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 17:05:50,655 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 17:05:50,655 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-12-13 17:05:50,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:05:50 BoogieIcfgContainer [2022-12-13 17:05:50,657 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 17:05:50,659 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 17:05:50,660 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 17:05:50,662 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 17:05:50,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 05:05:49" (1/3) ... [2022-12-13 17:05:50,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31356930 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:05:50, skipping insertion in model container [2022-12-13 17:05:50,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:05:50" (2/3) ... [2022-12-13 17:05:50,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31356930 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:05:50, skipping insertion in model container [2022-12-13 17:05:50,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:05:50" (3/3) ... [2022-12-13 17:05:50,664 INFO L112 eAbstractionObserver]: Analyzing ICFG kundu2.cil.c [2022-12-13 17:05:50,677 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 17:05:50,677 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 17:05:50,722 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 17:05:50,728 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@43f0e00f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 17:05:50,728 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 17:05:50,731 INFO L276 IsEmpty]: Start isEmpty. Operand has 134 states, 107 states have (on average 1.514018691588785) internal successors, (162), 111 states have internal predecessors, (162), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-12-13 17:05:50,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-13 17:05:50,740 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:05:50,740 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:05:50,740 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:05:50,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:05:50,745 INFO L85 PathProgramCache]: Analyzing trace with hash 734266899, now seen corresponding path program 1 times [2022-12-13 17:05:50,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:05:50,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816154005] [2022-12-13 17:05:50,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:05:50,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:05:50,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:50,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:05:50,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:50,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:05:50,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:50,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 17:05:50,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:50,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 17:05:50,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:50,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 17:05:50,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:50,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:05:50,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:05:50,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816154005] [2022-12-13 17:05:50,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816154005] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:05:50,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:05:50,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:05:50,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19111728] [2022-12-13 17:05:50,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:05:50,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 17:05:50,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:05:51,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 17:05:51,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:05:51,014 INFO L87 Difference]: Start difference. First operand has 134 states, 107 states have (on average 1.514018691588785) internal successors, (162), 111 states have internal predecessors, (162), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:05:51,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:05:51,197 INFO L93 Difference]: Finished difference Result 277 states and 417 transitions. [2022-12-13 17:05:51,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 17:05:51,200 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2022-12-13 17:05:51,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:05:51,210 INFO L225 Difference]: With dead ends: 277 [2022-12-13 17:05:51,211 INFO L226 Difference]: Without dead ends: 145 [2022-12-13 17:05:51,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:05:51,218 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 219 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:05:51,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 294 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:05:51,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-12-13 17:05:51,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 127. [2022-12-13 17:05:51,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 102 states have (on average 1.4411764705882353) internal successors, (147), 105 states have internal predecessors, (147), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-12-13 17:05:51,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 180 transitions. [2022-12-13 17:05:51,278 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 180 transitions. Word has length 59 [2022-12-13 17:05:51,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:05:51,279 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 180 transitions. [2022-12-13 17:05:51,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:05:51,279 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 180 transitions. [2022-12-13 17:05:51,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-13 17:05:51,282 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:05:51,282 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:05:51,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 17:05:51,282 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:05:51,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:05:51,283 INFO L85 PathProgramCache]: Analyzing trace with hash -804073131, now seen corresponding path program 1 times [2022-12-13 17:05:51,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:05:51,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206781592] [2022-12-13 17:05:51,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:05:51,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:05:51,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:51,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:05:51,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:51,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:05:51,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:51,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 17:05:51,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:51,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 17:05:51,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:51,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 17:05:51,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:51,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:05:51,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:05:51,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206781592] [2022-12-13 17:05:51,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206781592] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:05:51,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:05:51,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 17:05:51,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728935883] [2022-12-13 17:05:51,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:05:51,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:05:51,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:05:51,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:05:51,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:05:51,435 INFO L87 Difference]: Start difference. First operand 127 states and 180 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:05:51,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:05:51,717 INFO L93 Difference]: Finished difference Result 392 states and 563 transitions. [2022-12-13 17:05:51,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 17:05:51,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2022-12-13 17:05:51,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:05:51,720 INFO L225 Difference]: With dead ends: 392 [2022-12-13 17:05:51,720 INFO L226 Difference]: Without dead ends: 276 [2022-12-13 17:05:51,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:05:51,722 INFO L413 NwaCegarLoop]: 345 mSDtfsCounter, 385 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 17:05:51,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 806 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 17:05:51,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2022-12-13 17:05:51,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 234. [2022-12-13 17:05:51,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 192 states have (on average 1.4322916666666667) internal successors, (275), 196 states have internal predecessors, (275), 29 states have call successors, (29), 13 states have call predecessors, (29), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-12-13 17:05:51,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 330 transitions. [2022-12-13 17:05:51,744 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 330 transitions. Word has length 59 [2022-12-13 17:05:51,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:05:51,745 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 330 transitions. [2022-12-13 17:05:51,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:05:51,745 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 330 transitions. [2022-12-13 17:05:51,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-13 17:05:51,746 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:05:51,746 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:05:51,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 17:05:51,746 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:05:51,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:05:51,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1094457174, now seen corresponding path program 1 times [2022-12-13 17:05:51,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:05:51,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995690241] [2022-12-13 17:05:51,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:05:51,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:05:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:51,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:05:51,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:51,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:05:51,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:51,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 17:05:51,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:51,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 17:05:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:51,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 17:05:51,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:51,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:05:51,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:05:51,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995690241] [2022-12-13 17:05:51,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995690241] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:05:51,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:05:51,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 17:05:51,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793291580] [2022-12-13 17:05:51,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:05:51,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 17:05:51,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:05:51,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 17:05:51,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:05:51,882 INFO L87 Difference]: Start difference. First operand 234 states and 330 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:05:52,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:05:52,104 INFO L93 Difference]: Finished difference Result 529 states and 766 transitions. [2022-12-13 17:05:52,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 17:05:52,105 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2022-12-13 17:05:52,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:05:52,109 INFO L225 Difference]: With dead ends: 529 [2022-12-13 17:05:52,109 INFO L226 Difference]: Without dead ends: 306 [2022-12-13 17:05:52,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-12-13 17:05:52,112 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 184 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:05:52,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 843 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:05:52,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-12-13 17:05:52,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 237. [2022-12-13 17:05:52,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 195 states have (on average 1.4205128205128206) internal successors, (277), 199 states have internal predecessors, (277), 29 states have call successors, (29), 13 states have call predecessors, (29), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-12-13 17:05:52,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 332 transitions. [2022-12-13 17:05:52,149 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 332 transitions. Word has length 59 [2022-12-13 17:05:52,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:05:52,149 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 332 transitions. [2022-12-13 17:05:52,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:05:52,150 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 332 transitions. [2022-12-13 17:05:52,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-13 17:05:52,152 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:05:52,153 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:05:52,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 17:05:52,153 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:05:52,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:05:52,154 INFO L85 PathProgramCache]: Analyzing trace with hash -750909992, now seen corresponding path program 1 times [2022-12-13 17:05:52,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:05:52,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066404491] [2022-12-13 17:05:52,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:05:52,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:05:52,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:52,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:05:52,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:52,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:05:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:52,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 17:05:52,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:52,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 17:05:52,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:52,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 17:05:52,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:52,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:05:52,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:05:52,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066404491] [2022-12-13 17:05:52,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066404491] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:05:52,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:05:52,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 17:05:52,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155687111] [2022-12-13 17:05:52,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:05:52,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 17:05:52,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:05:52,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 17:05:52,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:05:52,281 INFO L87 Difference]: Start difference. First operand 237 states and 332 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:05:52,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:05:52,509 INFO L93 Difference]: Finished difference Result 549 states and 797 transitions. [2022-12-13 17:05:52,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 17:05:52,510 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2022-12-13 17:05:52,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:05:52,512 INFO L225 Difference]: With dead ends: 549 [2022-12-13 17:05:52,513 INFO L226 Difference]: Without dead ends: 323 [2022-12-13 17:05:52,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-12-13 17:05:52,515 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 197 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:05:52,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 749 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:05:52,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-12-13 17:05:52,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 243. [2022-12-13 17:05:52,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 201 states have (on average 1.407960199004975) internal successors, (283), 205 states have internal predecessors, (283), 29 states have call successors, (29), 13 states have call predecessors, (29), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-12-13 17:05:52,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 338 transitions. [2022-12-13 17:05:52,546 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 338 transitions. Word has length 59 [2022-12-13 17:05:52,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:05:52,547 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 338 transitions. [2022-12-13 17:05:52,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:05:52,547 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 338 transitions. [2022-12-13 17:05:52,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-13 17:05:52,548 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:05:52,548 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:05:52,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 17:05:52,549 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:05:52,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:05:52,549 INFO L85 PathProgramCache]: Analyzing trace with hash -823296550, now seen corresponding path program 1 times [2022-12-13 17:05:52,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:05:52,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90876020] [2022-12-13 17:05:52,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:05:52,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:05:52,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:52,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:05:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:52,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:05:52,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:52,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 17:05:52,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:52,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 17:05:52,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:52,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 17:05:52,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:52,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:05:52,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:05:52,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90876020] [2022-12-13 17:05:52,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90876020] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:05:52,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:05:52,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 17:05:52,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468371407] [2022-12-13 17:05:52,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:05:52,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 17:05:52,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:05:52,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 17:05:52,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:05:52,672 INFO L87 Difference]: Start difference. First operand 243 states and 338 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:05:53,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:05:53,197 INFO L93 Difference]: Finished difference Result 1005 states and 1437 transitions. [2022-12-13 17:05:53,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 17:05:53,198 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2022-12-13 17:05:53,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:05:53,203 INFO L225 Difference]: With dead ends: 1005 [2022-12-13 17:05:53,203 INFO L226 Difference]: Without dead ends: 773 [2022-12-13 17:05:53,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-12-13 17:05:53,205 INFO L413 NwaCegarLoop]: 326 mSDtfsCounter, 757 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 17:05:53,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 986 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 17:05:53,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2022-12-13 17:05:53,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 455. [2022-12-13 17:05:53,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 379 states have (on average 1.3984168865435356) internal successors, (530), 385 states have internal predecessors, (530), 51 states have call successors, (51), 25 states have call predecessors, (51), 24 states have return successors, (51), 45 states have call predecessors, (51), 48 states have call successors, (51) [2022-12-13 17:05:53,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 632 transitions. [2022-12-13 17:05:53,269 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 632 transitions. Word has length 59 [2022-12-13 17:05:53,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:05:53,270 INFO L495 AbstractCegarLoop]: Abstraction has 455 states and 632 transitions. [2022-12-13 17:05:53,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:05:53,270 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 632 transitions. [2022-12-13 17:05:53,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-13 17:05:53,271 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:05:53,271 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:05:53,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 17:05:53,271 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:05:53,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:05:53,272 INFO L85 PathProgramCache]: Analyzing trace with hash 225843183, now seen corresponding path program 1 times [2022-12-13 17:05:53,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:05:53,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977451440] [2022-12-13 17:05:53,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:05:53,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:05:53,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:53,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:05:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:53,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:05:53,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:53,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 17:05:53,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:53,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:05:53,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:53,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 17:05:53,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:53,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:05:53,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:05:53,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977451440] [2022-12-13 17:05:53,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977451440] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:05:53,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:05:53,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 17:05:53,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793391291] [2022-12-13 17:05:53,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:05:53,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 17:05:53,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:05:53,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 17:05:53,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:05:53,372 INFO L87 Difference]: Start difference. First operand 455 states and 632 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:05:53,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:05:53,599 INFO L93 Difference]: Finished difference Result 1000 states and 1442 transitions. [2022-12-13 17:05:53,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 17:05:53,600 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 60 [2022-12-13 17:05:53,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:05:53,604 INFO L225 Difference]: With dead ends: 1000 [2022-12-13 17:05:53,604 INFO L226 Difference]: Without dead ends: 556 [2022-12-13 17:05:53,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-12-13 17:05:53,606 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 76 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:05:53,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 733 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:05:53,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2022-12-13 17:05:53,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 467. [2022-12-13 17:05:53,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 391 states have (on average 1.3861892583120206) internal successors, (542), 397 states have internal predecessors, (542), 51 states have call successors, (51), 25 states have call predecessors, (51), 24 states have return successors, (51), 45 states have call predecessors, (51), 48 states have call successors, (51) [2022-12-13 17:05:53,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 644 transitions. [2022-12-13 17:05:53,646 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 644 transitions. Word has length 60 [2022-12-13 17:05:53,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:05:53,647 INFO L495 AbstractCegarLoop]: Abstraction has 467 states and 644 transitions. [2022-12-13 17:05:53,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:05:53,647 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 644 transitions. [2022-12-13 17:05:53,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-13 17:05:53,647 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:05:53,648 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:05:53,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 17:05:53,648 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:05:53,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:05:53,648 INFO L85 PathProgramCache]: Analyzing trace with hash -2145896079, now seen corresponding path program 1 times [2022-12-13 17:05:53,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:05:53,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434305417] [2022-12-13 17:05:53,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:05:53,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:05:53,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:53,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:05:53,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:53,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:05:53,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:53,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 17:05:53,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:53,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:05:53,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:53,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 17:05:53,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:53,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:05:53,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:05:53,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434305417] [2022-12-13 17:05:53,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434305417] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:05:53,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:05:53,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 17:05:53,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157595180] [2022-12-13 17:05:53,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:05:53,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 17:05:53,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:05:53,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 17:05:53,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:05:53,707 INFO L87 Difference]: Start difference. First operand 467 states and 644 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-12-13 17:05:53,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:05:53,978 INFO L93 Difference]: Finished difference Result 1472 states and 2042 transitions. [2022-12-13 17:05:53,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 17:05:53,978 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2022-12-13 17:05:53,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:05:53,986 INFO L225 Difference]: With dead ends: 1472 [2022-12-13 17:05:53,986 INFO L226 Difference]: Without dead ends: 1017 [2022-12-13 17:05:53,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-12-13 17:05:53,989 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 250 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:05:53,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 788 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:05:53,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2022-12-13 17:05:54,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 871. [2022-12-13 17:05:54,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 731 states have (on average 1.377564979480164) internal successors, (1007), 745 states have internal predecessors, (1007), 91 states have call successors, (91), 49 states have call predecessors, (91), 48 states have return successors, (93), 77 states have call predecessors, (93), 88 states have call successors, (93) [2022-12-13 17:05:54,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1191 transitions. [2022-12-13 17:05:54,070 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1191 transitions. Word has length 60 [2022-12-13 17:05:54,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:05:54,070 INFO L495 AbstractCegarLoop]: Abstraction has 871 states and 1191 transitions. [2022-12-13 17:05:54,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-12-13 17:05:54,071 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1191 transitions. [2022-12-13 17:05:54,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-12-13 17:05:54,072 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:05:54,072 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 17:05:54,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 17:05:54,072 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:05:54,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:05:54,073 INFO L85 PathProgramCache]: Analyzing trace with hash 370475399, now seen corresponding path program 1 times [2022-12-13 17:05:54,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:05:54,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743929443] [2022-12-13 17:05:54,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:05:54,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:05:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:54,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:05:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:54,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:05:54,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:54,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 17:05:54,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:54,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:05:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:54,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 17:05:54,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:54,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 17:05:54,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:54,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:05:54,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:05:54,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743929443] [2022-12-13 17:05:54,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743929443] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:05:54,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965770971] [2022-12-13 17:05:54,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:05:54,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:05:54,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:05:54,181 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:05:54,182 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 17:05:54,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:54,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 17:05:54,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:05:54,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:05:54,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:05:54,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:05:54,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965770971] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 17:05:54,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:05:54,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 6] total 8 [2022-12-13 17:05:54,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072728557] [2022-12-13 17:05:54,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:05:54,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 17:05:54,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:05:54,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 17:05:54,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:05:54,473 INFO L87 Difference]: Start difference. First operand 871 states and 1191 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-12-13 17:05:54,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:05:54,766 INFO L93 Difference]: Finished difference Result 2417 states and 3325 transitions. [2022-12-13 17:05:54,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 17:05:54,766 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 71 [2022-12-13 17:05:54,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:05:54,772 INFO L225 Difference]: With dead ends: 2417 [2022-12-13 17:05:54,772 INFO L226 Difference]: Without dead ends: 1656 [2022-12-13 17:05:54,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 149 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-12-13 17:05:54,774 INFO L413 NwaCegarLoop]: 332 mSDtfsCounter, 289 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:05:54,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 1326 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:05:54,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2022-12-13 17:05:54,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1627. [2022-12-13 17:05:54,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1627 states, 1371 states have (on average 1.37490882567469) internal successors, (1885), 1394 states have internal predecessors, (1885), 165 states have call successors, (165), 91 states have call predecessors, (165), 90 states have return successors, (172), 142 states have call predecessors, (172), 162 states have call successors, (172) [2022-12-13 17:05:54,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1627 states to 1627 states and 2222 transitions. [2022-12-13 17:05:54,903 INFO L78 Accepts]: Start accepts. Automaton has 1627 states and 2222 transitions. Word has length 71 [2022-12-13 17:05:54,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:05:54,903 INFO L495 AbstractCegarLoop]: Abstraction has 1627 states and 2222 transitions. [2022-12-13 17:05:54,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-12-13 17:05:54,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1627 states and 2222 transitions. [2022-12-13 17:05:54,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-13 17:05:54,904 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:05:54,904 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:05:54,911 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 17:05:55,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:05:55,105 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:05:55,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:05:55,105 INFO L85 PathProgramCache]: Analyzing trace with hash -153594449, now seen corresponding path program 1 times [2022-12-13 17:05:55,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:05:55,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016053949] [2022-12-13 17:05:55,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:05:55,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:05:55,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:55,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:05:55,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:55,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:05:55,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:55,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 17:05:55,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:55,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:05:55,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:55,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 17:05:55,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:55,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 17:05:55,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:55,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:05:55,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:05:55,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016053949] [2022-12-13 17:05:55,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016053949] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:05:55,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:05:55,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 17:05:55,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678122674] [2022-12-13 17:05:55,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:05:55,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 17:05:55,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:05:55,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 17:05:55,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:05:55,194 INFO L87 Difference]: Start difference. First operand 1627 states and 2222 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-13 17:05:55,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:05:55,896 INFO L93 Difference]: Finished difference Result 5161 states and 7145 transitions. [2022-12-13 17:05:55,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 17:05:55,896 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 3 states have call successors, (7), 4 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 73 [2022-12-13 17:05:55,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:05:55,907 INFO L225 Difference]: With dead ends: 5161 [2022-12-13 17:05:55,907 INFO L226 Difference]: Without dead ends: 3546 [2022-12-13 17:05:55,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-12-13 17:05:55,911 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 379 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 17:05:55,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 675 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 17:05:55,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3546 states. [2022-12-13 17:05:56,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3546 to 3226. [2022-12-13 17:05:56,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3226 states, 2749 states have (on average 1.353946889778101) internal successors, (3722), 2790 states have internal predecessors, (3722), 292 states have call successors, (292), 170 states have call predecessors, (292), 184 states have return successors, (401), 267 states have call predecessors, (401), 289 states have call successors, (401) [2022-12-13 17:05:56,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3226 states to 3226 states and 4415 transitions. [2022-12-13 17:05:56,199 INFO L78 Accepts]: Start accepts. Automaton has 3226 states and 4415 transitions. Word has length 73 [2022-12-13 17:05:56,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:05:56,199 INFO L495 AbstractCegarLoop]: Abstraction has 3226 states and 4415 transitions. [2022-12-13 17:05:56,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-13 17:05:56,199 INFO L276 IsEmpty]: Start isEmpty. Operand 3226 states and 4415 transitions. [2022-12-13 17:05:56,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-13 17:05:56,200 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:05:56,200 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:05:56,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 17:05:56,200 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:05:56,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:05:56,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1839774287, now seen corresponding path program 1 times [2022-12-13 17:05:56,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:05:56,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739414078] [2022-12-13 17:05:56,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:05:56,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:05:56,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:56,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:05:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:56,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:05:56,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:56,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 17:05:56,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:56,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:05:56,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:56,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 17:05:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:56,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 17:05:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:56,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:05:56,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:05:56,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739414078] [2022-12-13 17:05:56,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739414078] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:05:56,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:05:56,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 17:05:56,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417100277] [2022-12-13 17:05:56,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:05:56,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:05:56,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:05:56,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:05:56,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:05:56,242 INFO L87 Difference]: Start difference. First operand 3226 states and 4415 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-13 17:05:56,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:05:56,760 INFO L93 Difference]: Finished difference Result 6801 states and 9339 transitions. [2022-12-13 17:05:56,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 17:05:56,761 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2022-12-13 17:05:56,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:05:56,777 INFO L225 Difference]: With dead ends: 6801 [2022-12-13 17:05:56,777 INFO L226 Difference]: Without dead ends: 3586 [2022-12-13 17:05:56,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:05:56,787 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 304 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 17:05:56,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 284 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 17:05:56,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3586 states. [2022-12-13 17:05:57,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3586 to 3221. [2022-12-13 17:05:57,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3221 states, 2747 states have (on average 1.3534765198398253) internal successors, (3718), 2787 states have internal predecessors, (3718), 289 states have call successors, (289), 170 states have call predecessors, (289), 184 states have return successors, (397), 264 states have call predecessors, (397), 286 states have call successors, (397) [2022-12-13 17:05:57,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3221 states to 3221 states and 4404 transitions. [2022-12-13 17:05:57,097 INFO L78 Accepts]: Start accepts. Automaton has 3221 states and 4404 transitions. Word has length 73 [2022-12-13 17:05:57,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:05:57,098 INFO L495 AbstractCegarLoop]: Abstraction has 3221 states and 4404 transitions. [2022-12-13 17:05:57,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-13 17:05:57,098 INFO L276 IsEmpty]: Start isEmpty. Operand 3221 states and 4404 transitions. [2022-12-13 17:05:57,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-12-13 17:05:57,099 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:05:57,099 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:05:57,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 17:05:57,099 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:05:57,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:05:57,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1321482580, now seen corresponding path program 1 times [2022-12-13 17:05:57,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:05:57,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962169458] [2022-12-13 17:05:57,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:05:57,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:05:57,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:57,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:05:57,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:57,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:05:57,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:57,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 17:05:57,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:57,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:05:57,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:57,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 17:05:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:57,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 17:05:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:57,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:05:57,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:05:57,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962169458] [2022-12-13 17:05:57,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962169458] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:05:57,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:05:57,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 17:05:57,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752536148] [2022-12-13 17:05:57,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:05:57,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:05:57,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:05:57,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:05:57,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:05:57,150 INFO L87 Difference]: Start difference. First operand 3221 states and 4404 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-12-13 17:05:57,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:05:57,920 INFO L93 Difference]: Finished difference Result 9335 states and 12874 transitions. [2022-12-13 17:05:57,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 17:05:57,921 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 74 [2022-12-13 17:05:57,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:05:57,937 INFO L225 Difference]: With dead ends: 9335 [2022-12-13 17:05:57,937 INFO L226 Difference]: Without dead ends: 6125 [2022-12-13 17:05:57,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-13 17:05:57,946 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 375 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 17:05:57,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 448 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 17:05:57,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6125 states. [2022-12-13 17:05:58,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6125 to 5069. [2022-12-13 17:05:58,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5069 states, 4286 states have (on average 1.3201119925338312) internal successors, (5658), 4350 states have internal predecessors, (5658), 475 states have call successors, (475), 283 states have call predecessors, (475), 307 states have return successors, (665), 436 states have call predecessors, (665), 472 states have call successors, (665) [2022-12-13 17:05:58,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5069 states to 5069 states and 6798 transitions. [2022-12-13 17:05:58,455 INFO L78 Accepts]: Start accepts. Automaton has 5069 states and 6798 transitions. Word has length 74 [2022-12-13 17:05:58,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:05:58,455 INFO L495 AbstractCegarLoop]: Abstraction has 5069 states and 6798 transitions. [2022-12-13 17:05:58,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-12-13 17:05:58,456 INFO L276 IsEmpty]: Start isEmpty. Operand 5069 states and 6798 transitions. [2022-12-13 17:05:58,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-13 17:05:58,456 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:05:58,457 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:05:58,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 17:05:58,457 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:05:58,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:05:58,457 INFO L85 PathProgramCache]: Analyzing trace with hash -728024876, now seen corresponding path program 1 times [2022-12-13 17:05:58,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:05:58,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652754442] [2022-12-13 17:05:58,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:05:58,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:05:58,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:58,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:05:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:58,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:05:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:58,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 17:05:58,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:58,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:05:58,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:58,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 17:05:58,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:58,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 17:05:58,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:58,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:05:58,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:05:58,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652754442] [2022-12-13 17:05:58,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652754442] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:05:58,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:05:58,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 17:05:58,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252359098] [2022-12-13 17:05:58,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:05:58,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 17:05:58,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:05:58,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 17:05:58,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:05:58,548 INFO L87 Difference]: Start difference. First operand 5069 states and 6798 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-12-13 17:06:00,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:06:00,025 INFO L93 Difference]: Finished difference Result 15120 states and 20874 transitions. [2022-12-13 17:06:00,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 17:06:00,026 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 75 [2022-12-13 17:06:00,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:06:00,082 INFO L225 Difference]: With dead ends: 15120 [2022-12-13 17:06:00,083 INFO L226 Difference]: Without dead ends: 10237 [2022-12-13 17:06:00,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-12-13 17:06:00,101 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 934 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 17:06:00,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [965 Valid, 1054 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 17:06:00,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10237 states. [2022-12-13 17:06:00,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10237 to 7443. [2022-12-13 17:06:00,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7443 states, 6308 states have (on average 1.3202282815472417) internal successors, (8328), 6388 states have internal predecessors, (8328), 687 states have call successors, (687), 411 states have call predecessors, (687), 447 states have return successors, (971), 644 states have call predecessors, (971), 684 states have call successors, (971) [2022-12-13 17:06:00,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7443 states to 7443 states and 9986 transitions. [2022-12-13 17:06:00,884 INFO L78 Accepts]: Start accepts. Automaton has 7443 states and 9986 transitions. Word has length 75 [2022-12-13 17:06:00,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:06:00,884 INFO L495 AbstractCegarLoop]: Abstraction has 7443 states and 9986 transitions. [2022-12-13 17:06:00,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-12-13 17:06:00,884 INFO L276 IsEmpty]: Start isEmpty. Operand 7443 states and 9986 transitions. [2022-12-13 17:06:00,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-12-13 17:06:00,885 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:06:00,885 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:06:00,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 17:06:00,886 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:06:00,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:06:00,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1139883952, now seen corresponding path program 1 times [2022-12-13 17:06:00,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:06:00,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7700657] [2022-12-13 17:06:00,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:06:00,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:06:00,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:00,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:06:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:00,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:06:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:00,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 17:06:00,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:00,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:06:00,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:00,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 17:06:00,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:00,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-12-13 17:06:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:00,945 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 17:06:00,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:06:00,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7700657] [2022-12-13 17:06:00,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7700657] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:06:00,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826728620] [2022-12-13 17:06:00,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:06:00,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:06:00,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:06:00,947 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:06:00,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 17:06:01,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:01,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 17:06:01,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:06:01,030 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:06:01,030 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:06:01,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826728620] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:06:01,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 17:06:01,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-12-13 17:06:01,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645497920] [2022-12-13 17:06:01,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:06:01,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:06:01,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:06:01,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:06:01,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:06:01,032 INFO L87 Difference]: Start difference. First operand 7443 states and 9986 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-13 17:06:02,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:06:02,186 INFO L93 Difference]: Finished difference Result 19570 states and 26516 transitions. [2022-12-13 17:06:02,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:06:02,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 79 [2022-12-13 17:06:02,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:06:02,221 INFO L225 Difference]: With dead ends: 19570 [2022-12-13 17:06:02,222 INFO L226 Difference]: Without dead ends: 12139 [2022-12-13 17:06:02,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:06:02,234 INFO L413 NwaCegarLoop]: 309 mSDtfsCounter, 128 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:06:02,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 478 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:06:02,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12139 states. [2022-12-13 17:06:03,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12139 to 11576. [2022-12-13 17:06:03,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11576 states, 9763 states have (on average 1.3097408583427226) internal successors, (12787), 9893 states have internal predecessors, (12787), 1097 states have call successors, (1097), 657 states have call predecessors, (1097), 715 states have return successors, (1717), 1027 states have call predecessors, (1717), 1094 states have call successors, (1717) [2022-12-13 17:06:03,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11576 states to 11576 states and 15601 transitions. [2022-12-13 17:06:03,264 INFO L78 Accepts]: Start accepts. Automaton has 11576 states and 15601 transitions. Word has length 79 [2022-12-13 17:06:03,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:06:03,265 INFO L495 AbstractCegarLoop]: Abstraction has 11576 states and 15601 transitions. [2022-12-13 17:06:03,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-13 17:06:03,265 INFO L276 IsEmpty]: Start isEmpty. Operand 11576 states and 15601 transitions. [2022-12-13 17:06:03,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-12-13 17:06:03,267 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:06:03,267 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2022-12-13 17:06:03,271 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 17:06:03,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 17:06:03,469 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:06:03,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:06:03,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1579582129, now seen corresponding path program 1 times [2022-12-13 17:06:03,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:06:03,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697890818] [2022-12-13 17:06:03,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:06:03,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:06:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:03,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:06:03,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:03,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:06:03,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:03,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 17:06:03,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:03,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:06:03,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:03,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 17:06:03,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:03,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 17:06:03,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:03,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 17:06:03,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:03,579 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 17:06:03,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:06:03,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697890818] [2022-12-13 17:06:03,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697890818] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:06:03,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:06:03,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 17:06:03,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814885062] [2022-12-13 17:06:03,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:06:03,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:06:03,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:06:03,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:06:03,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:06:03,581 INFO L87 Difference]: Start difference. First operand 11576 states and 15601 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 17:06:05,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:06:05,687 INFO L93 Difference]: Finished difference Result 29101 states and 39401 transitions. [2022-12-13 17:06:05,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 17:06:05,688 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 84 [2022-12-13 17:06:05,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:06:05,739 INFO L225 Difference]: With dead ends: 29101 [2022-12-13 17:06:05,739 INFO L226 Difference]: Without dead ends: 19000 [2022-12-13 17:06:05,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-12-13 17:06:05,762 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 800 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 832 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 17:06:05,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [832 Valid, 1054 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 17:06:05,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19000 states. [2022-12-13 17:06:06,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19000 to 15958. [2022-12-13 17:06:06,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15958 states, 13549 states have (on average 1.318916525204812) internal successors, (17870), 13759 states have internal predecessors, (17870), 1425 states have call successors, (1425), 853 states have call predecessors, (1425), 983 states have return successors, (2443), 1347 states have call predecessors, (2443), 1422 states have call successors, (2443) [2022-12-13 17:06:07,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15958 states to 15958 states and 21738 transitions. [2022-12-13 17:06:07,014 INFO L78 Accepts]: Start accepts. Automaton has 15958 states and 21738 transitions. Word has length 84 [2022-12-13 17:06:07,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:06:07,015 INFO L495 AbstractCegarLoop]: Abstraction has 15958 states and 21738 transitions. [2022-12-13 17:06:07,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 17:06:07,015 INFO L276 IsEmpty]: Start isEmpty. Operand 15958 states and 21738 transitions. [2022-12-13 17:06:07,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-12-13 17:06:07,018 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:06:07,018 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:06:07,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 17:06:07,018 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:06:07,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:06:07,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1643055201, now seen corresponding path program 1 times [2022-12-13 17:06:07,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:06:07,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145056075] [2022-12-13 17:06:07,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:06:07,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:06:07,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:07,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:06:07,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:07,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:06:07,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:07,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 17:06:07,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:07,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:06:07,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:07,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 17:06:07,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:07,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 17:06:07,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:07,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 17:06:07,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:07,127 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 17:06:07,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:06:07,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145056075] [2022-12-13 17:06:07,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145056075] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:06:07,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:06:07,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 17:06:07,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524692162] [2022-12-13 17:06:07,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:06:07,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 17:06:07,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:06:07,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 17:06:07,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:06:07,129 INFO L87 Difference]: Start difference. First operand 15958 states and 21738 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 17:06:10,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:06:10,989 INFO L93 Difference]: Finished difference Result 48940 states and 68972 transitions. [2022-12-13 17:06:10,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 17:06:10,990 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 87 [2022-12-13 17:06:10,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:06:11,076 INFO L225 Difference]: With dead ends: 48940 [2022-12-13 17:06:11,076 INFO L226 Difference]: Without dead ends: 34457 [2022-12-13 17:06:11,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2022-12-13 17:06:11,105 INFO L413 NwaCegarLoop]: 568 mSDtfsCounter, 1085 mSDsluCounter, 1973 mSDsCounter, 0 mSdLazyCounter, 1823 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1129 SdHoareTripleChecker+Valid, 2541 SdHoareTripleChecker+Invalid, 2006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 1823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-13 17:06:11,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1129 Valid, 2541 Invalid, 2006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 1823 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-13 17:06:11,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34457 states. [2022-12-13 17:06:13,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34457 to 23023. [2022-12-13 17:06:13,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23023 states, 19606 states have (on average 1.3243904927063144) internal successors, (25966), 19886 states have internal predecessors, (25966), 2016 states have call successors, (2016), 1207 states have call predecessors, (2016), 1400 states have return successors, (3536), 1931 states have call predecessors, (3536), 2013 states have call successors, (3536) [2022-12-13 17:06:13,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23023 states to 23023 states and 31518 transitions. [2022-12-13 17:06:13,256 INFO L78 Accepts]: Start accepts. Automaton has 23023 states and 31518 transitions. Word has length 87 [2022-12-13 17:06:13,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:06:13,256 INFO L495 AbstractCegarLoop]: Abstraction has 23023 states and 31518 transitions. [2022-12-13 17:06:13,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 17:06:13,256 INFO L276 IsEmpty]: Start isEmpty. Operand 23023 states and 31518 transitions. [2022-12-13 17:06:13,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-12-13 17:06:13,259 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:06:13,259 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:06:13,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 17:06:13,259 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:06:13,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:06:13,259 INFO L85 PathProgramCache]: Analyzing trace with hash -585804370, now seen corresponding path program 1 times [2022-12-13 17:06:13,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:06:13,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170911751] [2022-12-13 17:06:13,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:06:13,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:06:13,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:13,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:06:13,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:13,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:06:13,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:13,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 17:06:13,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:13,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:06:13,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:13,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 17:06:13,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:13,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 17:06:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:13,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-12-13 17:06:13,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:13,319 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 17:06:13,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:06:13,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170911751] [2022-12-13 17:06:13,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170911751] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:06:13,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:06:13,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 17:06:13,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527262813] [2022-12-13 17:06:13,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:06:13,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:06:13,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:06:13,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:06:13,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:06:13,321 INFO L87 Difference]: Start difference. First operand 23023 states and 31518 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 5 states have internal predecessors, (78), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 17:06:18,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:06:18,176 INFO L93 Difference]: Finished difference Result 70442 states and 97850 transitions. [2022-12-13 17:06:18,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 17:06:18,177 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 5 states have internal predecessors, (78), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 95 [2022-12-13 17:06:18,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:06:18,272 INFO L225 Difference]: With dead ends: 70442 [2022-12-13 17:06:18,272 INFO L226 Difference]: Without dead ends: 47435 [2022-12-13 17:06:18,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2022-12-13 17:06:18,312 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 1162 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1177 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 17:06:18,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1177 Valid, 940 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 17:06:18,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47435 states. [2022-12-13 17:06:22,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47435 to 44532. [2022-12-13 17:06:22,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44532 states, 37825 states have (on average 1.2966556510244547) internal successors, (49046), 38360 states have internal predecessors, (49046), 3900 states have call successors, (3900), 2376 states have call predecessors, (3900), 2806 states have return successors, (7008), 3797 states have call predecessors, (7008), 3897 states have call successors, (7008) [2022-12-13 17:06:22,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44532 states to 44532 states and 59954 transitions. [2022-12-13 17:06:22,586 INFO L78 Accepts]: Start accepts. Automaton has 44532 states and 59954 transitions. Word has length 95 [2022-12-13 17:06:22,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:06:22,587 INFO L495 AbstractCegarLoop]: Abstraction has 44532 states and 59954 transitions. [2022-12-13 17:06:22,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 5 states have internal predecessors, (78), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 17:06:22,587 INFO L276 IsEmpty]: Start isEmpty. Operand 44532 states and 59954 transitions. [2022-12-13 17:06:22,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-12-13 17:06:22,594 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:06:22,594 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:06:22,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 17:06:22,594 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:06:22,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:06:22,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1094142346, now seen corresponding path program 1 times [2022-12-13 17:06:22,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:06:22,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370962118] [2022-12-13 17:06:22,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:06:22,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:06:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:22,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:06:22,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:22,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:06:22,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:22,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 17:06:22,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:22,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:06:22,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:22,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 17:06:22,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:22,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 17:06:22,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:22,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-12-13 17:06:22,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:22,681 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 17:06:22,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:06:22,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370962118] [2022-12-13 17:06:22,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370962118] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:06:22,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344615781] [2022-12-13 17:06:22,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:06:22,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:06:22,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:06:22,683 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:06:22,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 17:06:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:22,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 17:06:22,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:06:22,842 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:06:22,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:06:23,079 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 17:06:23,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344615781] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 17:06:23,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:06:23,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 7] total 15 [2022-12-13 17:06:23,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301010337] [2022-12-13 17:06:23,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:06:23,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 17:06:23,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:06:23,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 17:06:23,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-12-13 17:06:23,081 INFO L87 Difference]: Start difference. First operand 44532 states and 59954 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 17:06:27,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:06:27,375 INFO L93 Difference]: Finished difference Result 47192 states and 63262 transitions. [2022-12-13 17:06:27,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 17:06:27,376 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 96 [2022-12-13 17:06:27,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:06:27,473 INFO L225 Difference]: With dead ends: 47192 [2022-12-13 17:06:27,473 INFO L226 Difference]: Without dead ends: 47189 [2022-12-13 17:06:27,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 197 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2022-12-13 17:06:27,490 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 293 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:06:27,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 1088 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:06:27,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47189 states. [2022-12-13 17:06:31,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47189 to 45616. [2022-12-13 17:06:31,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45616 states, 38728 states have (on average 1.293792604833712) internal successors, (50106), 39281 states have internal predecessors, (50106), 4006 states have call successors, (4006), 2443 states have call predecessors, (4006), 2881 states have return successors, (7155), 3893 states have call predecessors, (7155), 4003 states have call successors, (7155) [2022-12-13 17:06:31,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45616 states to 45616 states and 61267 transitions. [2022-12-13 17:06:31,344 INFO L78 Accepts]: Start accepts. Automaton has 45616 states and 61267 transitions. Word has length 96 [2022-12-13 17:06:31,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:06:31,344 INFO L495 AbstractCegarLoop]: Abstraction has 45616 states and 61267 transitions. [2022-12-13 17:06:31,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 17:06:31,345 INFO L276 IsEmpty]: Start isEmpty. Operand 45616 states and 61267 transitions. [2022-12-13 17:06:31,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-12-13 17:06:31,348 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:06:31,348 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 17:06:31,353 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 17:06:31,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 17:06:31,549 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:06:31,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:06:31,550 INFO L85 PathProgramCache]: Analyzing trace with hash -2018622111, now seen corresponding path program 1 times [2022-12-13 17:06:31,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:06:31,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297916946] [2022-12-13 17:06:31,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:06:31,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:06:31,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:31,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:06:31,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:31,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:06:31,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:31,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 17:06:31,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:31,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:06:31,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:31,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 17:06:31,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:31,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 17:06:31,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:31,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 17:06:31,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:31,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-12-13 17:06:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:31,650 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 17:06:31,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:06:31,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297916946] [2022-12-13 17:06:31,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297916946] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:06:31,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:06:31,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 17:06:31,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387016573] [2022-12-13 17:06:31,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:06:31,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 17:06:31,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:06:31,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 17:06:31,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:06:31,652 INFO L87 Difference]: Start difference. First operand 45616 states and 61267 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 4 states have internal predecessors, (74), 3 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 17:06:36,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:06:36,329 INFO L93 Difference]: Finished difference Result 95017 states and 127534 transitions. [2022-12-13 17:06:36,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 17:06:36,330 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 4 states have internal predecessors, (74), 3 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 97 [2022-12-13 17:06:36,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:06:36,446 INFO L225 Difference]: With dead ends: 95017 [2022-12-13 17:06:36,446 INFO L226 Difference]: Without dead ends: 49417 [2022-12-13 17:06:36,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-12-13 17:06:36,514 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 376 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 17:06:36,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 509 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 17:06:36,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49417 states. [2022-12-13 17:06:40,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49417 to 45504. [2022-12-13 17:06:40,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45504 states, 38504 states have (on average 1.2854768335757323) internal successors, (49496), 39169 states have internal predecessors, (49496), 4006 states have call successors, (4006), 2443 states have call predecessors, (4006), 2993 states have return successors, (6707), 3893 states have call predecessors, (6707), 4003 states have call successors, (6707) [2022-12-13 17:06:40,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45504 states to 45504 states and 60209 transitions. [2022-12-13 17:06:40,709 INFO L78 Accepts]: Start accepts. Automaton has 45504 states and 60209 transitions. Word has length 97 [2022-12-13 17:06:40,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:06:40,710 INFO L495 AbstractCegarLoop]: Abstraction has 45504 states and 60209 transitions. [2022-12-13 17:06:40,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 4 states have internal predecessors, (74), 3 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 17:06:40,710 INFO L276 IsEmpty]: Start isEmpty. Operand 45504 states and 60209 transitions. [2022-12-13 17:06:40,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-12-13 17:06:40,713 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:06:40,713 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 17:06:40,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 17:06:40,713 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:06:40,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:06:40,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1281651487, now seen corresponding path program 1 times [2022-12-13 17:06:40,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:06:40,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443802059] [2022-12-13 17:06:40,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:06:40,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:06:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:40,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:06:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:40,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:06:40,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:40,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 17:06:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:40,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:06:40,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:40,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 17:06:40,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:40,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 17:06:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:40,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 17:06:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:40,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-12-13 17:06:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:40,752 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-13 17:06:40,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:06:40,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443802059] [2022-12-13 17:06:40,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443802059] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:06:40,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:06:40,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 17:06:40,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064544093] [2022-12-13 17:06:40,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:06:40,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:06:40,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:06:40,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:06:40,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:06:40,754 INFO L87 Difference]: Start difference. First operand 45504 states and 60209 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 17:06:45,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:06:45,118 INFO L93 Difference]: Finished difference Result 51692 states and 68590 transitions. [2022-12-13 17:06:45,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 17:06:45,119 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 97 [2022-12-13 17:06:45,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:06:45,230 INFO L225 Difference]: With dead ends: 51692 [2022-12-13 17:06:45,230 INFO L226 Difference]: Without dead ends: 49214 [2022-12-13 17:06:45,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:06:45,253 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 308 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:06:45,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 282 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:06:45,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49214 states. [2022-12-13 17:06:49,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49214 to 45341. [2022-12-13 17:06:49,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45341 states, 38371 states have (on average 1.2857366240129264) internal successors, (49335), 39034 states have internal predecessors, (49335), 3987 states have call successors, (3987), 2433 states have call predecessors, (3987), 2982 states have return successors, (6686), 3874 states have call predecessors, (6686), 3984 states have call successors, (6686) [2022-12-13 17:06:49,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45341 states to 45341 states and 60008 transitions. [2022-12-13 17:06:49,331 INFO L78 Accepts]: Start accepts. Automaton has 45341 states and 60008 transitions. Word has length 97 [2022-12-13 17:06:49,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:06:49,332 INFO L495 AbstractCegarLoop]: Abstraction has 45341 states and 60008 transitions. [2022-12-13 17:06:49,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 17:06:49,332 INFO L276 IsEmpty]: Start isEmpty. Operand 45341 states and 60008 transitions. [2022-12-13 17:06:49,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-12-13 17:06:49,337 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:06:49,337 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:06:49,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 17:06:49,337 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:06:49,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:06:49,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1766914234, now seen corresponding path program 1 times [2022-12-13 17:06:49,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:06:49,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835167041] [2022-12-13 17:06:49,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:06:49,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:06:49,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:49,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:06:49,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:49,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:06:49,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:49,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 17:06:49,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:49,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:06:49,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:49,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 17:06:49,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:49,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 17:06:49,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:49,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 17:06:49,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:49,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 17:06:49,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:49,406 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 17:06:49,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:06:49,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835167041] [2022-12-13 17:06:49,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835167041] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:06:49,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:06:49,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 17:06:49,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145878766] [2022-12-13 17:06:49,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:06:49,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:06:49,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:06:49,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:06:49,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:06:49,408 INFO L87 Difference]: Start difference. First operand 45341 states and 60008 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 5 states have internal predecessors, (77), 4 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 17:06:54,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:06:54,602 INFO L93 Difference]: Finished difference Result 93536 states and 123840 transitions. [2022-12-13 17:06:54,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 17:06:54,602 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 5 states have internal predecessors, (77), 4 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 98 [2022-12-13 17:06:54,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:06:54,710 INFO L225 Difference]: With dead ends: 93536 [2022-12-13 17:06:54,710 INFO L226 Difference]: Without dead ends: 48207 [2022-12-13 17:06:54,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2022-12-13 17:06:54,782 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 1252 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1267 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 17:06:54,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1267 Valid, 894 Invalid, 967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 17:06:54,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48207 states. [2022-12-13 17:06:58,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48207 to 45479. [2022-12-13 17:06:58,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45479 states, 38509 states have (on average 1.2777792204419747) internal successors, (49206), 39172 states have internal predecessors, (49206), 3987 states have call successors, (3987), 2433 states have call predecessors, (3987), 2982 states have return successors, (6350), 3874 states have call predecessors, (6350), 3984 states have call successors, (6350) [2022-12-13 17:06:58,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45479 states to 45479 states and 59543 transitions. [2022-12-13 17:06:58,937 INFO L78 Accepts]: Start accepts. Automaton has 45479 states and 59543 transitions. Word has length 98 [2022-12-13 17:06:58,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:06:58,937 INFO L495 AbstractCegarLoop]: Abstraction has 45479 states and 59543 transitions. [2022-12-13 17:06:58,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 5 states have internal predecessors, (77), 4 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 17:06:58,937 INFO L276 IsEmpty]: Start isEmpty. Operand 45479 states and 59543 transitions. [2022-12-13 17:06:58,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-12-13 17:06:58,943 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:06:58,943 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:06:58,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 17:06:58,943 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:06:58,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:06:58,943 INFO L85 PathProgramCache]: Analyzing trace with hash 274261474, now seen corresponding path program 1 times [2022-12-13 17:06:58,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:06:58,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19009693] [2022-12-13 17:06:58,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:06:58,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:06:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:58,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:06:58,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:58,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:06:58,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:58,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 17:06:58,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:58,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:06:58,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:58,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 17:06:58,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:58,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 17:06:58,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:58,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 17:06:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:58,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 17:06:58,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:58,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-12-13 17:06:58,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:58,993 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-13 17:06:58,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:06:58,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19009693] [2022-12-13 17:06:58,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19009693] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:06:58,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:06:58,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 17:06:58,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215721885] [2022-12-13 17:06:58,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:06:58,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:06:58,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:06:58,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:06:58,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:06:58,995 INFO L87 Difference]: Start difference. First operand 45479 states and 59543 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-13 17:07:06,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:07:06,941 INFO L93 Difference]: Finished difference Result 123351 states and 162423 transitions. [2022-12-13 17:07:06,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 17:07:06,942 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 120 [2022-12-13 17:07:06,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:07:07,130 INFO L225 Difference]: With dead ends: 123351 [2022-12-13 17:07:07,130 INFO L226 Difference]: Without dead ends: 78973 [2022-12-13 17:07:07,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-13 17:07:07,214 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 394 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 17:07:07,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 426 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 17:07:07,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78973 states. [2022-12-13 17:07:14,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78973 to 72408. [2022-12-13 17:07:14,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72408 states, 61512 states have (on average 1.2818311874105865) internal successors, (78848), 62588 states have internal predecessors, (78848), 6164 states have call successors, (6164), 3832 states have call predecessors, (6164), 4731 states have return successors, (9893), 5988 states have call predecessors, (9893), 6161 states have call successors, (9893) [2022-12-13 17:07:14,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72408 states to 72408 states and 94905 transitions. [2022-12-13 17:07:14,444 INFO L78 Accepts]: Start accepts. Automaton has 72408 states and 94905 transitions. Word has length 120 [2022-12-13 17:07:14,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:07:14,444 INFO L495 AbstractCegarLoop]: Abstraction has 72408 states and 94905 transitions. [2022-12-13 17:07:14,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-13 17:07:14,444 INFO L276 IsEmpty]: Start isEmpty. Operand 72408 states and 94905 transitions. [2022-12-13 17:07:14,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-12-13 17:07:14,455 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:07:14,455 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:07:14,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 17:07:14,455 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:07:14,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:07:14,455 INFO L85 PathProgramCache]: Analyzing trace with hash -46894051, now seen corresponding path program 1 times [2022-12-13 17:07:14,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:07:14,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012865362] [2022-12-13 17:07:14,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:07:14,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:07:14,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:07:14,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:07:14,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:07:14,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:07:14,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:07:14,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 17:07:14,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:07:14,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:07:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:07:14,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 17:07:14,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:07:14,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-12-13 17:07:14,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:07:14,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 17:07:14,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:07:14,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 17:07:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:07:14,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-12-13 17:07:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:07:14,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-12-13 17:07:14,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:07:14,549 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 21 proven. 16 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-13 17:07:14,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:07:14,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012865362] [2022-12-13 17:07:14,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012865362] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:07:14,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181529354] [2022-12-13 17:07:14,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:07:14,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:07:14,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:07:14,551 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:07:14,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 17:07:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:07:14,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 17:07:14,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:07:14,707 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-13 17:07:14,707 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:07:14,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181529354] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:07:14,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 17:07:14,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 10 [2022-12-13 17:07:14,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907304894] [2022-12-13 17:07:14,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:07:14,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:07:14,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:07:14,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:07:14,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 17:07:14,709 INFO L87 Difference]: Start difference. First operand 72408 states and 94905 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-13 17:07:24,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:07:24,289 INFO L93 Difference]: Finished difference Result 160648 states and 209429 transitions. [2022-12-13 17:07:24,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:07:24,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 137 [2022-12-13 17:07:24,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:07:24,562 INFO L225 Difference]: With dead ends: 160648 [2022-12-13 17:07:24,563 INFO L226 Difference]: Without dead ends: 103970 [2022-12-13 17:07:24,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 17:07:24,640 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 80 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:07:24,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 357 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:07:24,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103970 states. [2022-12-13 17:07:34,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103970 to 103965. [2022-12-13 17:07:34,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103965 states, 87905 states have (on average 1.2687105397872704) internal successors, (111526), 89407 states have internal predecessors, (111526), 8954 states have call successors, (8954), 5826 states have call predecessors, (8954), 7105 states have return successors, (13362), 8732 states have call predecessors, (13362), 8951 states have call successors, (13362) [2022-12-13 17:07:34,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103965 states to 103965 states and 133842 transitions. [2022-12-13 17:07:34,446 INFO L78 Accepts]: Start accepts. Automaton has 103965 states and 133842 transitions. Word has length 137 [2022-12-13 17:07:34,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:07:34,446 INFO L495 AbstractCegarLoop]: Abstraction has 103965 states and 133842 transitions. [2022-12-13 17:07:34,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-13 17:07:34,447 INFO L276 IsEmpty]: Start isEmpty. Operand 103965 states and 133842 transitions. [2022-12-13 17:07:34,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-12-13 17:07:34,457 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:07:34,457 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-12-13 17:07:34,463 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 17:07:34,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:07:34,658 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:07:34,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:07:34,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1815710136, now seen corresponding path program 1 times [2022-12-13 17:07:34,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:07:34,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939665654] [2022-12-13 17:07:34,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:07:34,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:07:34,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:07:34,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:07:34,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:07:34,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:07:34,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:07:34,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 17:07:34,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:07:34,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:07:34,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:07:34,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 17:07:34,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:07:34,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-12-13 17:07:34,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:07:34,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-12-13 17:07:34,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:07:34,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-12-13 17:07:34,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:07:34,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-12-13 17:07:34,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:07:34,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 17:07:34,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:07:34,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-12-13 17:07:34,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:07:34,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-12-13 17:07:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:07:34,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-12-13 17:07:34,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:07:34,743 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-12-13 17:07:34,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:07:34,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939665654] [2022-12-13 17:07:34,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939665654] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:07:34,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110278122] [2022-12-13 17:07:34,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:07:34,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:07:34,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:07:34,744 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:07:34,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 17:07:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:07:34,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 17:07:34,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:07:34,885 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-12-13 17:07:34,885 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:07:34,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110278122] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:07:34,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 17:07:34,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2022-12-13 17:07:34,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093554896] [2022-12-13 17:07:34,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:07:34,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:07:34,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:07:34,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:07:34,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-13 17:07:34,886 INFO L87 Difference]: Start difference. First operand 103965 states and 133842 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-12-13 17:07:53,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:07:53,749 INFO L93 Difference]: Finished difference Result 298823 states and 390224 transitions. [2022-12-13 17:07:53,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:07:53,750 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 144 [2022-12-13 17:07:53,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:07:54,326 INFO L225 Difference]: With dead ends: 298823 [2022-12-13 17:07:54,326 INFO L226 Difference]: Without dead ends: 201274 [2022-12-13 17:07:54,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-13 17:07:54,472 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 104 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:07:54,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 355 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:07:54,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201274 states. [2022-12-13 17:08:13,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201274 to 199631. [2022-12-13 17:08:13,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199631 states, 168987 states have (on average 1.2640439797144158) internal successors, (213607), 171920 states have internal predecessors, (213607), 17005 states have call successors, (17005), 11135 states have call predecessors, (17005), 13638 states have return successors, (25238), 16576 states have call predecessors, (25238), 17002 states have call successors, (25238) [2022-12-13 17:08:14,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199631 states to 199631 states and 255850 transitions. [2022-12-13 17:08:14,049 INFO L78 Accepts]: Start accepts. Automaton has 199631 states and 255850 transitions. Word has length 144 [2022-12-13 17:08:14,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:08:14,049 INFO L495 AbstractCegarLoop]: Abstraction has 199631 states and 255850 transitions. [2022-12-13 17:08:14,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-12-13 17:08:14,049 INFO L276 IsEmpty]: Start isEmpty. Operand 199631 states and 255850 transitions. [2022-12-13 17:08:14,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-12-13 17:08:14,065 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:08:14,065 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:08:14,070 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 17:08:14,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-13 17:08:14,267 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:08:14,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:08:14,268 INFO L85 PathProgramCache]: Analyzing trace with hash -2019564232, now seen corresponding path program 1 times [2022-12-13 17:08:14,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:08:14,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028322244] [2022-12-13 17:08:14,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:08:14,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:08:14,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:08:14,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:08:14,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:08:14,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:08:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:08:14,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 17:08:14,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:08:14,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:08:14,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:08:14,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 17:08:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:08:14,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-12-13 17:08:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:08:14,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-12-13 17:08:14,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:08:14,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-12-13 17:08:14,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:08:14,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-12-13 17:08:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:08:14,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-12-13 17:08:14,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:08:14,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-12-13 17:08:14,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:08:14,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-12-13 17:08:14,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:08:14,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-12-13 17:08:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:08:14,364 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-12-13 17:08:14,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:08:14,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028322244] [2022-12-13 17:08:14,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028322244] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:08:14,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417532515] [2022-12-13 17:08:14,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:08:14,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:08:14,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:08:14,366 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:08:14,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 17:08:14,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:08:14,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 17:08:14,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:08:14,510 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-12-13 17:08:14,510 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:08:14,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417532515] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:08:14,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 17:08:14,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2022-12-13 17:08:14,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080560834] [2022-12-13 17:08:14,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:08:14,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:08:14,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:08:14,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:08:14,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-13 17:08:14,512 INFO L87 Difference]: Start difference. First operand 199631 states and 255850 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-12-13 17:08:31,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:08:31,297 INFO L93 Difference]: Finished difference Result 371874 states and 479298 transitions. [2022-12-13 17:08:31,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:08:31,298 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 145 [2022-12-13 17:08:31,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:08:31,726 INFO L225 Difference]: With dead ends: 371874 [2022-12-13 17:08:31,726 INFO L226 Difference]: Without dead ends: 178659 [2022-12-13 17:08:31,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-13 17:08:31,952 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 91 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:08:31,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 357 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:08:32,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178659 states. [2022-12-13 17:08:50,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178659 to 178654. [2022-12-13 17:08:50,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178654 states, 151357 states have (on average 1.2633508856544462) internal successors, (191217), 153940 states have internal predecessors, (191217), 15247 states have call successors, (15247), 9860 states have call predecessors, (15247), 12049 states have return successors, (23010), 14854 states have call predecessors, (23010), 15244 states have call successors, (23010) [2022-12-13 17:08:51,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178654 states to 178654 states and 229474 transitions. [2022-12-13 17:08:51,104 INFO L78 Accepts]: Start accepts. Automaton has 178654 states and 229474 transitions. Word has length 145 [2022-12-13 17:08:51,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:08:51,104 INFO L495 AbstractCegarLoop]: Abstraction has 178654 states and 229474 transitions. [2022-12-13 17:08:51,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-12-13 17:08:51,105 INFO L276 IsEmpty]: Start isEmpty. Operand 178654 states and 229474 transitions. [2022-12-13 17:08:51,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-12-13 17:08:51,118 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:08:51,118 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:08:51,123 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 17:08:51,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-12-13 17:08:51,320 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:08:51,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:08:51,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1223161892, now seen corresponding path program 1 times [2022-12-13 17:08:51,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:08:51,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353838233] [2022-12-13 17:08:51,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:08:51,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:08:51,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:08:51,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:08:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:08:51,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:08:51,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:08:51,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 17:08:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:08:51,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:08:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:08:51,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 17:08:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:08:51,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 17:08:51,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:08:51,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-12-13 17:08:51,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:08:51,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-12-13 17:08:51,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:08:51,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-12-13 17:08:51,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:08:51,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 17:08:51,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:08:51,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-12-13 17:08:51,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:08:51,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-12-13 17:08:51,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:08:51,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-12-13 17:08:51,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:08:51,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-12-13 17:08:51,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:08:51,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-12-13 17:08:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:08:51,440 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-12-13 17:08:51,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:08:51,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353838233] [2022-12-13 17:08:51,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353838233] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:08:51,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098892888] [2022-12-13 17:08:51,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:08:51,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:08:51,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:08:51,442 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:08:51,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 17:08:51,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:08:51,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 17:08:51,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:08:51,593 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-12-13 17:08:51,593 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:08:51,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098892888] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:08:51,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 17:08:51,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 10 [2022-12-13 17:08:51,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925426950] [2022-12-13 17:08:51,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:08:51,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:08:51,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:08:51,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:08:51,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-12-13 17:08:51,595 INFO L87 Difference]: Start difference. First operand 178654 states and 229474 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-12-13 17:09:05,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:09:05,336 INFO L93 Difference]: Finished difference Result 328834 states and 424510 transitions. [2022-12-13 17:09:05,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:09:05,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 162 [2022-12-13 17:09:05,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:09:05,712 INFO L225 Difference]: With dead ends: 328834 [2022-12-13 17:09:05,712 INFO L226 Difference]: Without dead ends: 150191 [2022-12-13 17:09:05,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-12-13 17:09:05,963 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 80 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:09:05,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 355 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:09:06,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150191 states. [2022-12-13 17:09:20,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150191 to 150187. [2022-12-13 17:09:20,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150187 states, 127408 states have (on average 1.2684839256561597) internal successors, (161615), 129546 states have internal predecessors, (161615), 12840 states have call successors, (12840), 8139 states have call predecessors, (12840), 9938 states have return successors, (19949), 12502 states have call predecessors, (19949), 12837 states have call successors, (19949) [2022-12-13 17:09:20,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150187 states to 150187 states and 194404 transitions. [2022-12-13 17:09:20,665 INFO L78 Accepts]: Start accepts. Automaton has 150187 states and 194404 transitions. Word has length 162 [2022-12-13 17:09:20,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:09:20,665 INFO L495 AbstractCegarLoop]: Abstraction has 150187 states and 194404 transitions. [2022-12-13 17:09:20,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-12-13 17:09:20,666 INFO L276 IsEmpty]: Start isEmpty. Operand 150187 states and 194404 transitions. [2022-12-13 17:09:20,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-12-13 17:09:20,679 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:09:20,679 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:09:20,684 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 17:09:20,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-13 17:09:20,881 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:09:20,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:09:20,882 INFO L85 PathProgramCache]: Analyzing trace with hash 393612564, now seen corresponding path program 1 times [2022-12-13 17:09:20,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:09:20,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977147727] [2022-12-13 17:09:20,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:09:20,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:09:20,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:09:20,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:09:20,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:09:20,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:09:20,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:09:20,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 17:09:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:09:20,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:09:20,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:09:20,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 17:09:20,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:09:20,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-12-13 17:09:20,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:09:20,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-12-13 17:09:20,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:09:20,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-12-13 17:09:20,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:09:20,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-12-13 17:09:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:09:20,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-12-13 17:09:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:09:20,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-12-13 17:09:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:09:20,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-12-13 17:09:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:09:20,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-12-13 17:09:20,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:09:20,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-12-13 17:09:20,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:09:20,971 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2022-12-13 17:09:20,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:09:20,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977147727] [2022-12-13 17:09:20,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977147727] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:09:20,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858395212] [2022-12-13 17:09:20,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:09:20,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:09:20,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:09:20,972 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:09:20,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 17:09:21,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:09:21,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 17:09:21,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:09:21,097 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-12-13 17:09:21,098 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:09:21,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858395212] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:09:21,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 17:09:21,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2022-12-13 17:09:21,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17271489] [2022-12-13 17:09:21,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:09:21,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:09:21,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:09:21,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:09:21,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-13 17:09:21,099 INFO L87 Difference]: Start difference. First operand 150187 states and 194404 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-12-13 17:09:38,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:09:38,739 INFO L93 Difference]: Finished difference Result 345590 states and 465680 transitions. [2022-12-13 17:09:38,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:09:38,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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 173 [2022-12-13 17:09:38,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:09:39,377 INFO L225 Difference]: With dead ends: 345590 [2022-12-13 17:09:39,377 INFO L226 Difference]: Without dead ends: 201086 [2022-12-13 17:09:39,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-13 17:09:39,645 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 124 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:09:39,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 331 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:09:39,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201086 states. [2022-12-13 17:09:57,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201086 to 198269. [2022-12-13 17:09:57,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198269 states, 167492 states have (on average 1.253510615432379) internal successors, (209953), 170181 states have internal predecessors, (209953), 17449 states have call successors, (17449), 11026 states have call predecessors, (17449), 13327 states have return successors, (32044), 17062 states have call predecessors, (32044), 17446 states have call successors, (32044) [2022-12-13 17:09:58,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198269 states to 198269 states and 259446 transitions. [2022-12-13 17:09:58,445 INFO L78 Accepts]: Start accepts. Automaton has 198269 states and 259446 transitions. Word has length 173 [2022-12-13 17:09:58,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:09:58,446 INFO L495 AbstractCegarLoop]: Abstraction has 198269 states and 259446 transitions. [2022-12-13 17:09:58,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-12-13 17:09:58,446 INFO L276 IsEmpty]: Start isEmpty. Operand 198269 states and 259446 transitions. [2022-12-13 17:09:58,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-12-13 17:09:58,465 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:09:58,465 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:09:58,470 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 17:09:58,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-13 17:09:58,668 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:09:58,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:09:58,669 INFO L85 PathProgramCache]: Analyzing trace with hash 315309112, now seen corresponding path program 1 times [2022-12-13 17:09:58,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:09:58,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051795991] [2022-12-13 17:09:58,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:09:58,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:09:58,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:09:58,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:09:58,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:09:58,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:09:58,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:09:58,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 17:09:58,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:09:58,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:09:58,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:09:58,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 17:09:58,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:09:58,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 17:09:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:09:58,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-12-13 17:09:58,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:09:58,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-12-13 17:09:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:09:58,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-12-13 17:09:58,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:09:58,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 17:09:58,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:09:58,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-12-13 17:09:58,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:09:58,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-12-13 17:09:58,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:09:58,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-12-13 17:09:58,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:09:58,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 17:09:58,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:09:58,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-12-13 17:09:58,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:09:58,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-12-13 17:09:58,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:09:58,766 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2022-12-13 17:09:58,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:09:58,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051795991] [2022-12-13 17:09:58,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051795991] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:09:58,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614364024] [2022-12-13 17:09:58,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:09:58,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:09:58,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:09:58,767 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:09:58,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 17:09:58,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:09:58,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 17:09:58,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:09:58,949 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-12-13 17:09:58,949 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:09:58,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614364024] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:09:58,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 17:09:58,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-12-13 17:09:58,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179284572] [2022-12-13 17:09:58,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:09:58,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:09:58,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:09:58,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:09:58,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-12-13 17:09:58,951 INFO L87 Difference]: Start difference. First operand 198269 states and 259446 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, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-12-13 17:10:21,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:10:21,490 INFO L93 Difference]: Finished difference Result 440422 states and 578874 transitions. [2022-12-13 17:10:21,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:10:21,491 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, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 190 [2022-12-13 17:10:21,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:10:22,218 INFO L225 Difference]: With dead ends: 440422 [2022-12-13 17:10:22,219 INFO L226 Difference]: Without dead ends: 243243 [2022-12-13 17:10:22,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-12-13 17:10:22,673 INFO L413 NwaCegarLoop]: 321 mSDtfsCounter, 80 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:10:22,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 487 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:10:22,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243243 states. [2022-12-13 17:10:45,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243243 to 240163. [2022-12-13 17:10:45,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240163 states, 202534 states have (on average 1.246561071227547) internal successors, (252471), 205591 states have internal predecessors, (252471), 21510 states have call successors, (21510), 13588 states have call predecessors, (21510), 16118 states have return successors, (42074), 20985 states have call predecessors, (42074), 21507 states have call successors, (42074) [2022-12-13 17:10:46,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240163 states to 240163 states and 316055 transitions. [2022-12-13 17:10:46,265 INFO L78 Accepts]: Start accepts. Automaton has 240163 states and 316055 transitions. Word has length 190 [2022-12-13 17:10:46,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:10:46,265 INFO L495 AbstractCegarLoop]: Abstraction has 240163 states and 316055 transitions. [2022-12-13 17:10:46,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-12-13 17:10:46,265 INFO L276 IsEmpty]: Start isEmpty. Operand 240163 states and 316055 transitions. [2022-12-13 17:10:46,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-12-13 17:10:46,297 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:10:46,297 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:10:46,302 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 17:10:46,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-13 17:10:46,499 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:10:46,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:10:46,500 INFO L85 PathProgramCache]: Analyzing trace with hash 910912784, now seen corresponding path program 1 times [2022-12-13 17:10:46,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:10:46,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320736282] [2022-12-13 17:10:46,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:10:46,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:10:46,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:10:46,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:10:46,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:10:46,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:10:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:10:46,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 17:10:46,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:10:46,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:10:46,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:10:46,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 17:10:46,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:10:46,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 17:10:46,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:10:46,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 17:10:46,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:10:46,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-12-13 17:10:46,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:10:46,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-12-13 17:10:46,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:10:46,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-12-13 17:10:46,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:10:46,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-12-13 17:10:46,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:10:46,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-12-13 17:10:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:10:46,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-12-13 17:10:46,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:10:46,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-12-13 17:10:46,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:10:46,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-12-13 17:10:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:10:46,637 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2022-12-13 17:10:46,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:10:46,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320736282] [2022-12-13 17:10:46,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320736282] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:10:46,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493657599] [2022-12-13 17:10:46,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:10:46,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:10:46,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:10:46,639 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:10:46,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 17:10:46,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:10:46,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 17:10:46,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:10:46,785 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-12-13 17:10:46,785 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:10:46,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493657599] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:10:46,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 17:10:46,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-12-13 17:10:46,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037576151] [2022-12-13 17:10:46,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:10:46,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:10:46,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:10:46,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:10:46,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-12-13 17:10:46,787 INFO L87 Difference]: Start difference. First operand 240163 states and 316055 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-12-13 17:11:00,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:11:00,257 INFO L93 Difference]: Finished difference Result 362283 states and 481952 transitions. [2022-12-13 17:11:00,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:11:00,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 189 [2022-12-13 17:11:00,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:11:00,623 INFO L225 Difference]: With dead ends: 362283 [2022-12-13 17:11:00,623 INFO L226 Difference]: Without dead ends: 134657 [2022-12-13 17:11:01,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-12-13 17:11:01,046 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 80 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:11:01,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 484 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:11:01,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134657 states. [2022-12-13 17:11:13,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134657 to 132619. [2022-12-13 17:11:13,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132619 states, 112082 states have (on average 1.23395371246052) internal successors, (138304), 113883 states have internal predecessors, (138304), 11664 states have call successors, (11664), 7344 states have call predecessors, (11664), 8872 states have return successors, (19647), 11393 states have call predecessors, (19647), 11661 states have call successors, (19647) [2022-12-13 17:11:13,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132619 states to 132619 states and 169615 transitions. [2022-12-13 17:11:13,977 INFO L78 Accepts]: Start accepts. Automaton has 132619 states and 169615 transitions. Word has length 189 [2022-12-13 17:11:13,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:11:13,978 INFO L495 AbstractCegarLoop]: Abstraction has 132619 states and 169615 transitions. [2022-12-13 17:11:13,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-12-13 17:11:13,978 INFO L276 IsEmpty]: Start isEmpty. Operand 132619 states and 169615 transitions. [2022-12-13 17:11:14,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-12-13 17:11:14,002 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:11:14,002 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:11:14,007 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-13 17:11:14,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-13 17:11:14,204 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:11:14,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:11:14,205 INFO L85 PathProgramCache]: Analyzing trace with hash 520443893, now seen corresponding path program 1 times [2022-12-13 17:11:14,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:11:14,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818060968] [2022-12-13 17:11:14,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:11:14,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:11:14,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:11:14,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:11:14,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:11:14,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:11:14,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:11:14,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 17:11:14,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:11:14,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:11:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:11:14,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 17:11:14,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:11:14,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 17:11:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:11:14,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-12-13 17:11:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:11:14,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-12-13 17:11:14,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:11:14,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-12-13 17:11:14,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:11:14,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 17:11:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:11:14,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-12-13 17:11:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:11:14,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-12-13 17:11:14,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:11:14,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-12-13 17:11:14,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:11:14,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 17:11:14,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:11:14,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-12-13 17:11:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:11:14,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-12-13 17:11:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:11:14,306 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2022-12-13 17:11:14,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:11:14,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818060968] [2022-12-13 17:11:14,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818060968] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:11:14,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034977891] [2022-12-13 17:11:14,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:11:14,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:11:14,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:11:14,307 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:11:14,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 17:11:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:11:14,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 17:11:14,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:11:14,406 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-13 17:11:14,406 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:11:14,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034977891] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:11:14,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 17:11:14,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-12-13 17:11:14,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433716242] [2022-12-13 17:11:14,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:11:14,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:11:14,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:11:14,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:11:14,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-12-13 17:11:14,407 INFO L87 Difference]: Start difference. First operand 132619 states and 169615 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-12-13 17:11:27,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:11:27,540 INFO L93 Difference]: Finished difference Result 245142 states and 317416 transitions. [2022-12-13 17:11:27,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:11:27,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 191 [2022-12-13 17:11:27,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:11:27,930 INFO L225 Difference]: With dead ends: 245142 [2022-12-13 17:11:27,931 INFO L226 Difference]: Without dead ends: 134575 [2022-12-13 17:11:28,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-12-13 17:11:28,129 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 134 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:11:28,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 483 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:11:28,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134575 states. [2022-12-13 17:11:41,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134575 to 133990. [2022-12-13 17:11:41,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133990 states, 113205 states have (on average 1.2157236871162935) internal successors, (137626), 115017 states have internal predecessors, (137626), 11814 states have call successors, (11814), 7440 states have call predecessors, (11814), 8970 states have return successors, (19889), 11534 states have call predecessors, (19889), 11811 states have call successors, (19889) [2022-12-13 17:11:41,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133990 states to 133990 states and 169329 transitions. [2022-12-13 17:11:41,841 INFO L78 Accepts]: Start accepts. Automaton has 133990 states and 169329 transitions. Word has length 191 [2022-12-13 17:11:41,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:11:41,842 INFO L495 AbstractCegarLoop]: Abstraction has 133990 states and 169329 transitions. [2022-12-13 17:11:41,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-12-13 17:11:41,842 INFO L276 IsEmpty]: Start isEmpty. Operand 133990 states and 169329 transitions. [2022-12-13 17:11:41,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-12-13 17:11:41,866 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:11:41,866 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-12-13 17:11:41,871 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 17:11:42,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-13 17:11:42,068 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:11:42,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:11:42,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1057100526, now seen corresponding path program 1 times [2022-12-13 17:11:42,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:11:42,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760796373] [2022-12-13 17:11:42,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:11:42,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:11:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:11:42,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:11:42,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:11:42,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:11:42,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:11:42,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 17:11:42,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:11:42,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:11:42,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:11:42,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 17:11:42,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:11:42,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 17:11:42,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:11:42,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 17:11:42,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:11:42,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-12-13 17:11:42,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:11:42,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-12-13 17:11:42,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:11:42,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 17:11:42,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:11:42,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-12-13 17:11:42,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:11:42,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-12-13 17:11:42,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:11:42,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-12-13 17:11:42,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:11:42,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-12-13 17:11:42,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:11:42,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-12-13 17:11:42,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:11:42,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-12-13 17:11:42,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:11:42,173 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 29 proven. 9 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2022-12-13 17:11:42,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:11:42,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760796373] [2022-12-13 17:11:42,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760796373] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:11:42,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419345714] [2022-12-13 17:11:42,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:11:42,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:11:42,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:11:42,174 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:11:42,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 17:11:42,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:11:42,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 17:11:42,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:11:42,262 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-12-13 17:11:42,263 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:11:42,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419345714] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:11:42,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 17:11:42,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-12-13 17:11:42,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483858348] [2022-12-13 17:11:42,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:11:42,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 17:11:42,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:11:42,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 17:11:42,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-13 17:11:42,264 INFO L87 Difference]: Start difference. First operand 133990 states and 169329 transitions. Second operand has 6 states, 6 states have (on average 21.5) internal successors, (129), 5 states have internal predecessors, (129), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-12-13 17:11:51,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:11:51,583 INFO L93 Difference]: Finished difference Result 226982 states and 285818 transitions. [2022-12-13 17:11:51,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 17:11:51,584 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.5) internal successors, (129), 5 states have internal predecessors, (129), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 192 [2022-12-13 17:11:51,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:11:51,781 INFO L225 Difference]: With dead ends: 226982 [2022-12-13 17:11:51,781 INFO L226 Difference]: Without dead ends: 93005 [2022-12-13 17:11:51,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-12-13 17:11:51,963 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 60 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:11:51,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 825 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:11:52,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93005 states. [2022-12-13 17:12:00,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93005 to 89539. [2022-12-13 17:12:00,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89539 states, 79221 states have (on average 1.216445134497166) internal successors, (96368), 80003 states have internal predecessors, (96368), 5510 states have call successors, (5510), 3395 states have call predecessors, (5510), 4807 states have return successors, (9346), 6140 states have call predecessors, (9346), 5507 states have call successors, (9346) [2022-12-13 17:12:00,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89539 states to 89539 states and 111224 transitions. [2022-12-13 17:12:00,910 INFO L78 Accepts]: Start accepts. Automaton has 89539 states and 111224 transitions. Word has length 192 [2022-12-13 17:12:00,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:12:00,911 INFO L495 AbstractCegarLoop]: Abstraction has 89539 states and 111224 transitions. [2022-12-13 17:12:00,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.5) internal successors, (129), 5 states have internal predecessors, (129), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-12-13 17:12:00,911 INFO L276 IsEmpty]: Start isEmpty. Operand 89539 states and 111224 transitions. [2022-12-13 17:12:00,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-12-13 17:12:00,922 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:12:00,922 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2022-12-13 17:12:00,927 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-13 17:12:01,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:12:01,124 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:12:01,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:12:01,125 INFO L85 PathProgramCache]: Analyzing trace with hash 481356149, now seen corresponding path program 1 times [2022-12-13 17:12:01,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:12:01,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065554037] [2022-12-13 17:12:01,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:12:01,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:12:01,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:01,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:12:01,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:01,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:12:01,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:01,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 17:12:01,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:01,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:12:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:01,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 17:12:01,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:01,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 17:12:01,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:01,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 17:12:01,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:01,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-12-13 17:12:01,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:01,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-12-13 17:12:01,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:01,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-12-13 17:12:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:01,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-12-13 17:12:01,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:01,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-12-13 17:12:01,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:01,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-12-13 17:12:01,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:01,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-12-13 17:12:01,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:01,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-12-13 17:12:01,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:01,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-12-13 17:12:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:01,244 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2022-12-13 17:12:01,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:12:01,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065554037] [2022-12-13 17:12:01,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065554037] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:12:01,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:12:01,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 17:12:01,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877554266] [2022-12-13 17:12:01,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:12:01,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:12:01,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:12:01,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:12:01,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:12:01,246 INFO L87 Difference]: Start difference. First operand 89539 states and 111224 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-12-13 17:12:10,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:12:10,641 INFO L93 Difference]: Finished difference Result 175158 states and 217770 transitions. [2022-12-13 17:12:10,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 17:12:10,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 199 [2022-12-13 17:12:10,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:12:10,830 INFO L225 Difference]: With dead ends: 175158 [2022-12-13 17:12:10,831 INFO L226 Difference]: Without dead ends: 93407 [2022-12-13 17:12:10,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:12:10,924 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 260 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 17:12:10,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 361 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 17:12:10,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93407 states. [2022-12-13 17:12:19,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93407 to 86265. [2022-12-13 17:12:19,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86265 states, 76422 states have (on average 1.218968359896365) internal successors, (93156), 77189 states have internal predecessors, (93156), 5239 states have call successors, (5239), 3213 states have call predecessors, (5239), 4603 states have return successors, (8972), 5862 states have call predecessors, (8972), 5236 states have call successors, (8972) [2022-12-13 17:12:19,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86265 states to 86265 states and 107367 transitions. [2022-12-13 17:12:19,639 INFO L78 Accepts]: Start accepts. Automaton has 86265 states and 107367 transitions. Word has length 199 [2022-12-13 17:12:19,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:12:19,639 INFO L495 AbstractCegarLoop]: Abstraction has 86265 states and 107367 transitions. [2022-12-13 17:12:19,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-12-13 17:12:19,639 INFO L276 IsEmpty]: Start isEmpty. Operand 86265 states and 107367 transitions. [2022-12-13 17:12:19,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-12-13 17:12:19,648 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:12:19,649 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:12:19,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-13 17:12:19,649 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:12:19,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:12:19,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1285676191, now seen corresponding path program 1 times [2022-12-13 17:12:19,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:12:19,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675760843] [2022-12-13 17:12:19,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:12:19,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:12:19,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:19,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:12:19,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:19,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:12:19,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:19,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 17:12:19,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:19,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:12:19,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:19,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 17:12:19,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:19,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 17:12:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:19,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 17:12:19,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:19,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-12-13 17:12:19,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:19,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-12-13 17:12:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:19,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-12-13 17:12:19,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:19,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-12-13 17:12:19,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:19,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-12-13 17:12:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:19,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-12-13 17:12:19,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:19,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-12-13 17:12:19,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:19,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-12-13 17:12:19,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:19,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-12-13 17:12:19,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:19,712 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2022-12-13 17:12:19,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:12:19,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675760843] [2022-12-13 17:12:19,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675760843] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:12:19,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385643636] [2022-12-13 17:12:19,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:12:19,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:12:19,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:12:19,714 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:12:19,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 17:12:19,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:19,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 17:12:19,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:12:19,841 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-12-13 17:12:19,841 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:12:19,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385643636] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:12:19,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 17:12:19,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2022-12-13 17:12:19,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563805074] [2022-12-13 17:12:19,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:12:19,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:12:19,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:12:19,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:12:19,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:12:19,843 INFO L87 Difference]: Start difference. First operand 86265 states and 107367 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-12-13 17:12:28,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:12:28,569 INFO L93 Difference]: Finished difference Result 171006 states and 215215 transitions. [2022-12-13 17:12:28,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:12:28,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 206 [2022-12-13 17:12:28,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:12:28,744 INFO L225 Difference]: With dead ends: 171006 [2022-12-13 17:12:28,744 INFO L226 Difference]: Without dead ends: 86742 [2022-12-13 17:12:28,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:12:28,841 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 116 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:12:28,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 479 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:12:28,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86742 states. [2022-12-13 17:12:36,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86742 to 86265. [2022-12-13 17:12:37,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86265 states, 76422 states have (on average 1.1987124126560416) internal successors, (91608), 77189 states have internal predecessors, (91608), 5239 states have call successors, (5239), 3213 states have call predecessors, (5239), 4603 states have return successors, (8972), 5862 states have call predecessors, (8972), 5236 states have call successors, (8972) [2022-12-13 17:12:37,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86265 states to 86265 states and 105819 transitions. [2022-12-13 17:12:37,187 INFO L78 Accepts]: Start accepts. Automaton has 86265 states and 105819 transitions. Word has length 206 [2022-12-13 17:12:37,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:12:37,187 INFO L495 AbstractCegarLoop]: Abstraction has 86265 states and 105819 transitions. [2022-12-13 17:12:37,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-12-13 17:12:37,188 INFO L276 IsEmpty]: Start isEmpty. Operand 86265 states and 105819 transitions. [2022-12-13 17:12:37,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-12-13 17:12:37,198 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:12:37,199 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:12:37,204 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-13 17:12:37,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:12:37,401 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:12:37,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:12:37,402 INFO L85 PathProgramCache]: Analyzing trace with hash 606944206, now seen corresponding path program 1 times [2022-12-13 17:12:37,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:12:37,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940539341] [2022-12-13 17:12:37,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:12:37,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:12:37,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:37,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:12:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:37,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:12:37,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:37,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 17:12:37,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:37,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:12:37,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:37,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 17:12:37,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:37,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 17:12:37,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:37,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 17:12:37,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:37,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-12-13 17:12:37,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:37,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-12-13 17:12:37,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:37,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-12-13 17:12:37,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:37,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-12-13 17:12:37,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:37,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-12-13 17:12:37,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:37,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-12-13 17:12:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:37,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 17:12:37,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:37,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-12-13 17:12:37,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:37,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-12-13 17:12:37,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:37,496 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-12-13 17:12:37,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:12:37,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940539341] [2022-12-13 17:12:37,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940539341] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:12:37,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552791746] [2022-12-13 17:12:37,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:12:37,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:12:37,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:12:37,497 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:12:37,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 17:12:37,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:12:37,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 17:12:37,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:12:37,721 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-12-13 17:12:37,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:12:37,810 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-12-13 17:12:37,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552791746] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:12:37,810 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:12:37,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 10 [2022-12-13 17:12:37,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489543838] [2022-12-13 17:12:37,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:12:37,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 17:12:37,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:12:37,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 17:12:37,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-12-13 17:12:37,811 INFO L87 Difference]: Start difference. First operand 86265 states and 105819 transitions. Second operand has 10 states, 10 states have (on average 22.9) internal successors, (229), 7 states have internal predecessors, (229), 4 states have call successors, (41), 7 states have call predecessors, (41), 3 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) [2022-12-13 17:12:52,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:12:52,336 INFO L93 Difference]: Finished difference Result 218947 states and 270594 transitions. [2022-12-13 17:12:52,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 17:12:52,337 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 22.9) internal successors, (229), 7 states have internal predecessors, (229), 4 states have call successors, (41), 7 states have call predecessors, (41), 3 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) Word has length 207 [2022-12-13 17:12:52,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:12:52,632 INFO L225 Difference]: With dead ends: 218947 [2022-12-13 17:12:52,632 INFO L226 Difference]: Without dead ends: 140569 [2022-12-13 17:12:52,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 452 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2022-12-13 17:12:52,742 INFO L413 NwaCegarLoop]: 417 mSDtfsCounter, 952 mSDsluCounter, 2075 mSDsCounter, 0 mSdLazyCounter, 2151 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 976 SdHoareTripleChecker+Valid, 2492 SdHoareTripleChecker+Invalid, 2299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 2151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 17:12:52,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [976 Valid, 2492 Invalid, 2299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 2151 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 17:12:52,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140569 states. [2022-12-13 17:13:02,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140569 to 84942. [2022-12-13 17:13:02,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84942 states, 75259 states have (on average 1.196189160100453) internal successors, (90024), 75968 states have internal predecessors, (90024), 5156 states have call successors, (5156), 3159 states have call predecessors, (5156), 4526 states have return successors, (8838), 5814 states have call predecessors, (8838), 5153 states have call successors, (8838) [2022-12-13 17:13:02,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84942 states to 84942 states and 104018 transitions. [2022-12-13 17:13:02,284 INFO L78 Accepts]: Start accepts. Automaton has 84942 states and 104018 transitions. Word has length 207 [2022-12-13 17:13:02,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:13:02,285 INFO L495 AbstractCegarLoop]: Abstraction has 84942 states and 104018 transitions. [2022-12-13 17:13:02,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.9) internal successors, (229), 7 states have internal predecessors, (229), 4 states have call successors, (41), 7 states have call predecessors, (41), 3 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) [2022-12-13 17:13:02,285 INFO L276 IsEmpty]: Start isEmpty. Operand 84942 states and 104018 transitions. [2022-12-13 17:13:02,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-12-13 17:13:02,295 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:13:02,295 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:13:02,300 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-13 17:13:02,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-12-13 17:13:02,497 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:13:02,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:13:02,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1856947114, now seen corresponding path program 1 times [2022-12-13 17:13:02,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:13:02,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994074199] [2022-12-13 17:13:02,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:13:02,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:13:02,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:13:02,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:13:02,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:13:02,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:13:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:13:02,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 17:13:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:13:02,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:13:02,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:13:02,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 17:13:02,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:13:02,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-12-13 17:13:02,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:13:02,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 17:13:02,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:13:02,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 17:13:02,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:13:02,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 17:13:02,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:13:02,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-12-13 17:13:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:13:02,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-12-13 17:13:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:13:02,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-12-13 17:13:02,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:13:02,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-12-13 17:13:02,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:13:02,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-12-13 17:13:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:13:02,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-12-13 17:13:02,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:13:02,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-12-13 17:13:02,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:13:02,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 17:13:02,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:13:02,599 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-12-13 17:13:02,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:13:02,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994074199] [2022-12-13 17:13:02,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994074199] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:13:02,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:13:02,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 17:13:02,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978603435] [2022-12-13 17:13:02,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:13:02,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 17:13:02,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:13:02,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 17:13:02,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:13:02,600 INFO L87 Difference]: Start difference. First operand 84942 states and 104018 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 4 states have internal predecessors, (115), 4 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-12-13 17:13:13,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:13:13,055 INFO L93 Difference]: Finished difference Result 146457 states and 179228 transitions. [2022-12-13 17:13:13,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 17:13:13,056 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 4 states have internal predecessors, (115), 4 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 213 [2022-12-13 17:13:13,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:13:13,221 INFO L225 Difference]: With dead ends: 146457 [2022-12-13 17:13:13,222 INFO L226 Difference]: Without dead ends: 89972 [2022-12-13 17:13:13,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-12-13 17:13:13,295 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 641 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 17:13:13,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 880 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 17:13:13,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89972 states. [2022-12-13 17:13:22,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89972 to 83000. [2022-12-13 17:13:22,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83000 states, 73587 states have (on average 1.1952790574422112) internal successors, (87957), 74289 states have internal predecessors, (87957), 5004 states have call successors, (5004), 3059 states have call predecessors, (5004), 4408 states have return successors, (8643), 5651 states have call predecessors, (8643), 5001 states have call successors, (8643) [2022-12-13 17:13:22,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83000 states to 83000 states and 101604 transitions. [2022-12-13 17:13:22,313 INFO L78 Accepts]: Start accepts. Automaton has 83000 states and 101604 transitions. Word has length 213 [2022-12-13 17:13:22,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:13:22,314 INFO L495 AbstractCegarLoop]: Abstraction has 83000 states and 101604 transitions. [2022-12-13 17:13:22,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 4 states have internal predecessors, (115), 4 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-12-13 17:13:22,314 INFO L276 IsEmpty]: Start isEmpty. Operand 83000 states and 101604 transitions. [2022-12-13 17:13:22,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2022-12-13 17:13:22,324 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:13:22,324 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:13:22,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-13 17:13:22,324 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:13:22,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:13:22,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1665637853, now seen corresponding path program 1 times [2022-12-13 17:13:22,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:13:22,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689392896] [2022-12-13 17:13:22,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:13:22,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:13:22,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:13:22,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 17:13:22,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:13:22,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:13:22,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:13:22,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 17:13:22,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:13:22,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:13:22,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:13:22,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 17:13:22,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:13:22,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-12-13 17:13:22,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:13:22,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 17:13:22,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:13:22,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-12-13 17:13:22,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:13:22,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-12-13 17:13:22,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:13:22,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-12-13 17:13:22,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:13:22,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-12-13 17:13:22,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:13:22,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-12-13 17:13:22,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:13:22,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-12-13 17:13:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:13:22,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 17:13:22,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:13:22,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-12-13 17:13:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:13:22,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-12-13 17:13:22,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:13:22,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-12-13 17:13:22,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:13:22,371 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2022-12-13 17:13:22,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:13:22,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689392896] [2022-12-13 17:13:22,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689392896] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:13:22,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:13:22,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 17:13:22,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76450050] [2022-12-13 17:13:22,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:13:22,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:13:22,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:13:22,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:13:22,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:13:22,373 INFO L87 Difference]: Start difference. First operand 83000 states and 101604 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-12-13 17:13:33,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:13:33,163 INFO L93 Difference]: Finished difference Result 175772 states and 215293 transitions. [2022-12-13 17:13:33,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 17:13:33,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 217 [2022-12-13 17:13:33,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:13:33,352 INFO L225 Difference]: With dead ends: 175772 [2022-12-13 17:13:33,352 INFO L226 Difference]: Without dead ends: 94405 [2022-12-13 17:13:33,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-13 17:13:33,454 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 389 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 17:13:33,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 432 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 17:13:33,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94405 states. [2022-12-13 17:13:43,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94405 to 85538. [2022-12-13 17:13:43,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85538 states, 75643 states have (on average 1.18904591303888) internal successors, (89943), 76428 states have internal predecessors, (89943), 5241 states have call successors, (5241), 3202 states have call predecessors, (5241), 4653 states have return successors, (9144), 5907 states have call predecessors, (9144), 5238 states have call successors, (9144) [2022-12-13 17:13:43,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85538 states to 85538 states and 104328 transitions. [2022-12-13 17:13:43,389 INFO L78 Accepts]: Start accepts. Automaton has 85538 states and 104328 transitions. Word has length 217 [2022-12-13 17:13:43,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:13:43,389 INFO L495 AbstractCegarLoop]: Abstraction has 85538 states and 104328 transitions. [2022-12-13 17:13:43,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-12-13 17:13:43,389 INFO L276 IsEmpty]: Start isEmpty. Operand 85538 states and 104328 transitions. [2022-12-13 17:13:43,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2022-12-13 17:13:43,399 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:13:43,399 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:13:43,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-13 17:13:43,399 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:13:43,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:13:43,399 INFO L85 PathProgramCache]: Analyzing trace with hash 986971407, now seen corresponding path program 1 times [2022-12-13 17:13:43,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:13:43,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578533017] [2022-12-13 17:13:43,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:13:43,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:13:43,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:13:43,412 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:13:43,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:13:43,502 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:13:43,502 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 17:13:43,503 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-13 17:13:43,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-13 17:13:43,507 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:13:43,510 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 17:13:43,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 05:13:43 BoogieIcfgContainer [2022-12-13 17:13:43,632 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 17:13:43,632 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 17:13:43,632 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 17:13:43,633 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 17:13:43,633 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:05:50" (3/4) ... [2022-12-13 17:13:43,635 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 17:13:43,724 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 17:13:43,724 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 17:13:43,725 INFO L158 Benchmark]: Toolchain (without parser) took 473791.77ms. Allocated memory was 125.8MB in the beginning and 8.6GB in the end (delta: 8.5GB). Free memory was 92.5MB in the beginning and 5.5GB in the end (delta: -5.4GB). Peak memory consumption was 3.1GB. Max. memory is 16.1GB. [2022-12-13 17:13:43,725 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 94.4MB. Free memory is still 47.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 17:13:43,725 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.64ms. Allocated memory is still 125.8MB. Free memory was 92.1MB in the beginning and 78.3MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-13 17:13:43,725 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.31ms. Allocated memory is still 125.8MB. Free memory was 78.3MB in the beginning and 75.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 17:13:43,726 INFO L158 Benchmark]: Boogie Preprocessor took 22.21ms. Allocated memory is still 125.8MB. Free memory was 75.8MB in the beginning and 74.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 17:13:43,726 INFO L158 Benchmark]: RCFGBuilder took 423.00ms. Allocated memory is still 125.8MB. Free memory was 74.1MB in the beginning and 94.4MB in the end (delta: -20.3MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. [2022-12-13 17:13:43,726 INFO L158 Benchmark]: TraceAbstraction took 472972.45ms. Allocated memory was 125.8MB in the beginning and 8.6GB in the end (delta: 8.5GB). Free memory was 93.6MB in the beginning and 5.5GB in the end (delta: -5.4GB). Peak memory consumption was 3.0GB. Max. memory is 16.1GB. [2022-12-13 17:13:43,726 INFO L158 Benchmark]: Witness Printer took 92.03ms. Allocated memory is still 8.6GB. Free memory was 5.5GB in the beginning and 5.5GB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-12-13 17:13:43,727 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 94.4MB. Free memory is still 47.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 234.64ms. Allocated memory is still 125.8MB. Free memory was 92.1MB in the beginning and 78.3MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.31ms. Allocated memory is still 125.8MB. Free memory was 78.3MB in the beginning and 75.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.21ms. Allocated memory is still 125.8MB. Free memory was 75.8MB in the beginning and 74.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 423.00ms. Allocated memory is still 125.8MB. Free memory was 74.1MB in the beginning and 94.4MB in the end (delta: -20.3MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. * TraceAbstraction took 472972.45ms. Allocated memory was 125.8MB in the beginning and 8.6GB in the end (delta: 8.5GB). Free memory was 93.6MB in the beginning and 5.5GB in the end (delta: -5.4GB). Peak memory consumption was 3.0GB. Max. memory is 16.1GB. * Witness Printer took 92.03ms. Allocated memory is still 8.6GB. Free memory was 5.5GB in the beginning and 5.5GB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. 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 P_2_pc ; [L133] int P_2_st ; [L134] int P_2_i ; [L135] int P_2_ev ; [L200] int C_1_pc ; [L201] int C_1_st ; [L202] int C_1_i ; [L203] int C_1_ev ; [L204] 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, P_2_ev=0, P_2_i=0, P_2_pc=0, P_2_st=0, timer=0] [L603] int count ; [L604] int __retres2 ; [L608] num = 0 [L609] i = 0 [L610] max_loop = 2 [L612] timer = 0 [L613] P_1_pc = 0 [L614] P_2_pc = 0 [L615] C_1_pc = 0 [L617] count = 0 [L618] CALL init_model() [L595] P_1_i = 1 [L596] P_2_i = 1 [L597] 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, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L618] RET init_model() [L619] CALL start_simulation() [L533] int kernel_st ; [L534] int tmp ; [L535] int tmp___0 ; [L539] 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, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L540] 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, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L541] CALL init_threads() [L304] COND TRUE (int )P_1_i == 1 [L305] 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, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L309] COND TRUE (int )P_2_i == 1 [L310] P_2_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, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L314] COND TRUE (int )C_1_i == 1 [L315] 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, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L541] RET init_threads() [L542] 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, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L543] CALL activate_threads() VAL [\old(C_1_st)=0, \old(P_1_st)=0, \old(P_2_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, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L469] int tmp ; [L470] int tmp___0 ; [L471] int tmp___1 ; [L475] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [\old(C_1_st)=0, \old(P_1_st)=0, \old(P_2_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, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L117] COND FALSE !((int )P_1_pc == 1) VAL [\old(C_1_st)=0, \old(P_1_st)=0, \old(P_2_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, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L127] __retres1 = 0 VAL [\old(C_1_st)=0, \old(P_1_st)=0, \old(P_2_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, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L129] return (__retres1); VAL [\old(C_1_st)=0, \old(P_1_st)=0, \old(P_2_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, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L475] RET, EXPR is_P_1_triggered() [L475] tmp = is_P_1_triggered() [L477] COND FALSE !(\read(tmp)) VAL [\old(C_1_st)=0, \old(P_1_st)=0, \old(P_2_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, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0, tmp=0] [L483] CALL, EXPR is_P_2_triggered() [L182] int __retres1 ; VAL [\old(C_1_st)=0, \old(P_1_st)=0, \old(P_2_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, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L185] COND FALSE !((int )P_2_pc == 1) VAL [\old(C_1_st)=0, \old(P_1_st)=0, \old(P_2_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, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L195] __retres1 = 0 VAL [\old(C_1_st)=0, \old(P_1_st)=0, \old(P_2_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, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L197] return (__retres1); VAL [\old(C_1_st)=0, \old(P_1_st)=0, \old(P_2_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, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L483] RET, EXPR is_P_2_triggered() [L483] tmp___0 = is_P_2_triggered() [L485] COND FALSE !(\read(tmp___0)) VAL [\old(C_1_st)=0, \old(P_1_st)=0, \old(P_2_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, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0, tmp=0, tmp___0=0] [L491] CALL, EXPR is_C_1_triggered() [L264] int __retres1 ; VAL [\old(C_1_st)=0, \old(P_1_st)=0, \old(P_2_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, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L267] COND FALSE !((int )C_1_pc == 1) VAL [\old(C_1_st)=0, \old(P_1_st)=0, \old(P_2_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, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L277] COND FALSE !((int )C_1_pc == 2) VAL [\old(C_1_st)=0, \old(P_1_st)=0, \old(P_2_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, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L287] __retres1 = 0 VAL [\old(C_1_st)=0, \old(P_1_st)=0, \old(P_2_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, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L289] return (__retres1); VAL [\old(C_1_st)=0, \old(P_1_st)=0, \old(P_2_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, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L491] RET, EXPR is_C_1_triggered() [L491] tmp___1 = is_C_1_triggered() [L493] COND FALSE !(\read(tmp___1)) VAL [\old(C_1_st)=0, \old(P_1_st)=0, \old(P_2_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, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0, tmp=0, tmp___0=0, tmp___1=0] [L543] 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, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L544] 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, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L547] 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, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L550] kernel_st = 1 [L551] CALL eval() [L349] int tmp ; [L350] int tmp___0 ; [L351] int tmp___1 ; [L352] 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, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L356] 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, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L359] 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, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L324] 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, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L327] COND TRUE (int )P_1_st == 0 [L328] __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, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L345] 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, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L359] 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, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L359] tmp___2 = exists_runnable_thread() [L361] 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, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0, tmp___2=1] [L366] COND TRUE (int )P_1_st == 0 [L368] tmp = __VERIFIER_nondet_int() [L370] COND TRUE \read(tmp) [L372] P_1_st = 1 [L373] CALL P_1() [L82] COND TRUE (int )P_1_pc == 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=1, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L93] 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=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=1, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L96] CALL write_data(num, 'A') VAL [\old(c)=65, \old(data_0)=0, \old(data_1)=0, \old(i___0)=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=1, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L59] COND TRUE i___0 == 0 [L60] data_0 = c VAL [\old(c)=65, \old(data_0)=0, \old(data_1)=0, \old(i___0)=0, c=65, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, i___0=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L96] RET write_data(num, 'A') VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, 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=1, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [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=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L373] RET P_1() [L381] COND TRUE (int )P_2_st == 0 [L383] tmp___0 = __VERIFIER_nondet_int() [L385] COND TRUE \read(tmp___0) [L387] P_2_st = 1 [L388] CALL P_2() [L140] COND TRUE (int )P_2_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L151] 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=0, data_0=65, data_1=0, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L154] CALL write_data(num, 'B') VAL [\old(c)=66, \old(data_0)=65, \old(data_1)=0, \old(i___0)=1, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L59] COND FALSE !(i___0 == 0) VAL [\old(c)=66, \old(data_0)=65, \old(data_1)=0, \old(i___0)=1, c=66, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, i___0=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L62] COND TRUE i___0 == 1 [L63] data_1 = c VAL [\old(c)=66, \old(data_0)=65, \old(data_1)=0, \old(i___0)=1, c=66, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=0, i___0=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L154] RET write_data(num, 'B') VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L155] num += 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L157] COND FALSE !(\read(timer)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L167] P_2_pc = 1 [L168] P_2_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L388] RET P_2() [L396] COND TRUE (int )C_1_st == 0 [L398] tmp___1 = __VERIFIER_nondet_int() [L400] COND TRUE \read(tmp___1) [L402] C_1_st = 1 [L403] CALL C_1() [L206] 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=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L209] 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=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L224] 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=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L226] COND FALSE !(num == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L237] num -= 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L238] COND FALSE !(! (num >= 0)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L246] CALL, EXPR read_data(num) [L33] char c ; [L34] char __retres3 ; VAL [\old(i___0)=1, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, i___0=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L37] COND FALSE !(i___0 == 0) VAL [\old(i___0)=1, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, i___0=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L41] COND TRUE i___0 == 1 [L42] __retres3 = data_1 VAL [\old(i___0)=1, __retres3=66, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, i___0=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L52] return (__retres3); VAL [\old(i___0)=1, \result=66, __retres3=66, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, i___0=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L246] RET, EXPR read_data(num) [L246] c = read_data(num) [L247] i += 1 [L248] C_1_pc = 2 [L249] C_1_st = 2 VAL [c=66, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L403] RET C_1() [L356] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=-1, tmp___0=-2, tmp___1=1, tmp___2=1] [L359] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L324] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L327] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L331] COND FALSE !((int )P_2_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L335] COND FALSE !((int )C_1_st == 0) [L343] __retres1 = 0 VAL [__retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L345] return (__retres1); VAL [\result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L359] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=-1, tmp___0=-2, tmp___1=1, tmp___2=1] [L359] tmp___2 = exists_runnable_thread() [L361] COND FALSE !(\read(tmp___2)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=-1, tmp___0=-2, tmp___1=1, tmp___2=0] [L551] RET eval() [L554] kernel_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L555] FCALL update_channels() VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L558] kernel_st = 3 VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L559] FCALL fire_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L560] CALL activate_threads() VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L469] int tmp ; [L470] int tmp___0 ; [L471] int tmp___1 ; [L475] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L117] COND TRUE (int )P_1_pc == 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L118] COND FALSE !((int )P_1_ev == 1) VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L127] __retres1 = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L129] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L475] RET, EXPR is_P_1_triggered() [L475] tmp = is_P_1_triggered() [L477] COND FALSE !(\read(tmp)) VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=0] [L483] CALL, EXPR is_P_2_triggered() [L182] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L185] COND TRUE (int )P_2_pc == 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L186] COND FALSE !((int )P_2_ev == 1) VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L195] __retres1 = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L197] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L483] RET, EXPR is_P_2_triggered() [L483] tmp___0 = is_P_2_triggered() [L485] COND FALSE !(\read(tmp___0)) VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=0, tmp___0=0] [L491] CALL, EXPR is_C_1_triggered() [L264] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L267] COND FALSE !((int )C_1_pc == 1) VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L277] COND TRUE (int )C_1_pc == 2 VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L278] COND FALSE !((int )C_1_ev == 1) VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L287] __retres1 = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L289] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L491] RET, EXPR is_C_1_triggered() [L491] tmp___1 = is_C_1_triggered() [L493] COND FALSE !(\read(tmp___1)) VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=0, tmp___0=0, tmp___1=0] [L560] RET activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L561] FCALL reset_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L564] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L324] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L327] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L331] COND FALSE !((int )P_2_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L335] COND FALSE !((int )C_1_st == 0) [L343] __retres1 = 0 VAL [__retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L345] return (__retres1); VAL [\result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L564] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L564] tmp = exists_runnable_thread() [L566] COND TRUE tmp == 0 [L568] kernel_st = 4 [L569] CALL fire_time_events() [L438] C_1_ev = 1 [L439] P_1_ev = 1 [L440] P_2_ev = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L569] RET fire_time_events() [L570] CALL activate_threads() VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L469] int tmp ; [L470] int tmp___0 ; [L471] int tmp___1 ; [L475] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L117] COND TRUE (int )P_1_pc == 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L118] COND TRUE (int )P_1_ev == 1 [L119] __retres1 = 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L129] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, \result=1, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L475] RET, EXPR is_P_1_triggered() [L475] tmp = is_P_1_triggered() [L477] COND TRUE \read(tmp) [L478] P_1_st = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=1] [L483] CALL, EXPR is_P_2_triggered() [L182] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L185] COND TRUE (int )P_2_pc == 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L186] COND TRUE (int )P_2_ev == 1 [L187] __retres1 = 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L197] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, \result=1, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L483] RET, EXPR is_P_2_triggered() [L483] tmp___0 = is_P_2_triggered() [L485] COND TRUE \read(tmp___0) [L486] P_2_st = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=1, tmp___0=1] [L491] CALL, EXPR is_C_1_triggered() [L264] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L267] COND FALSE !((int )C_1_pc == 1) VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L277] COND TRUE (int )C_1_pc == 2 VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L278] COND TRUE (int )C_1_ev == 1 [L279] __retres1 = 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L289] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, \result=1, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, 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, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L491] RET, EXPR is_C_1_triggered() [L491] tmp___1 = is_C_1_triggered() [L493] COND TRUE \read(tmp___1) [L494] C_1_st = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, \old(P_2_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, 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, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=1, tmp___0=1, tmp___1=1] [L570] RET activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, 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, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=0] [L571] CALL reset_time_events() [L449] COND TRUE (int )P_1_ev == 1 [L450] P_1_ev = 2 VAL [C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, 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, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L454] COND TRUE (int )P_2_ev == 1 [L455] P_2_ev = 2 VAL [C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, 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, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L459] COND TRUE (int )C_1_ev == 1 [L460] C_1_ev = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, 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, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L571] RET reset_time_events() [L577] CALL, EXPR stop_simulation() [L514] int tmp ; [L515] int __retres2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, 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, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L519] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, 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, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L324] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, 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, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L327] COND TRUE (int )P_1_st == 0 [L328] __retres1 = 1 VAL [__retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, 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, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L345] return (__retres1); VAL [\result=1, __retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, 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, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L519] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, 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, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L519] tmp = exists_runnable_thread() [L521] COND TRUE \read(tmp) [L522] __retres2 = 0 VAL [__retres2=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, 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, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=1] [L529] return (__retres2); VAL [\result=0, __retres2=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, 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, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=1] [L577] RET, EXPR stop_simulation() [L577] tmp___0 = stop_simulation() [L579] COND FALSE !(\read(tmp___0)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, 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, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=0, tmp___0=0] [L547] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, 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, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=0, tmp___0=0] [L550] kernel_st = 1 [L551] CALL eval() [L349] int tmp ; [L350] int tmp___0 ; [L351] int tmp___1 ; [L352] int tmp___2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, 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, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L356] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, 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, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L359] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, 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, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L324] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, 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, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L327] COND TRUE (int )P_1_st == 0 [L328] __retres1 = 1 VAL [__retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, 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, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L345] return (__retres1); VAL [\result=1, __retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, 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, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L359] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, 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, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L359] tmp___2 = exists_runnable_thread() [L361] COND TRUE \read(tmp___2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, 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, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp___2=1] [L366] COND TRUE (int )P_1_st == 0 [L368] tmp = __VERIFIER_nondet_int() [L370] COND TRUE \read(tmp) [L372] P_1_st = 1 [L373] CALL P_1() [L82] COND FALSE !((int )P_1_pc == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, 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, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L85] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, 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, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L93] COND TRUE i < max_loop VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, 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, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L96] CALL write_data(num, 'A') VAL [\old(c)=65, \old(data_0)=65, \old(data_1)=66, \old(i___0)=1, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, 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, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L59] COND FALSE !(i___0 == 0) VAL [\old(c)=65, \old(data_0)=65, \old(data_1)=66, \old(i___0)=1, c=65, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, 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, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L62] COND TRUE i___0 == 1 [L63] data_1 = c VAL [\old(c)=65, \old(data_0)=65, \old(data_1)=66, \old(i___0)=1, c=65, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, 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, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L96] RET write_data(num, 'A') VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, 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, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [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=2, C_1_pr=0, C_1_st=0, 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, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L373] RET P_1() [L381] COND TRUE (int )P_2_st == 0 [L383] tmp___0 = __VERIFIER_nondet_int() [L385] COND TRUE \read(tmp___0) [L387] P_2_st = 1 [L388] CALL P_2() [L140] COND FALSE !((int )P_2_pc == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, 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, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] [L143] COND TRUE (int )P_2_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, 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, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] [L151] COND TRUE i < max_loop VAL [C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, 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, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] [L154] CALL write_data(num, 'B') VAL [\old(c)=66, \old(data_0)=65, \old(data_1)=65, \old(i___0)=2, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, 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, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] [L59] COND FALSE !(i___0 == 0) VAL [\old(c)=66, \old(data_0)=65, \old(data_1)=65, \old(i___0)=2, c=66, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, 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=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] [L62] COND FALSE !(i___0 == 1) VAL [\old(c)=66, \old(data_0)=65, \old(data_1)=65, \old(i___0)=2, c=66, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, 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=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] [L66] CALL error() VAL [\old(data_0)=65, \old(data_1)=65, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, 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, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] [L19] reach_error() VAL [\old(data_0)=65, \old(data_1)=65, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, 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, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 134 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 472.8s, OverallIterations: 36, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 242.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13667 SdHoareTripleChecker+Valid, 7.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13338 mSDsluCounter, 25876 SdHoareTripleChecker+Invalid, 6.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17540 mSDsCounter, 1909 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11561 IncrementalHoareTripleChecker+Invalid, 13470 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1909 mSolverCounterUnsat, 8336 mSDtfsCounter, 11561 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3678 GetRequests, 3321 SyntacticMatches, 9 SemanticMatches, 348 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=240163occurred in iteration=27, InterpolantAutomatonStates: 316, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 221.1s AutomataMinimizationTime, 35 MinimizatonAttempts, 134648 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 6601 NumberOfCodeBlocks, 6601 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 6703 ConstructedInterpolants, 0 QuantifiedInterpolants, 12488 SizeOfPredicates, 8 NumberOfNonLiveVariables, 6639 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 52 InterpolantComputations, 34 PerfectInterpolantSequences, 3450/3659 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 17:13:43,740 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327387b8-981f-4fca-88f6-2179b10cfc03/bin/uautomizer-uyxdKDjOR8/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