./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aef121e0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/config/TaipanReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a30aa210ed4a7c8ee647a70aef136aef282e5eccb07388ecda6495e33bc30b6d --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-23 02:21:54,786 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 02:21:54,789 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 02:21:54,845 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 02:21:54,846 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 02:21:54,851 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 02:21:54,853 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 02:21:54,857 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 02:21:54,860 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 02:21:54,866 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 02:21:54,867 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 02:21:54,869 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 02:21:54,870 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 02:21:54,873 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 02:21:54,875 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 02:21:54,881 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 02:21:54,883 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 02:21:54,885 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 02:21:54,889 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 02:21:54,897 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 02:21:54,899 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 02:21:54,900 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 02:21:54,904 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 02:21:54,905 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 02:21:54,914 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 02:21:54,915 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 02:21:54,916 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 02:21:54,918 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 02:21:54,919 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 02:21:54,920 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 02:21:54,921 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 02:21:54,922 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 02:21:54,925 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 02:21:54,926 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 02:21:54,928 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 02:21:54,928 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 02:21:54,929 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 02:21:54,930 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 02:21:54,930 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 02:21:54,931 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 02:21:54,932 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 02:21:54,933 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-23 02:21:54,982 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 02:21:54,982 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 02:21:54,983 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 02:21:54,983 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 02:21:54,985 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-23 02:21:54,985 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-23 02:21:54,985 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-23 02:21:54,986 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-23 02:21:54,986 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-23 02:21:54,986 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-23 02:21:54,987 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-23 02:21:54,988 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-23 02:21:54,988 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-23 02:21:54,988 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-23 02:21:54,989 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-23 02:21:54,989 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-23 02:21:54,989 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-23 02:21:54,989 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-23 02:21:54,991 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 02:21:54,991 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 02:21:54,991 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 02:21:54,991 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 02:21:54,992 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 02:21:54,992 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-23 02:21:54,992 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 02:21:54,992 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-23 02:21:54,994 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 02:21:54,994 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 02:21:54,995 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 02:21:54,995 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-23 02:21:54,995 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 02:21:54,996 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-23 02:21:54,996 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 02:21:54,996 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 02:21:54,996 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 02:21:54,997 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-23 02:21:54,997 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-23 02:21:54,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 02:21:54,997 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-23 02:21:54,998 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 02:21:54,998 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-23 02:21:54,998 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/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_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V 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 -> Taipan 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 -> a30aa210ed4a7c8ee647a70aef136aef282e5eccb07388ecda6495e33bc30b6d [2021-11-23 02:21:55,282 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 02:21:55,303 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 02:21:55,306 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 02:21:55,307 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 02:21:55,308 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 02:21:55,309 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2021-11-23 02:21:55,370 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/data/5640abf28/254607a10afb4139b9935687c43fae83/FLAGce22111fa [2021-11-23 02:21:55,968 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 02:21:55,969 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2021-11-23 02:21:55,987 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/data/5640abf28/254607a10afb4139b9935687c43fae83/FLAGce22111fa [2021-11-23 02:21:56,229 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/data/5640abf28/254607a10afb4139b9935687c43fae83 [2021-11-23 02:21:56,232 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 02:21:56,234 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 02:21:56,235 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 02:21:56,236 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 02:21:56,240 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 02:21:56,241 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:21:56" (1/1) ... [2021-11-23 02:21:56,242 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74b4f9f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:21:56, skipping insertion in model container [2021-11-23 02:21:56,242 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:21:56" (1/1) ... [2021-11-23 02:21:56,250 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 02:21:56,288 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 02:21:56,574 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c[14540,14553] [2021-11-23 02:21:56,577 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 02:21:56,587 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 02:21:56,699 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c[14540,14553] [2021-11-23 02:21:56,700 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 02:21:56,725 INFO L208 MainTranslator]: Completed translation [2021-11-23 02:21:56,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:21:56 WrapperNode [2021-11-23 02:21:56,726 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 02:21:56,728 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 02:21:56,728 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 02:21:56,728 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 02:21:56,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:21:56" (1/1) ... [2021-11-23 02:21:56,750 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:21:56" (1/1) ... [2021-11-23 02:21:56,795 INFO L137 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 533 [2021-11-23 02:21:56,795 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 02:21:56,796 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 02:21:56,796 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 02:21:56,797 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 02:21:56,805 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:21:56" (1/1) ... [2021-11-23 02:21:56,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:21:56" (1/1) ... [2021-11-23 02:21:56,812 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:21:56" (1/1) ... [2021-11-23 02:21:56,812 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:21:56" (1/1) ... [2021-11-23 02:21:56,825 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:21:56" (1/1) ... [2021-11-23 02:21:56,833 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:21:56" (1/1) ... [2021-11-23 02:21:56,845 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:21:56" (1/1) ... [2021-11-23 02:21:56,851 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 02:21:56,852 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 02:21:56,853 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 02:21:56,853 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 02:21:56,854 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:21:56" (1/1) ... [2021-11-23 02:21:56,862 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 02:21:56,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:21:56,893 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-23 02:21:56,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-23 02:21:56,950 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2021-11-23 02:21:56,951 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2021-11-23 02:21:56,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 02:21:56,951 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2021-11-23 02:21:56,951 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2021-11-23 02:21:56,951 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2021-11-23 02:21:56,951 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2021-11-23 02:21:56,951 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2021-11-23 02:21:56,951 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2021-11-23 02:21:56,952 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-23 02:21:56,952 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-23 02:21:56,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 02:21:56,952 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2021-11-23 02:21:56,952 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2021-11-23 02:21:56,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 02:21:56,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 02:21:56,953 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2021-11-23 02:21:56,953 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2021-11-23 02:21:57,062 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 02:21:57,067 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 02:21:57,678 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 02:21:57,907 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 02:21:57,907 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-23 02:21:57,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:21:57 BoogieIcfgContainer [2021-11-23 02:21:57,910 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 02:21:57,912 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-23 02:21:57,913 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-23 02:21:57,916 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-23 02:21:57,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:21:56" (1/3) ... [2021-11-23 02:21:57,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@417172ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:21:57, skipping insertion in model container [2021-11-23 02:21:57,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:21:56" (2/3) ... [2021-11-23 02:21:57,918 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@417172ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:21:57, skipping insertion in model container [2021-11-23 02:21:57,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:21:57" (3/3) ... [2021-11-23 02:21:57,920 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2021-11-23 02:21:57,926 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-23 02:21:57,926 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-23 02:21:57,984 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-23 02:21:57,992 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-23 02:21:57,992 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-23 02:21:58,016 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 104 states have (on average 1.5288461538461537) internal successors, (159), 105 states have internal predecessors, (159), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2021-11-23 02:21:58,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-23 02:21:58,023 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:21:58,023 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:21:58,024 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:21:58,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:21:58,030 INFO L85 PathProgramCache]: Analyzing trace with hash -301559937, now seen corresponding path program 1 times [2021-11-23 02:21:58,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:21:58,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852724648] [2021-11-23 02:21:58,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:21:58,041 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:21:58,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:21:58,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:21:58,468 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:21:58,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852724648] [2021-11-23 02:21:58,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852724648] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:21:58,470 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:21:58,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 02:21:58,472 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222339523] [2021-11-23 02:21:58,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:21:58,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 02:21:58,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:21:58,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 02:21:58,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 02:21:58,521 INFO L87 Difference]: Start difference. First operand has 144 states, 104 states have (on average 1.5288461538461537) internal successors, (159), 105 states have internal predecessors, (159), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-23 02:21:58,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:21:58,709 INFO L93 Difference]: Finished difference Result 289 states and 469 transitions. [2021-11-23 02:21:58,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 02:21:58,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-11-23 02:21:58,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:21:58,730 INFO L225 Difference]: With dead ends: 289 [2021-11-23 02:21:58,730 INFO L226 Difference]: Without dead ends: 147 [2021-11-23 02:21:58,735 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 02:21:58,739 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 5 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:21:58,740 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 599 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:21:58,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-11-23 02:21:58,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2021-11-23 02:21:58,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 107 states have (on average 1.4953271028037383) internal successors, (160), 107 states have internal predecessors, (160), 31 states have call successors, (31), 8 states have call predecessors, (31), 8 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2021-11-23 02:21:58,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 222 transitions. [2021-11-23 02:21:58,828 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 222 transitions. Word has length 19 [2021-11-23 02:21:58,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:21:58,829 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 222 transitions. [2021-11-23 02:21:58,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-23 02:21:58,830 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 222 transitions. [2021-11-23 02:21:58,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-23 02:21:58,835 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:21:58,835 INFO L514 BasicCegarLoop]: 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] [2021-11-23 02:21:58,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-23 02:21:58,837 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:21:58,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:21:58,842 INFO L85 PathProgramCache]: Analyzing trace with hash 292308684, now seen corresponding path program 1 times [2021-11-23 02:21:58,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:21:58,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925534550] [2021-11-23 02:21:58,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:21:58,843 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:21:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:21:59,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 02:21:59,050 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:21:59,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925534550] [2021-11-23 02:21:59,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925534550] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:21:59,051 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:21:59,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 02:21:59,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085254961] [2021-11-23 02:21:59,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:21:59,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 02:21:59,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:21:59,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 02:21:59,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 02:21:59,055 INFO L87 Difference]: Start difference. First operand 147 states and 222 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-23 02:21:59,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:21:59,188 INFO L93 Difference]: Finished difference Result 296 states and 447 transitions. [2021-11-23 02:21:59,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 02:21:59,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2021-11-23 02:21:59,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:21:59,192 INFO L225 Difference]: With dead ends: 296 [2021-11-23 02:21:59,193 INFO L226 Difference]: Without dead ends: 152 [2021-11-23 02:21:59,194 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 02:21:59,196 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 6 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:21:59,197 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 611 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:21:59,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-11-23 02:21:59,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2021-11-23 02:21:59,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 111 states have (on average 1.4774774774774775) internal successors, (164), 111 states have internal predecessors, (164), 31 states have call successors, (31), 9 states have call predecessors, (31), 9 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2021-11-23 02:21:59,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 226 transitions. [2021-11-23 02:21:59,228 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 226 transitions. Word has length 28 [2021-11-23 02:21:59,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:21:59,228 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 226 transitions. [2021-11-23 02:21:59,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-23 02:21:59,229 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 226 transitions. [2021-11-23 02:21:59,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-23 02:21:59,231 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:21:59,232 INFO L514 BasicCegarLoop]: 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] [2021-11-23 02:21:59,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-23 02:21:59,233 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:21:59,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:21:59,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1382943625, now seen corresponding path program 1 times [2021-11-23 02:21:59,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:21:59,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604206308] [2021-11-23 02:21:59,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:21:59,261 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:21:59,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:21:59,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 02:21:59,399 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:21:59,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604206308] [2021-11-23 02:21:59,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604206308] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:21:59,400 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:21:59,400 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 02:21:59,401 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387023955] [2021-11-23 02:21:59,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:21:59,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 02:21:59,402 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:21:59,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 02:21:59,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 02:21:59,403 INFO L87 Difference]: Start difference. First operand 152 states and 226 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-23 02:21:59,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:21:59,546 INFO L93 Difference]: Finished difference Result 306 states and 458 transitions. [2021-11-23 02:21:59,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 02:21:59,547 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 36 [2021-11-23 02:21:59,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:21:59,553 INFO L225 Difference]: With dead ends: 306 [2021-11-23 02:21:59,553 INFO L226 Difference]: Without dead ends: 157 [2021-11-23 02:21:59,555 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 02:21:59,561 INFO L933 BasicCegarLoop]: 202 mSDtfsCounter, 6 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:21:59,562 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 597 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:21:59,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-11-23 02:21:59,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2021-11-23 02:21:59,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 115 states have (on average 1.4608695652173913) internal successors, (168), 115 states have internal predecessors, (168), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2021-11-23 02:21:59,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 230 transitions. [2021-11-23 02:21:59,585 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 230 transitions. Word has length 36 [2021-11-23 02:21:59,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:21:59,586 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 230 transitions. [2021-11-23 02:21:59,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-23 02:21:59,587 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 230 transitions. [2021-11-23 02:21:59,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-23 02:21:59,589 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:21:59,589 INFO L514 BasicCegarLoop]: 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] [2021-11-23 02:21:59,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-23 02:21:59,590 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:21:59,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:21:59,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1786441123, now seen corresponding path program 1 times [2021-11-23 02:21:59,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:21:59,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245069468] [2021-11-23 02:21:59,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:21:59,592 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:21:59,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:21:59,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 02:21:59,750 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:21:59,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245069468] [2021-11-23 02:21:59,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245069468] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:21:59,750 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:21:59,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 02:21:59,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833656642] [2021-11-23 02:21:59,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:21:59,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 02:21:59,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:21:59,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 02:21:59,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 02:21:59,753 INFO L87 Difference]: Start difference. First operand 157 states and 230 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-23 02:21:59,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:21:59,845 INFO L93 Difference]: Finished difference Result 316 states and 466 transitions. [2021-11-23 02:21:59,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 02:21:59,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (7), 3 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 44 [2021-11-23 02:21:59,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:21:59,849 INFO L225 Difference]: With dead ends: 316 [2021-11-23 02:21:59,849 INFO L226 Difference]: Without dead ends: 162 [2021-11-23 02:21:59,850 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 02:21:59,851 INFO L933 BasicCegarLoop]: 202 mSDtfsCounter, 6 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:21:59,852 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 597 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:21:59,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-11-23 02:21:59,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2021-11-23 02:21:59,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 119 states have (on average 1.4453781512605042) internal successors, (172), 119 states have internal predecessors, (172), 31 states have call successors, (31), 11 states have call predecessors, (31), 11 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2021-11-23 02:21:59,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 234 transitions. [2021-11-23 02:21:59,868 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 234 transitions. Word has length 44 [2021-11-23 02:21:59,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:21:59,869 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 234 transitions. [2021-11-23 02:21:59,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-23 02:21:59,870 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 234 transitions. [2021-11-23 02:21:59,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-23 02:21:59,872 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:21:59,872 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-23 02:21:59,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-23 02:21:59,872 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:21:59,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:21:59,873 INFO L85 PathProgramCache]: Analyzing trace with hash -610018180, now seen corresponding path program 1 times [2021-11-23 02:21:59,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:21:59,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485701124] [2021-11-23 02:21:59,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:21:59,874 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:21:59,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:21:59,976 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 02:21:59,976 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:21:59,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485701124] [2021-11-23 02:21:59,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485701124] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:21:59,977 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:21:59,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 02:21:59,978 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19851027] [2021-11-23 02:21:59,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:21:59,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 02:21:59,981 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:21:59,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 02:21:59,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 02:21:59,985 INFO L87 Difference]: Start difference. First operand 162 states and 234 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-23 02:22:00,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:22:00,091 INFO L93 Difference]: Finished difference Result 325 states and 470 transitions. [2021-11-23 02:22:00,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 02:22:00,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (7), 3 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 44 [2021-11-23 02:22:00,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:22:00,098 INFO L225 Difference]: With dead ends: 325 [2021-11-23 02:22:00,105 INFO L226 Difference]: Without dead ends: 166 [2021-11-23 02:22:00,106 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 02:22:00,110 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 5 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:22:00,111 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 606 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:22:00,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-11-23 02:22:00,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2021-11-23 02:22:00,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 122 states have (on average 1.4344262295081966) internal successors, (175), 122 states have internal predecessors, (175), 31 states have call successors, (31), 12 states have call predecessors, (31), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2021-11-23 02:22:00,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 237 transitions. [2021-11-23 02:22:00,143 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 237 transitions. Word has length 44 [2021-11-23 02:22:00,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:22:00,144 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 237 transitions. [2021-11-23 02:22:00,144 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-23 02:22:00,145 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 237 transitions. [2021-11-23 02:22:00,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-23 02:22:00,156 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:22:00,156 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:22:00,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-23 02:22:00,157 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:22:00,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:22:00,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1818633053, now seen corresponding path program 1 times [2021-11-23 02:22:00,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:22:00,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104058411] [2021-11-23 02:22:00,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:22:00,159 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:22:00,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:22:00,316 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-23 02:22:00,317 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:22:00,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104058411] [2021-11-23 02:22:00,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104058411] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:22:00,317 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:22:00,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 02:22:00,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727277504] [2021-11-23 02:22:00,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:22:00,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 02:22:00,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:22:00,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 02:22:00,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 02:22:00,321 INFO L87 Difference]: Start difference. First operand 166 states and 237 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 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) [2021-11-23 02:22:00,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:22:00,416 INFO L93 Difference]: Finished difference Result 335 states and 479 transitions. [2021-11-23 02:22:00,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 02:22:00,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 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 52 [2021-11-23 02:22:00,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:22:00,420 INFO L225 Difference]: With dead ends: 335 [2021-11-23 02:22:00,420 INFO L226 Difference]: Without dead ends: 172 [2021-11-23 02:22:00,421 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 02:22:00,425 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 7 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:22:00,428 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 608 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:22:00,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-11-23 02:22:00,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2021-11-23 02:22:00,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 127 states have (on average 1.4173228346456692) internal successors, (180), 127 states have internal predecessors, (180), 31 states have call successors, (31), 13 states have call predecessors, (31), 13 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2021-11-23 02:22:00,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 242 transitions. [2021-11-23 02:22:00,448 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 242 transitions. Word has length 52 [2021-11-23 02:22:00,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:22:00,449 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 242 transitions. [2021-11-23 02:22:00,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 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) [2021-11-23 02:22:00,450 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 242 transitions. [2021-11-23 02:22:00,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-23 02:22:00,453 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:22:00,454 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-23 02:22:00,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-23 02:22:00,455 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:22:00,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:22:00,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1171138832, now seen corresponding path program 1 times [2021-11-23 02:22:00,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:22:00,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481042833] [2021-11-23 02:22:00,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:22:00,458 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:22:00,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:22:00,801 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-23 02:22:00,802 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:22:00,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481042833] [2021-11-23 02:22:00,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481042833] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:22:00,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435002938] [2021-11-23 02:22:00,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:22:00,809 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:22:00,810 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:22:00,811 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:22:00,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-23 02:22:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:22:00,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-23 02:22:00,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:22:01,358 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:22:01,358 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 02:22:01,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435002938] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:22:01,359 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 02:22:01,359 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 14 [2021-11-23 02:22:01,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697649844] [2021-11-23 02:22:01,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:22:01,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-23 02:22:01,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:22:01,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-23 02:22:01,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-11-23 02:22:01,366 INFO L87 Difference]: Start difference. First operand 172 states and 242 transitions. Second operand has 8 states, 6 states have (on average 6.666666666666667) internal successors, (40), 8 states have internal predecessors, (40), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-23 02:22:01,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:22:01,772 INFO L93 Difference]: Finished difference Result 510 states and 710 transitions. [2021-11-23 02:22:01,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-23 02:22:01,773 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 6.666666666666667) internal successors, (40), 8 states have internal predecessors, (40), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 55 [2021-11-23 02:22:01,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:22:01,779 INFO L225 Difference]: With dead ends: 510 [2021-11-23 02:22:01,779 INFO L226 Difference]: Without dead ends: 331 [2021-11-23 02:22:01,780 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2021-11-23 02:22:01,782 INFO L933 BasicCegarLoop]: 233 mSDtfsCounter, 201 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 02:22:01,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 1256 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 02:22:01,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2021-11-23 02:22:01,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 327. [2021-11-23 02:22:01,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 240 states have (on average 1.4083333333333334) internal successors, (338), 241 states have internal predecessors, (338), 60 states have call successors, (60), 26 states have call predecessors, (60), 26 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2021-11-23 02:22:01,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 458 transitions. [2021-11-23 02:22:01,833 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 458 transitions. Word has length 55 [2021-11-23 02:22:01,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:22:01,835 INFO L470 AbstractCegarLoop]: Abstraction has 327 states and 458 transitions. [2021-11-23 02:22:01,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 6.666666666666667) internal successors, (40), 8 states have internal predecessors, (40), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-23 02:22:01,836 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 458 transitions. [2021-11-23 02:22:01,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-23 02:22:01,838 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:22:01,838 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-23 02:22:01,875 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-23 02:22:02,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:22:02,056 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:22:02,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:22:02,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1285468697, now seen corresponding path program 1 times [2021-11-23 02:22:02,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:22:02,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538424377] [2021-11-23 02:22:02,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:22:02,058 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:22:02,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:22:02,284 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-23 02:22:02,284 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:22:02,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538424377] [2021-11-23 02:22:02,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538424377] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:22:02,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454007345] [2021-11-23 02:22:02,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:22:02,285 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:22:02,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:22:02,286 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:22:02,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-23 02:22:02,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:22:02,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-23 02:22:02,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:22:02,903 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:22:02,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:22:03,146 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-23 02:22:03,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454007345] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:22:03,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [145173760] [2021-11-23 02:22:03,167 INFO L159 IcfgInterpreter]: Started Sifa with 52 locations of interest [2021-11-23 02:22:03,168 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:22:03,173 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:22:03,178 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:22:03,178 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:22:18,656 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 174 for LOIs [2021-11-23 02:22:20,130 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 12 for LOIs [2021-11-23 02:22:20,138 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 21 for LOIs [2021-11-23 02:22:20,151 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 30 for LOIs [2021-11-23 02:22:20,163 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 26 for LOIs [2021-11-23 02:22:20,176 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 15 for LOIs [2021-11-23 02:22:20,185 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:22:30,901 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5550#(and (= |assert_#in~arg| 0) (<= ~manual_selection_History_1~0 127) (<= ~active_side_History_1~0 127) (<= 0 ~active_side_History_0~0) (= assert_~arg |assert_#in~arg|) (not (= (mod ~side1Failed_History_1~0 256) 0)) (= (mod ~side2Failed_History_1~0 256) 0) (<= ~active_side_History_0~0 2) (not (= 2 ~active_side_History_0~0)) (not (= ~manual_selection_History_1~0 0)) (<= 0 (+ ~manual_selection_History_1~0 128)) (<= 0 (+ ~active_side_History_1~0 128)))' at error location [2021-11-23 02:22:30,901 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:22:30,901 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:22:30,901 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2021-11-23 02:22:30,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999279492] [2021-11-23 02:22:30,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:22:30,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-23 02:22:30,902 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:22:30,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-23 02:22:30,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=2625, Unknown=0, NotChecked=0, Total=2862 [2021-11-23 02:22:30,905 INFO L87 Difference]: Start difference. First operand 327 states and 458 transitions. Second operand has 13 states, 9 states have (on average 6.888888888888889) internal successors, (62), 12 states have internal predecessors, (62), 4 states have call successors, (15), 3 states have call predecessors, (15), 8 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2021-11-23 02:22:31,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:22:31,523 INFO L93 Difference]: Finished difference Result 1092 states and 1546 transitions. [2021-11-23 02:22:31,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-23 02:22:31,524 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 6.888888888888889) internal successors, (62), 12 states have internal predecessors, (62), 4 states have call successors, (15), 3 states have call predecessors, (15), 8 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 57 [2021-11-23 02:22:31,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:22:31,534 INFO L225 Difference]: With dead ends: 1092 [2021-11-23 02:22:31,535 INFO L226 Difference]: Without dead ends: 768 [2021-11-23 02:22:31,537 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 120 SyntacticMatches, 6 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1015 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=263, Invalid=3159, Unknown=0, NotChecked=0, Total=3422 [2021-11-23 02:22:31,538 INFO L933 BasicCegarLoop]: 271 mSDtfsCounter, 262 mSDsluCounter, 2098 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 2259 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-23 02:22:31,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [281 Valid, 2259 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-23 02:22:31,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2021-11-23 02:22:31,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 494. [2021-11-23 02:22:31,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 365 states have (on average 1.4164383561643836) internal successors, (517), 368 states have internal predecessors, (517), 88 states have call successors, (88), 40 states have call predecessors, (88), 40 states have return successors, (88), 85 states have call predecessors, (88), 88 states have call successors, (88) [2021-11-23 02:22:31,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 693 transitions. [2021-11-23 02:22:31,601 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 693 transitions. Word has length 57 [2021-11-23 02:22:31,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:22:31,602 INFO L470 AbstractCegarLoop]: Abstraction has 494 states and 693 transitions. [2021-11-23 02:22:31,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 6.888888888888889) internal successors, (62), 12 states have internal predecessors, (62), 4 states have call successors, (15), 3 states have call predecessors, (15), 8 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2021-11-23 02:22:31,603 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 693 transitions. [2021-11-23 02:22:31,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-23 02:22:31,604 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:22:31,604 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:22:31,633 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-11-23 02:22:31,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:22:31,821 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:22:31,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:22:31,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1982126259, now seen corresponding path program 1 times [2021-11-23 02:22:31,821 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:22:31,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59311558] [2021-11-23 02:22:31,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:22:31,822 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:22:31,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:22:31,926 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-23 02:22:31,926 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:22:31,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59311558] [2021-11-23 02:22:31,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59311558] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:22:31,927 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:22:31,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-23 02:22:31,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166853616] [2021-11-23 02:22:31,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:22:31,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 02:22:31,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:22:31,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 02:22:31,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 02:22:31,928 INFO L87 Difference]: Start difference. First operand 494 states and 693 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-11-23 02:22:32,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:22:32,080 INFO L93 Difference]: Finished difference Result 698 states and 1020 transitions. [2021-11-23 02:22:32,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-23 02:22:32,081 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 60 [2021-11-23 02:22:32,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:22:32,087 INFO L225 Difference]: With dead ends: 698 [2021-11-23 02:22:32,087 INFO L226 Difference]: Without dead ends: 696 [2021-11-23 02:22:32,088 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-23 02:22:32,091 INFO L933 BasicCegarLoop]: 366 mSDtfsCounter, 153 mSDsluCounter, 1320 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1634 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:22:32,091 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 1634 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:22:32,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2021-11-23 02:22:32,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 498. [2021-11-23 02:22:32,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 367 states have (on average 1.4141689373297002) internal successors, (519), 371 states have internal predecessors, (519), 89 states have call successors, (89), 41 states have call predecessors, (89), 41 states have return successors, (89), 85 states have call predecessors, (89), 89 states have call successors, (89) [2021-11-23 02:22:32,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 697 transitions. [2021-11-23 02:22:32,129 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 697 transitions. Word has length 60 [2021-11-23 02:22:32,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:22:32,130 INFO L470 AbstractCegarLoop]: Abstraction has 498 states and 697 transitions. [2021-11-23 02:22:32,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-11-23 02:22:32,130 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 697 transitions. [2021-11-23 02:22:32,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-23 02:22:32,131 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:22:32,132 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:22:32,132 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-23 02:22:32,132 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:22:32,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:22:32,133 INFO L85 PathProgramCache]: Analyzing trace with hash -800403589, now seen corresponding path program 1 times [2021-11-23 02:22:32,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:22:32,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653985119] [2021-11-23 02:22:32,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:22:32,133 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:22:32,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:22:32,203 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 02:22:32,203 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:22:32,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653985119] [2021-11-23 02:22:32,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653985119] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:22:32,204 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:22:32,204 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 02:22:32,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168721846] [2021-11-23 02:22:32,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:22:32,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 02:22:32,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:22:32,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 02:22:32,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 02:22:32,206 INFO L87 Difference]: Start difference. First operand 498 states and 697 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-11-23 02:22:32,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:22:32,275 INFO L93 Difference]: Finished difference Result 946 states and 1318 transitions. [2021-11-23 02:22:32,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 02:22:32,276 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 61 [2021-11-23 02:22:32,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:22:32,280 INFO L225 Difference]: With dead ends: 946 [2021-11-23 02:22:32,281 INFO L226 Difference]: Without dead ends: 510 [2021-11-23 02:22:32,282 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 02:22:32,283 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 5 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 02:22:32,284 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 606 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 02:22:32,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2021-11-23 02:22:32,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2021-11-23 02:22:32,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 376 states have (on average 1.4042553191489362) internal successors, (528), 380 states have internal predecessors, (528), 89 states have call successors, (89), 44 states have call predecessors, (89), 44 states have return successors, (89), 85 states have call predecessors, (89), 89 states have call successors, (89) [2021-11-23 02:22:32,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 706 transitions. [2021-11-23 02:22:32,311 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 706 transitions. Word has length 61 [2021-11-23 02:22:32,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:22:32,312 INFO L470 AbstractCegarLoop]: Abstraction has 510 states and 706 transitions. [2021-11-23 02:22:32,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-11-23 02:22:32,313 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 706 transitions. [2021-11-23 02:22:32,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-23 02:22:32,314 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:22:32,314 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:22:32,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-23 02:22:32,315 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:22:32,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:22:32,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1894630519, now seen corresponding path program 1 times [2021-11-23 02:22:32,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:22:32,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680178222] [2021-11-23 02:22:32,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:22:32,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:22:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:22:32,398 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-23 02:22:32,399 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:22:32,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680178222] [2021-11-23 02:22:32,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680178222] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:22:32,399 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:22:32,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 02:22:32,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732192460] [2021-11-23 02:22:32,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:22:32,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 02:22:32,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:22:32,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 02:22:32,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 02:22:32,401 INFO L87 Difference]: Start difference. First operand 510 states and 706 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-11-23 02:22:32,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:22:32,464 INFO L93 Difference]: Finished difference Result 906 states and 1247 transitions. [2021-11-23 02:22:32,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 02:22:32,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 63 [2021-11-23 02:22:32,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:22:32,470 INFO L225 Difference]: With dead ends: 906 [2021-11-23 02:22:32,470 INFO L226 Difference]: Without dead ends: 504 [2021-11-23 02:22:32,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 02:22:32,473 INFO L933 BasicCegarLoop]: 202 mSDtfsCounter, 7 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 02:22:32,473 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 598 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 02:22:32,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2021-11-23 02:22:32,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2021-11-23 02:22:32,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 373 states have (on average 1.383378016085791) internal successors, (516), 377 states have internal predecessors, (516), 86 states have call successors, (86), 44 states have call predecessors, (86), 44 states have return successors, (86), 82 states have call predecessors, (86), 86 states have call successors, (86) [2021-11-23 02:22:32,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 688 transitions. [2021-11-23 02:22:32,501 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 688 transitions. Word has length 63 [2021-11-23 02:22:32,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:22:32,502 INFO L470 AbstractCegarLoop]: Abstraction has 504 states and 688 transitions. [2021-11-23 02:22:32,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-11-23 02:22:32,502 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 688 transitions. [2021-11-23 02:22:32,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-23 02:22:32,504 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:22:32,504 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-23 02:22:32,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-23 02:22:32,505 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:22:32,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:22:32,505 INFO L85 PathProgramCache]: Analyzing trace with hash 119524607, now seen corresponding path program 1 times [2021-11-23 02:22:32,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:22:32,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905981237] [2021-11-23 02:22:32,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:22:32,506 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:22:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:22:32,851 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-23 02:22:32,851 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:22:32,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905981237] [2021-11-23 02:22:32,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905981237] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:22:32,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209469863] [2021-11-23 02:22:32,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:22:32,852 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:22:32,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:22:32,857 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:22:32,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-23 02:22:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:22:32,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-23 02:22:32,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:22:33,387 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-23 02:22:33,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:22:33,652 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-23 02:22:33,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209469863] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:22:33,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1909589290] [2021-11-23 02:22:33,656 INFO L159 IcfgInterpreter]: Started Sifa with 55 locations of interest [2021-11-23 02:22:33,656 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:22:33,657 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:22:33,657 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:22:33,657 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:22:46,279 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 174 for LOIs [2021-11-23 02:22:47,744 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 12 for LOIs [2021-11-23 02:22:47,746 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 30 for LOIs [2021-11-23 02:22:47,761 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 31 for LOIs [2021-11-23 02:22:47,770 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 25 for LOIs [2021-11-23 02:22:47,780 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 15 for LOIs [2021-11-23 02:22:47,786 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:22:59,409 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '13470#(and (= |assert_#in~arg| 0) (<= ~manual_selection_History_1~0 127) (<= ~active_side_History_1~0 127) (not (= ~active_side_History_0~0 1)) (<= 0 ~active_side_History_0~0) (= assert_~arg |assert_#in~arg|) (<= ~active_side_History_0~0 2) (not (= (mod ~side2Failed_History_1~0 256) 0)) (not (= ~manual_selection_History_1~0 0)) (<= 0 (+ ~manual_selection_History_1~0 128)) (<= 0 (+ ~active_side_History_1~0 128)) (= (mod ~side1Failed_History_1~0 256) 0))' at error location [2021-11-23 02:22:59,410 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:22:59,410 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:22:59,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 20 [2021-11-23 02:22:59,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457722100] [2021-11-23 02:22:59,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:22:59,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-23 02:22:59,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:22:59,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-23 02:22:59,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=3621, Unknown=0, NotChecked=0, Total=3906 [2021-11-23 02:22:59,414 INFO L87 Difference]: Start difference. First operand 504 states and 688 transitions. Second operand has 20 states, 15 states have (on average 5.333333333333333) internal successors, (80), 18 states have internal predecessors, (80), 6 states have call successors, (22), 3 states have call predecessors, (22), 9 states have return successors, (22), 7 states have call predecessors, (22), 6 states have call successors, (22) [2021-11-23 02:23:00,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:23:00,706 INFO L93 Difference]: Finished difference Result 1244 states and 1760 transitions. [2021-11-23 02:23:00,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-23 02:23:00,707 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 15 states have (on average 5.333333333333333) internal successors, (80), 18 states have internal predecessors, (80), 6 states have call successors, (22), 3 states have call predecessors, (22), 9 states have return successors, (22), 7 states have call predecessors, (22), 6 states have call successors, (22) Word has length 65 [2021-11-23 02:23:00,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:23:00,715 INFO L225 Difference]: With dead ends: 1244 [2021-11-23 02:23:00,715 INFO L226 Difference]: Without dead ends: 823 [2021-11-23 02:23:00,718 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 138 SyntacticMatches, 8 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1454 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=336, Invalid=4494, Unknown=0, NotChecked=0, Total=4830 [2021-11-23 02:23:00,719 INFO L933 BasicCegarLoop]: 342 mSDtfsCounter, 571 mSDsluCounter, 3912 mSDsCounter, 0 mSdLazyCounter, 920 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 4071 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-23 02:23:00,720 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [606 Valid, 4071 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 920 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-23 02:23:00,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2021-11-23 02:23:00,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 509. [2021-11-23 02:23:00,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 377 states have (on average 1.3713527851458887) internal successors, (517), 381 states have internal predecessors, (517), 85 states have call successors, (85), 46 states have call predecessors, (85), 46 states have return successors, (85), 81 states have call predecessors, (85), 85 states have call successors, (85) [2021-11-23 02:23:00,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 687 transitions. [2021-11-23 02:23:00,761 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 687 transitions. Word has length 65 [2021-11-23 02:23:00,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:23:00,762 INFO L470 AbstractCegarLoop]: Abstraction has 509 states and 687 transitions. [2021-11-23 02:23:00,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 15 states have (on average 5.333333333333333) internal successors, (80), 18 states have internal predecessors, (80), 6 states have call successors, (22), 3 states have call predecessors, (22), 9 states have return successors, (22), 7 states have call predecessors, (22), 6 states have call successors, (22) [2021-11-23 02:23:00,762 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 687 transitions. [2021-11-23 02:23:00,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-23 02:23:00,763 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:23:00,763 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:23:00,803 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-23 02:23:00,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-23 02:23:00,977 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:23:00,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:23:00,977 INFO L85 PathProgramCache]: Analyzing trace with hash 509607729, now seen corresponding path program 1 times [2021-11-23 02:23:00,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:23:00,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48166776] [2021-11-23 02:23:00,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:23:00,977 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:23:00,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:23:01,028 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-23 02:23:01,028 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:23:01,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48166776] [2021-11-23 02:23:01,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48166776] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:23:01,029 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:23:01,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 02:23:01,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987966428] [2021-11-23 02:23:01,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:23:01,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 02:23:01,033 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:23:01,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 02:23:01,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 02:23:01,033 INFO L87 Difference]: Start difference. First operand 509 states and 687 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-23 02:23:01,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:23:01,246 INFO L93 Difference]: Finished difference Result 1494 states and 2028 transitions. [2021-11-23 02:23:01,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 02:23:01,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 66 [2021-11-23 02:23:01,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:23:01,255 INFO L225 Difference]: With dead ends: 1494 [2021-11-23 02:23:01,255 INFO L226 Difference]: Without dead ends: 1051 [2021-11-23 02:23:01,257 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 02:23:01,258 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 326 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 02:23:01,259 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [326 Valid, 734 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 02:23:01,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2021-11-23 02:23:01,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 930. [2021-11-23 02:23:01,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 685 states have (on average 1.3430656934306568) internal successors, (920), 693 states have internal predecessors, (920), 158 states have call successors, (158), 86 states have call predecessors, (158), 86 states have return successors, (158), 150 states have call predecessors, (158), 158 states have call successors, (158) [2021-11-23 02:23:01,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1236 transitions. [2021-11-23 02:23:01,316 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1236 transitions. Word has length 66 [2021-11-23 02:23:01,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:23:01,317 INFO L470 AbstractCegarLoop]: Abstraction has 930 states and 1236 transitions. [2021-11-23 02:23:01,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-23 02:23:01,317 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1236 transitions. [2021-11-23 02:23:01,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-23 02:23:01,318 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:23:01,319 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:23:01,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-23 02:23:01,319 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:23:01,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:23:01,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1467150895, now seen corresponding path program 1 times [2021-11-23 02:23:01,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:23:01,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379175509] [2021-11-23 02:23:01,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:23:01,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:23:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:23:01,475 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-23 02:23:01,476 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:23:01,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379175509] [2021-11-23 02:23:01,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379175509] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:23:01,476 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:23:01,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-23 02:23:01,477 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039480729] [2021-11-23 02:23:01,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:23:01,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-23 02:23:01,477 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:23:01,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-23 02:23:01,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-23 02:23:01,478 INFO L87 Difference]: Start difference. First operand 930 states and 1236 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2021-11-23 02:23:02,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:23:02,270 INFO L93 Difference]: Finished difference Result 2239 states and 3048 transitions. [2021-11-23 02:23:02,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-23 02:23:02,271 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 66 [2021-11-23 02:23:02,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:23:02,281 INFO L225 Difference]: With dead ends: 2239 [2021-11-23 02:23:02,282 INFO L226 Difference]: Without dead ends: 1413 [2021-11-23 02:23:02,285 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-11-23 02:23:02,285 INFO L933 BasicCegarLoop]: 506 mSDtfsCounter, 528 mSDsluCounter, 1736 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 2181 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-23 02:23:02,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [534 Valid, 2181 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-23 02:23:02,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2021-11-23 02:23:02,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1005. [2021-11-23 02:23:02,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 737 states have (on average 1.327001356852103) internal successors, (978), 746 states have internal predecessors, (978), 169 states have call successors, (169), 98 states have call predecessors, (169), 98 states have return successors, (169), 160 states have call predecessors, (169), 169 states have call successors, (169) [2021-11-23 02:23:02,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1316 transitions. [2021-11-23 02:23:02,358 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1316 transitions. Word has length 66 [2021-11-23 02:23:02,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:23:02,359 INFO L470 AbstractCegarLoop]: Abstraction has 1005 states and 1316 transitions. [2021-11-23 02:23:02,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2021-11-23 02:23:02,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1316 transitions. [2021-11-23 02:23:02,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-23 02:23:02,361 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:23:02,373 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:23:02,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-23 02:23:02,374 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:23:02,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:23:02,375 INFO L85 PathProgramCache]: Analyzing trace with hash 808727846, now seen corresponding path program 1 times [2021-11-23 02:23:02,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:23:02,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633332969] [2021-11-23 02:23:02,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:23:02,375 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:23:02,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:23:02,506 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-23 02:23:02,506 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:23:02,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633332969] [2021-11-23 02:23:02,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633332969] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:23:02,506 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:23:02,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-23 02:23:02,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983990835] [2021-11-23 02:23:02,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:23:02,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-23 02:23:02,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:23:02,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-23 02:23:02,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-23 02:23:02,509 INFO L87 Difference]: Start difference. First operand 1005 states and 1316 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2021-11-23 02:23:03,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:23:03,306 INFO L93 Difference]: Finished difference Result 2834 states and 3842 transitions. [2021-11-23 02:23:03,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-23 02:23:03,307 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 68 [2021-11-23 02:23:03,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:23:03,323 INFO L225 Difference]: With dead ends: 2834 [2021-11-23 02:23:03,323 INFO L226 Difference]: Without dead ends: 2065 [2021-11-23 02:23:03,328 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-11-23 02:23:03,329 INFO L933 BasicCegarLoop]: 371 mSDtfsCounter, 569 mSDsluCounter, 1508 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 1787 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-23 02:23:03,330 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [575 Valid, 1787 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-23 02:23:03,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2065 states. [2021-11-23 02:23:03,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2065 to 1399. [2021-11-23 02:23:03,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1399 states, 1016 states have (on average 1.312992125984252) internal successors, (1334), 1028 states have internal predecessors, (1334), 245 states have call successors, (245), 137 states have call predecessors, (245), 137 states have return successors, (245), 233 states have call predecessors, (245), 245 states have call successors, (245) [2021-11-23 02:23:03,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 1399 states and 1824 transitions. [2021-11-23 02:23:03,445 INFO L78 Accepts]: Start accepts. Automaton has 1399 states and 1824 transitions. Word has length 68 [2021-11-23 02:23:03,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:23:03,446 INFO L470 AbstractCegarLoop]: Abstraction has 1399 states and 1824 transitions. [2021-11-23 02:23:03,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2021-11-23 02:23:03,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 1824 transitions. [2021-11-23 02:23:03,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-23 02:23:03,450 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:23:03,450 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:23:03,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-23 02:23:03,450 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:23:03,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:23:03,451 INFO L85 PathProgramCache]: Analyzing trace with hash 359313435, now seen corresponding path program 1 times [2021-11-23 02:23:03,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:23:03,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199635280] [2021-11-23 02:23:03,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:23:03,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:23:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:23:03,529 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-23 02:23:03,529 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:23:03,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199635280] [2021-11-23 02:23:03,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199635280] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:23:03,530 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:23:03,530 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 02:23:03,530 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993546185] [2021-11-23 02:23:03,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:23:03,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 02:23:03,531 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:23:03,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 02:23:03,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 02:23:03,532 INFO L87 Difference]: Start difference. First operand 1399 states and 1824 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-23 02:23:03,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:23:03,819 INFO L93 Difference]: Finished difference Result 3504 states and 4603 transitions. [2021-11-23 02:23:03,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 02:23:03,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 70 [2021-11-23 02:23:03,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:23:03,837 INFO L225 Difference]: With dead ends: 3504 [2021-11-23 02:23:03,837 INFO L226 Difference]: Without dead ends: 2468 [2021-11-23 02:23:03,841 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 02:23:03,842 INFO L933 BasicCegarLoop]: 367 mSDtfsCounter, 352 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:23:03,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 916 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:23:03,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2468 states. [2021-11-23 02:23:03,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2468 to 2067. [2021-11-23 02:23:04,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2067 states, 1496 states have (on average 1.3014705882352942) internal successors, (1947), 1513 states have internal predecessors, (1947), 368 states have call successors, (368), 202 states have call predecessors, (368), 202 states have return successors, (368), 351 states have call predecessors, (368), 368 states have call successors, (368) [2021-11-23 02:23:04,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2067 states to 2067 states and 2683 transitions. [2021-11-23 02:23:04,014 INFO L78 Accepts]: Start accepts. Automaton has 2067 states and 2683 transitions. Word has length 70 [2021-11-23 02:23:04,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:23:04,015 INFO L470 AbstractCegarLoop]: Abstraction has 2067 states and 2683 transitions. [2021-11-23 02:23:04,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-23 02:23:04,015 INFO L276 IsEmpty]: Start isEmpty. Operand 2067 states and 2683 transitions. [2021-11-23 02:23:04,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-23 02:23:04,018 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:23:04,018 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:23:04,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-23 02:23:04,018 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:23:04,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:23:04,019 INFO L85 PathProgramCache]: Analyzing trace with hash 338117835, now seen corresponding path program 1 times [2021-11-23 02:23:04,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:23:04,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603361407] [2021-11-23 02:23:04,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:23:04,020 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:23:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:23:04,082 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-23 02:23:04,083 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:23:04,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603361407] [2021-11-23 02:23:04,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603361407] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:23:04,083 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:23:04,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 02:23:04,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624088151] [2021-11-23 02:23:04,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:23:04,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 02:23:04,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:23:04,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 02:23:04,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 02:23:04,085 INFO L87 Difference]: Start difference. First operand 2067 states and 2683 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-23 02:23:04,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:23:04,419 INFO L93 Difference]: Finished difference Result 4572 states and 5977 transitions. [2021-11-23 02:23:04,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 02:23:04,420 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 70 [2021-11-23 02:23:04,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:23:04,439 INFO L225 Difference]: With dead ends: 4572 [2021-11-23 02:23:04,439 INFO L226 Difference]: Without dead ends: 3021 [2021-11-23 02:23:04,444 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 02:23:04,445 INFO L933 BasicCegarLoop]: 378 mSDtfsCounter, 328 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:23:04,445 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [328 Valid, 910 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:23:04,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3021 states. [2021-11-23 02:23:04,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3021 to 2771. [2021-11-23 02:23:04,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2771 states, 2003 states have (on average 1.2950574138791813) internal successors, (2594), 2026 states have internal predecessors, (2594), 497 states have call successors, (497), 270 states have call predecessors, (497), 270 states have return successors, (497), 474 states have call predecessors, (497), 497 states have call successors, (497) [2021-11-23 02:23:04,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2771 states to 2771 states and 3588 transitions. [2021-11-23 02:23:04,657 INFO L78 Accepts]: Start accepts. Automaton has 2771 states and 3588 transitions. Word has length 70 [2021-11-23 02:23:04,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:23:04,658 INFO L470 AbstractCegarLoop]: Abstraction has 2771 states and 3588 transitions. [2021-11-23 02:23:04,658 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-23 02:23:04,658 INFO L276 IsEmpty]: Start isEmpty. Operand 2771 states and 3588 transitions. [2021-11-23 02:23:04,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-23 02:23:04,662 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:23:04,662 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:23:04,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-23 02:23:04,663 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:23:04,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:23:04,663 INFO L85 PathProgramCache]: Analyzing trace with hash 709972229, now seen corresponding path program 1 times [2021-11-23 02:23:04,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:23:04,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537989227] [2021-11-23 02:23:04,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:23:04,664 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:23:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:23:04,732 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-23 02:23:04,732 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:23:04,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537989227] [2021-11-23 02:23:04,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537989227] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:23:04,733 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:23:04,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 02:23:04,733 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983164792] [2021-11-23 02:23:04,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:23:04,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 02:23:04,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:23:04,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 02:23:04,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 02:23:04,735 INFO L87 Difference]: Start difference. First operand 2771 states and 3588 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2021-11-23 02:23:04,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:23:04,913 INFO L93 Difference]: Finished difference Result 4888 states and 6343 transitions. [2021-11-23 02:23:04,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 02:23:04,914 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 72 [2021-11-23 02:23:04,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:23:04,934 INFO L225 Difference]: With dead ends: 4888 [2021-11-23 02:23:04,934 INFO L226 Difference]: Without dead ends: 2731 [2021-11-23 02:23:04,941 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 02:23:04,943 INFO L933 BasicCegarLoop]: 198 mSDtfsCounter, 7 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 02:23:04,943 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 580 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 02:23:04,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2731 states. [2021-11-23 02:23:05,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2731 to 2731. [2021-11-23 02:23:05,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2731 states, 1983 states have (on average 1.2677760968229954) internal successors, (2514), 2006 states have internal predecessors, (2514), 477 states have call successors, (477), 270 states have call predecessors, (477), 270 states have return successors, (477), 454 states have call predecessors, (477), 477 states have call successors, (477) [2021-11-23 02:23:05,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2731 states to 2731 states and 3468 transitions. [2021-11-23 02:23:05,137 INFO L78 Accepts]: Start accepts. Automaton has 2731 states and 3468 transitions. Word has length 72 [2021-11-23 02:23:05,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:23:05,138 INFO L470 AbstractCegarLoop]: Abstraction has 2731 states and 3468 transitions. [2021-11-23 02:23:05,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2021-11-23 02:23:05,138 INFO L276 IsEmpty]: Start isEmpty. Operand 2731 states and 3468 transitions. [2021-11-23 02:23:05,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-23 02:23:05,141 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:23:05,141 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:23:05,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-23 02:23:05,142 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:23:05,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:23:05,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1926303119, now seen corresponding path program 1 times [2021-11-23 02:23:05,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:23:05,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119216223] [2021-11-23 02:23:05,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:23:05,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:23:05,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:23:05,172 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-23 02:23:05,172 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:23:05,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119216223] [2021-11-23 02:23:05,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119216223] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:23:05,173 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:23:05,173 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 02:23:05,173 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977303524] [2021-11-23 02:23:05,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:23:05,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 02:23:05,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:23:05,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 02:23:05,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:23:05,176 INFO L87 Difference]: Start difference. First operand 2731 states and 3468 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-23 02:23:05,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:23:05,481 INFO L93 Difference]: Finished difference Result 5872 states and 7752 transitions. [2021-11-23 02:23:05,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 02:23:05,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2021-11-23 02:23:05,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:23:05,509 INFO L225 Difference]: With dead ends: 5872 [2021-11-23 02:23:05,509 INFO L226 Difference]: Without dead ends: 3602 [2021-11-23 02:23:05,516 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:23:05,517 INFO L933 BasicCegarLoop]: 332 mSDtfsCounter, 102 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:23:05,517 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 510 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:23:05,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3602 states. [2021-11-23 02:23:05,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3602 to 2736. [2021-11-23 02:23:05,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2736 states, 1988 states have (on average 1.267102615694165) internal successors, (2519), 2011 states have internal predecessors, (2519), 477 states have call successors, (477), 270 states have call predecessors, (477), 270 states have return successors, (477), 454 states have call predecessors, (477), 477 states have call successors, (477) [2021-11-23 02:23:05,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2736 states to 2736 states and 3473 transitions. [2021-11-23 02:23:05,754 INFO L78 Accepts]: Start accepts. Automaton has 2736 states and 3473 transitions. Word has length 71 [2021-11-23 02:23:05,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:23:05,755 INFO L470 AbstractCegarLoop]: Abstraction has 2736 states and 3473 transitions. [2021-11-23 02:23:05,755 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-23 02:23:05,755 INFO L276 IsEmpty]: Start isEmpty. Operand 2736 states and 3473 transitions. [2021-11-23 02:23:05,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-23 02:23:05,762 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:23:05,762 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-23 02:23:05,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-23 02:23:05,762 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:23:05,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:23:05,763 INFO L85 PathProgramCache]: Analyzing trace with hash 608719174, now seen corresponding path program 1 times [2021-11-23 02:23:05,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:23:05,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188248286] [2021-11-23 02:23:05,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:23:05,764 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:23:05,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:23:05,820 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-23 02:23:05,821 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:23:05,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188248286] [2021-11-23 02:23:05,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188248286] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:23:05,821 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:23:05,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 02:23:05,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083697040] [2021-11-23 02:23:05,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:23:05,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 02:23:05,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:23:05,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 02:23:05,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 02:23:05,824 INFO L87 Difference]: Start difference. First operand 2736 states and 3473 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-23 02:23:06,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:23:06,028 INFO L93 Difference]: Finished difference Result 5110 states and 6552 transitions. [2021-11-23 02:23:06,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 02:23:06,028 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 72 [2021-11-23 02:23:06,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:23:06,048 INFO L225 Difference]: With dead ends: 5110 [2021-11-23 02:23:06,048 INFO L226 Difference]: Without dead ends: 2503 [2021-11-23 02:23:06,055 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 02:23:06,056 INFO L933 BasicCegarLoop]: 223 mSDtfsCounter, 178 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:23:06,057 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 615 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:23:06,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2021-11-23 02:23:06,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 2263. [2021-11-23 02:23:06,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2263 states, 1644 states have (on average 1.2639902676399026) internal successors, (2078), 1663 states have internal predecessors, (2078), 390 states have call successors, (390), 228 states have call predecessors, (390), 228 states have return successors, (390), 371 states have call predecessors, (390), 390 states have call successors, (390) [2021-11-23 02:23:06,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2263 states to 2263 states and 2858 transitions. [2021-11-23 02:23:06,259 INFO L78 Accepts]: Start accepts. Automaton has 2263 states and 2858 transitions. Word has length 72 [2021-11-23 02:23:06,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:23:06,260 INFO L470 AbstractCegarLoop]: Abstraction has 2263 states and 2858 transitions. [2021-11-23 02:23:06,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-23 02:23:06,261 INFO L276 IsEmpty]: Start isEmpty. Operand 2263 states and 2858 transitions. [2021-11-23 02:23:06,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-23 02:23:06,263 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:23:06,263 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-23 02:23:06,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-23 02:23:06,264 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:23:06,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:23:06,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1683138964, now seen corresponding path program 1 times [2021-11-23 02:23:06,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:23:06,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918670737] [2021-11-23 02:23:06,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:23:06,265 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:23:06,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:23:06,298 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-23 02:23:06,298 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:23:06,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918670737] [2021-11-23 02:23:06,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918670737] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:23:06,299 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:23:06,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 02:23:06,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918401818] [2021-11-23 02:23:06,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:23:06,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 02:23:06,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:23:06,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 02:23:06,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:23:06,301 INFO L87 Difference]: Start difference. First operand 2263 states and 2858 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-23 02:23:06,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:23:06,563 INFO L93 Difference]: Finished difference Result 4913 states and 6405 transitions. [2021-11-23 02:23:06,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 02:23:06,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2021-11-23 02:23:06,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:23:06,599 INFO L225 Difference]: With dead ends: 4913 [2021-11-23 02:23:06,600 INFO L226 Difference]: Without dead ends: 2838 [2021-11-23 02:23:06,608 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:23:06,609 INFO L933 BasicCegarLoop]: 310 mSDtfsCounter, 102 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:23:06,609 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 485 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:23:06,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2838 states. [2021-11-23 02:23:06,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2838 to 2269. [2021-11-23 02:23:06,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2269 states, 1650 states have (on average 1.263030303030303) internal successors, (2084), 1669 states have internal predecessors, (2084), 390 states have call successors, (390), 228 states have call predecessors, (390), 228 states have return successors, (390), 371 states have call predecessors, (390), 390 states have call successors, (390) [2021-11-23 02:23:06,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2269 states to 2269 states and 2864 transitions. [2021-11-23 02:23:06,779 INFO L78 Accepts]: Start accepts. Automaton has 2269 states and 2864 transitions. Word has length 73 [2021-11-23 02:23:06,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:23:06,779 INFO L470 AbstractCegarLoop]: Abstraction has 2269 states and 2864 transitions. [2021-11-23 02:23:06,779 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-23 02:23:06,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2269 states and 2864 transitions. [2021-11-23 02:23:06,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-23 02:23:06,781 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:23:06,781 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-23 02:23:06,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-23 02:23:06,782 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:23:06,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:23:06,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1526261967, now seen corresponding path program 1 times [2021-11-23 02:23:06,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:23:06,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700938906] [2021-11-23 02:23:06,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:23:06,783 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:23:06,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:23:06,853 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-23 02:23:06,853 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:23:06,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700938906] [2021-11-23 02:23:06,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700938906] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:23:06,854 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:23:06,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 02:23:06,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212943450] [2021-11-23 02:23:06,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:23:06,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 02:23:06,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:23:06,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 02:23:06,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 02:23:06,856 INFO L87 Difference]: Start difference. First operand 2269 states and 2864 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-23 02:23:07,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:23:07,071 INFO L93 Difference]: Finished difference Result 4621 states and 5950 transitions. [2021-11-23 02:23:07,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 02:23:07,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2021-11-23 02:23:07,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:23:07,093 INFO L225 Difference]: With dead ends: 4621 [2021-11-23 02:23:07,094 INFO L226 Difference]: Without dead ends: 2489 [2021-11-23 02:23:07,100 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 02:23:07,102 INFO L933 BasicCegarLoop]: 225 mSDtfsCounter, 130 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:23:07,102 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 618 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:23:07,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2489 states. [2021-11-23 02:23:07,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2489 to 2076. [2021-11-23 02:23:07,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2076 states, 1503 states have (on average 1.2541583499667333) internal successors, (1885), 1518 states have internal predecessors, (1885), 361 states have call successors, (361), 211 states have call predecessors, (361), 211 states have return successors, (361), 346 states have call predecessors, (361), 361 states have call successors, (361) [2021-11-23 02:23:07,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2076 states to 2076 states and 2607 transitions. [2021-11-23 02:23:07,248 INFO L78 Accepts]: Start accepts. Automaton has 2076 states and 2607 transitions. Word has length 73 [2021-11-23 02:23:07,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:23:07,249 INFO L470 AbstractCegarLoop]: Abstraction has 2076 states and 2607 transitions. [2021-11-23 02:23:07,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-23 02:23:07,249 INFO L276 IsEmpty]: Start isEmpty. Operand 2076 states and 2607 transitions. [2021-11-23 02:23:07,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-23 02:23:07,252 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:23:07,252 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:23:07,252 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-23 02:23:07,253 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:23:07,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:23:07,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1576516663, now seen corresponding path program 1 times [2021-11-23 02:23:07,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:23:07,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900621978] [2021-11-23 02:23:07,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:23:07,254 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:23:07,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:23:07,319 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-11-23 02:23:07,319 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:23:07,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900621978] [2021-11-23 02:23:07,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900621978] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:23:07,320 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:23:07,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 02:23:07,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431621123] [2021-11-23 02:23:07,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:23:07,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 02:23:07,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:23:07,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 02:23:07,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 02:23:07,321 INFO L87 Difference]: Start difference. First operand 2076 states and 2607 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2021-11-23 02:23:07,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:23:07,497 INFO L93 Difference]: Finished difference Result 3853 states and 4864 transitions. [2021-11-23 02:23:07,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 02:23:07,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 88 [2021-11-23 02:23:07,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:23:07,505 INFO L225 Difference]: With dead ends: 3853 [2021-11-23 02:23:07,505 INFO L226 Difference]: Without dead ends: 2046 [2021-11-23 02:23:07,510 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 02:23:07,510 INFO L933 BasicCegarLoop]: 194 mSDtfsCounter, 7 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 02:23:07,511 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 568 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 02:23:07,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2046 states. [2021-11-23 02:23:07,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2046 to 1971. [2021-11-23 02:23:07,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1971 states, 1434 states have (on average 1.2224546722454672) internal successors, (1753), 1449 states have internal predecessors, (1753), 334 states have call successors, (334), 202 states have call predecessors, (334), 202 states have return successors, (334), 319 states have call predecessors, (334), 334 states have call successors, (334) [2021-11-23 02:23:07,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1971 states and 2421 transitions. [2021-11-23 02:23:07,648 INFO L78 Accepts]: Start accepts. Automaton has 1971 states and 2421 transitions. Word has length 88 [2021-11-23 02:23:07,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:23:07,648 INFO L470 AbstractCegarLoop]: Abstraction has 1971 states and 2421 transitions. [2021-11-23 02:23:07,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2021-11-23 02:23:07,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1971 states and 2421 transitions. [2021-11-23 02:23:07,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-11-23 02:23:07,652 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:23:07,652 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:23:07,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-23 02:23:07,653 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:23:07,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:23:07,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1151776151, now seen corresponding path program 1 times [2021-11-23 02:23:07,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:23:07,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577462440] [2021-11-23 02:23:07,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:23:07,654 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:23:07,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:23:07,726 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-11-23 02:23:07,727 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:23:07,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577462440] [2021-11-23 02:23:07,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577462440] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:23:07,727 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:23:07,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 02:23:07,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402673174] [2021-11-23 02:23:07,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:23:07,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 02:23:07,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:23:07,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 02:23:07,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 02:23:07,729 INFO L87 Difference]: Start difference. First operand 1971 states and 2421 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2021-11-23 02:23:07,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:23:07,874 INFO L93 Difference]: Finished difference Result 3610 states and 4459 transitions. [2021-11-23 02:23:07,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 02:23:07,875 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2021-11-23 02:23:07,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:23:07,882 INFO L225 Difference]: With dead ends: 3610 [2021-11-23 02:23:07,882 INFO L226 Difference]: Without dead ends: 1935 [2021-11-23 02:23:07,886 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 02:23:07,888 INFO L933 BasicCegarLoop]: 191 mSDtfsCounter, 6 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 02:23:07,888 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 559 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 02:23:07,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2021-11-23 02:23:08,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1841. [2021-11-23 02:23:08,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1338 states have (on average 1.194319880418535) internal successors, (1598), 1353 states have internal predecessors, (1598), 311 states have call successors, (311), 191 states have call predecessors, (311), 191 states have return successors, (311), 296 states have call predecessors, (311), 311 states have call successors, (311) [2021-11-23 02:23:08,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2220 transitions. [2021-11-23 02:23:08,014 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2220 transitions. Word has length 104 [2021-11-23 02:23:08,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:23:08,015 INFO L470 AbstractCegarLoop]: Abstraction has 1841 states and 2220 transitions. [2021-11-23 02:23:08,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2021-11-23 02:23:08,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2220 transitions. [2021-11-23 02:23:08,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-11-23 02:23:08,020 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:23:08,020 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:23:08,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-23 02:23:08,020 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:23:08,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:23:08,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1047170266, now seen corresponding path program 1 times [2021-11-23 02:23:08,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:23:08,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777647712] [2021-11-23 02:23:08,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:23:08,022 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:23:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:23:08,214 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2021-11-23 02:23:08,215 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:23:08,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777647712] [2021-11-23 02:23:08,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777647712] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:23:08,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954398318] [2021-11-23 02:23:08,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:23:08,215 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:23:08,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:23:08,217 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:23:08,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-23 02:23:08,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:23:08,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-23 02:23:08,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:23:08,615 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-11-23 02:23:08,616 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 02:23:08,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954398318] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:23:08,616 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 02:23:08,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 11 [2021-11-23 02:23:08,617 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101924822] [2021-11-23 02:23:08,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:23:08,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-23 02:23:08,617 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:23:08,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-23 02:23:08,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-11-23 02:23:08,618 INFO L87 Difference]: Start difference. First operand 1841 states and 2220 transitions. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 7 states have internal predecessors, (73), 3 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2021-11-23 02:23:09,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:23:09,284 INFO L93 Difference]: Finished difference Result 4822 states and 5861 transitions. [2021-11-23 02:23:09,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-23 02:23:09,285 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 7 states have internal predecessors, (73), 3 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) Word has length 114 [2021-11-23 02:23:09,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:23:09,299 INFO L225 Difference]: With dead ends: 4822 [2021-11-23 02:23:09,299 INFO L226 Difference]: Without dead ends: 3133 [2021-11-23 02:23:09,304 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 113 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2021-11-23 02:23:09,305 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 256 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 1472 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-23 02:23:09,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [272 Valid, 1472 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-23 02:23:09,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3133 states. [2021-11-23 02:23:09,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3133 to 2068. [2021-11-23 02:23:09,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2068 states, 1504 states have (on average 1.1861702127659575) internal successors, (1784), 1523 states have internal predecessors, (1784), 343 states have call successors, (343), 220 states have call predecessors, (343), 220 states have return successors, (343), 324 states have call predecessors, (343), 343 states have call successors, (343) [2021-11-23 02:23:09,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2068 states to 2068 states and 2470 transitions. [2021-11-23 02:23:09,506 INFO L78 Accepts]: Start accepts. Automaton has 2068 states and 2470 transitions. Word has length 114 [2021-11-23 02:23:09,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:23:09,508 INFO L470 AbstractCegarLoop]: Abstraction has 2068 states and 2470 transitions. [2021-11-23 02:23:09,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 7 states have internal predecessors, (73), 3 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2021-11-23 02:23:09,509 INFO L276 IsEmpty]: Start isEmpty. Operand 2068 states and 2470 transitions. [2021-11-23 02:23:09,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-11-23 02:23:09,513 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:23:09,513 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:23:09,549 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-23 02:23:09,728 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:23:09,729 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:23:09,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:23:09,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1073798582, now seen corresponding path program 1 times [2021-11-23 02:23:09,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:23:09,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617402643] [2021-11-23 02:23:09,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:23:09,730 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:23:09,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:23:10,280 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-11-23 02:23:10,280 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:23:10,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617402643] [2021-11-23 02:23:10,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617402643] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:23:10,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201358614] [2021-11-23 02:23:10,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:23:10,281 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:23:10,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:23:10,285 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:23:10,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-23 02:23:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:23:10,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-23 02:23:10,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:23:10,823 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-11-23 02:23:10,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:23:11,113 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2021-11-23 02:23:11,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201358614] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:23:11,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1922553562] [2021-11-23 02:23:11,118 INFO L159 IcfgInterpreter]: Started Sifa with 78 locations of interest [2021-11-23 02:23:11,118 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:23:11,119 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:23:11,119 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:23:11,119 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:23:23,555 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 162 for LOIs [2021-11-23 02:23:26,549 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 6 for LOIs [2021-11-23 02:23:26,550 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 22 for LOIs [2021-11-23 02:23:26,568 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 31 for LOIs [2021-11-23 02:23:26,578 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 22 for LOIs [2021-11-23 02:23:26,598 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 35 for LOIs [2021-11-23 02:23:26,629 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:23:42,995 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '120154#(and (= (mod ~side2Failed_History_1~0 256) (mod ~side2Failed_History_2~0 256)) (= |assert_#in~arg| 0) (<= ~manual_selection_History_1~0 127) (<= 0 ~active_side_History_0~0) (= assert_~arg |assert_#in~arg|) (= (mod ~side2Failed_History_1~0 256) 0) (= (mod ~side1Failed_History_2~0 256) (mod ~side1Failed_History_1~0 256)) (<= ~active_side_History_0~0 2) (= ~manual_selection_History_2~0 0) (not (= ~manual_selection_History_1~0 0)) (<= 0 (+ ~manual_selection_History_1~0 128)) (= (mod ~side1Failed_History_1~0 256) 0))' at error location [2021-11-23 02:23:42,995 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:23:42,995 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:23:42,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 9] total 27 [2021-11-23 02:23:42,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261315731] [2021-11-23 02:23:42,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:23:42,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-11-23 02:23:42,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:23:42,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-11-23 02:23:42,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=644, Invalid=7188, Unknown=0, NotChecked=0, Total=7832 [2021-11-23 02:23:43,000 INFO L87 Difference]: Start difference. First operand 2068 states and 2470 transitions. Second operand has 27 states, 21 states have (on average 5.761904761904762) internal successors, (121), 23 states have internal predecessors, (121), 8 states have call successors, (38), 3 states have call predecessors, (38), 10 states have return successors, (37), 10 states have call predecessors, (37), 8 states have call successors, (37) [2021-11-23 02:23:45,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:23:45,294 INFO L93 Difference]: Finished difference Result 5705 states and 7492 transitions. [2021-11-23 02:23:45,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-23 02:23:45,294 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 21 states have (on average 5.761904761904762) internal successors, (121), 23 states have internal predecessors, (121), 8 states have call successors, (38), 3 states have call predecessors, (38), 10 states have return successors, (37), 10 states have call predecessors, (37), 8 states have call successors, (37) Word has length 122 [2021-11-23 02:23:45,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:23:45,310 INFO L225 Difference]: With dead ends: 5705 [2021-11-23 02:23:45,311 INFO L226 Difference]: Without dead ends: 3772 [2021-11-23 02:23:45,320 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 285 SyntacticMatches, 10 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3119 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=710, Invalid=8992, Unknown=0, NotChecked=0, Total=9702 [2021-11-23 02:23:45,320 INFO L933 BasicCegarLoop]: 649 mSDtfsCounter, 732 mSDsluCounter, 9350 mSDsCounter, 0 mSdLazyCounter, 1889 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 9523 SdHoareTripleChecker+Invalid, 2208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 1889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-11-23 02:23:45,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [782 Valid, 9523 Invalid, 2208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 1889 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-11-23 02:23:45,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3772 states. [2021-11-23 02:23:45,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3772 to 2068. [2021-11-23 02:23:45,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2068 states, 1504 states have (on average 1.1841755319148937) internal successors, (1781), 1523 states have internal predecessors, (1781), 343 states have call successors, (343), 220 states have call predecessors, (343), 220 states have return successors, (343), 324 states have call predecessors, (343), 343 states have call successors, (343) [2021-11-23 02:23:45,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2068 states to 2068 states and 2467 transitions. [2021-11-23 02:23:45,521 INFO L78 Accepts]: Start accepts. Automaton has 2068 states and 2467 transitions. Word has length 122 [2021-11-23 02:23:45,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:23:45,521 INFO L470 AbstractCegarLoop]: Abstraction has 2068 states and 2467 transitions. [2021-11-23 02:23:45,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 21 states have (on average 5.761904761904762) internal successors, (121), 23 states have internal predecessors, (121), 8 states have call successors, (38), 3 states have call predecessors, (38), 10 states have return successors, (37), 10 states have call predecessors, (37), 8 states have call successors, (37) [2021-11-23 02:23:45,522 INFO L276 IsEmpty]: Start isEmpty. Operand 2068 states and 2467 transitions. [2021-11-23 02:23:45,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-11-23 02:23:45,526 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:23:45,526 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 3, 3, 3, 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] [2021-11-23 02:23:45,563 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-23 02:23:45,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-11-23 02:23:45,753 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:23:45,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:23:45,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1276964122, now seen corresponding path program 1 times [2021-11-23 02:23:45,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:23:45,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480610033] [2021-11-23 02:23:45,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:23:45,753 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:23:45,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:23:45,939 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2021-11-23 02:23:45,940 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:23:45,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480610033] [2021-11-23 02:23:45,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480610033] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:23:45,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436734469] [2021-11-23 02:23:45,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:23:45,940 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:23:45,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:23:45,944 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:23:45,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-23 02:23:46,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:23:46,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-23 02:23:46,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:23:46,299 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-11-23 02:23:46,299 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 02:23:46,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436734469] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:23:46,299 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 02:23:46,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 11 [2021-11-23 02:23:46,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831702759] [2021-11-23 02:23:46,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:23:46,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-23 02:23:46,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:23:46,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-23 02:23:46,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-11-23 02:23:46,301 INFO L87 Difference]: Start difference. First operand 2068 states and 2467 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) [2021-11-23 02:23:47,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:23:47,089 INFO L93 Difference]: Finished difference Result 5933 states and 7425 transitions. [2021-11-23 02:23:47,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-23 02:23:47,089 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) Word has length 130 [2021-11-23 02:23:47,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:23:47,105 INFO L225 Difference]: With dead ends: 5933 [2021-11-23 02:23:47,105 INFO L226 Difference]: Without dead ends: 4000 [2021-11-23 02:23:47,111 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 128 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2021-11-23 02:23:47,111 INFO L933 BasicCegarLoop]: 396 mSDtfsCounter, 282 mSDsluCounter, 2333 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 2639 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-23 02:23:47,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [318 Valid, 2639 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-23 02:23:47,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4000 states. [2021-11-23 02:23:47,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4000 to 2828. [2021-11-23 02:23:47,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2828 states, 2056 states have (on average 1.178988326848249) internal successors, (2424), 2083 states have internal predecessors, (2424), 471 states have call successors, (471), 300 states have call predecessors, (471), 300 states have return successors, (471), 444 states have call predecessors, (471), 471 states have call successors, (471) [2021-11-23 02:23:47,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 3366 transitions. [2021-11-23 02:23:47,397 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 3366 transitions. Word has length 130 [2021-11-23 02:23:47,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:23:47,397 INFO L470 AbstractCegarLoop]: Abstraction has 2828 states and 3366 transitions. [2021-11-23 02:23:47,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) [2021-11-23 02:23:47,398 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 3366 transitions. [2021-11-23 02:23:47,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-11-23 02:23:47,402 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:23:47,402 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 3, 3, 3, 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] [2021-11-23 02:23:47,440 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-23 02:23:47,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-11-23 02:23:47,619 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:23:47,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:23:47,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1385555272, now seen corresponding path program 1 times [2021-11-23 02:23:47,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:23:47,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983930235] [2021-11-23 02:23:47,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:23:47,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:23:47,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:23:47,767 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2021-11-23 02:23:47,767 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:23:47,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983930235] [2021-11-23 02:23:47,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983930235] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:23:47,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768647084] [2021-11-23 02:23:47,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:23:47,768 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:23:47,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:23:47,773 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:23:47,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-23 02:23:47,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:23:47,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-23 02:23:47,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:23:48,112 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-11-23 02:23:48,112 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 02:23:48,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768647084] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:23:48,112 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 02:23:48,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 9 [2021-11-23 02:23:48,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450235147] [2021-11-23 02:23:48,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:23:48,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-23 02:23:48,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:23:48,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-23 02:23:48,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-23 02:23:48,114 INFO L87 Difference]: Start difference. First operand 2828 states and 3366 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2021-11-23 02:23:48,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:23:48,716 INFO L93 Difference]: Finished difference Result 6208 states and 7653 transitions. [2021-11-23 02:23:48,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-23 02:23:48,717 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) Word has length 137 [2021-11-23 02:23:48,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:23:48,732 INFO L225 Difference]: With dead ends: 6208 [2021-11-23 02:23:48,732 INFO L226 Difference]: Without dead ends: 3521 [2021-11-23 02:23:48,739 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 136 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-11-23 02:23:48,739 INFO L933 BasicCegarLoop]: 386 mSDtfsCounter, 468 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 1378 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 02:23:48,740 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [468 Valid, 1378 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 02:23:48,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3521 states. [2021-11-23 02:23:48,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3521 to 2828. [2021-11-23 02:23:48,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2828 states, 2056 states have (on average 1.17363813229572) internal successors, (2413), 2083 states have internal predecessors, (2413), 471 states have call successors, (471), 300 states have call predecessors, (471), 300 states have return successors, (471), 444 states have call predecessors, (471), 471 states have call successors, (471) [2021-11-23 02:23:48,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 3355 transitions. [2021-11-23 02:23:48,997 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 3355 transitions. Word has length 137 [2021-11-23 02:23:48,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:23:48,998 INFO L470 AbstractCegarLoop]: Abstraction has 2828 states and 3355 transitions. [2021-11-23 02:23:48,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2021-11-23 02:23:48,998 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 3355 transitions. [2021-11-23 02:23:49,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-11-23 02:23:49,003 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:23:49,003 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 3, 3, 3, 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] [2021-11-23 02:23:49,037 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-23 02:23:49,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-11-23 02:23:49,217 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:23:49,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:23:49,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1772214134, now seen corresponding path program 1 times [2021-11-23 02:23:49,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:23:49,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868613062] [2021-11-23 02:23:49,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:23:49,217 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:23:49,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:23:50,755 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-11-23 02:23:50,755 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:23:50,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868613062] [2021-11-23 02:23:50,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868613062] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:23:50,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802341632] [2021-11-23 02:23:50,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:23:50,756 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:23:50,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:23:50,765 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:23:50,772 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-23 02:23:50,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:23:50,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-23 02:23:50,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:23:51,712 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 71 proven. 5 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-11-23 02:23:51,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:23:52,402 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2021-11-23 02:23:52,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802341632] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:23:52,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1766745161] [2021-11-23 02:23:52,407 INFO L159 IcfgInterpreter]: Started Sifa with 84 locations of interest [2021-11-23 02:23:52,407 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:23:52,407 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:23:52,408 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:23:52,408 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:23:59,787 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 74 for LOIs [2021-11-23 02:23:59,890 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 108 for LOIs [2021-11-23 02:23:59,904 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 104 for LOIs [2021-11-23 02:24:00,052 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 109 for LOIs [2021-11-23 02:24:00,090 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 112 for LOIs [2021-11-23 02:24:00,200 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 120 for LOIs [2021-11-23 02:24:00,595 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:24:48,251 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '155385#(and (<= ~active_side_History_0~0 0) (<= 0 (+ ~manual_selection_History_0~0 128)) (<= ~s1p~0 0) (<= ~cs2~0 0) (<= 0 |#NULL.base|) (<= 0 (+ ~s1s1_new~0 1)) (<= 0 (+ 2 ~active_side_History_1~0)) (<= 0 (+ ~s2s2_new~0 1)) (<= ~s2s1~0 0) (<= ~s2s2~0 0) (<= 0 (+ ~s2s1_new~0 1)) (<= (+ ~s1p_new~0 1) 0) (<= 0 ~s1s1~0) (= (mod ~side2Failed_History_1~0 256) (mod ~side2Failed_History_2~0 256)) (<= 0 ~cs2~0) (<= ~manual_selection_History_0~0 127) (= ~manual_selection_History_1~0 0) (<= 0 (+ ~s2p_new~0 1)) (= |assert_#in~arg| 0) (<= 0 ~side2_written~0) (<= ~s1s2~0 0) (<= 0 ~s2p~0) (<= ~s2p~0 0) (<= 0 ~cs1~0) (<= 0 ~s1p~0) (<= 0 (+ ~s1s2_new~0 1)) (<= |#NULL.offset| 0) (<= 0 ~active_side_History_0~0) (= assert_~arg |assert_#in~arg|) (<= (+ ~cs2_new~0 1) 0) (<= (+ ~s1s2_new~0 1) 0) (<= 0 (+ ~s1p_new~0 1)) (<= (+ 2 ~active_side_History_2~0) 0) (<= (+ ~s2s1_new~0 1) 0) (= (mod ~side2Failed_History_1~0 256) 0) (= ~manual_selection_History_2~0 0) (<= ~cs1~0 0) (<= 0 ~s2s2~0) (<= (+ ~nomsg~0 1) 0) (<= |#NULL.base| 0) (<= 0 (+ ~cs1_new~0 1)) (<= (+ 2 ~active_side_History_1~0) 0) (<= (+ ~cs1_new~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= 0 (+ 2 ~active_side_History_2~0)) (<= 0 (+ ~side1_written~0 1)) (<= ~side2_written~0 0) (<= 0 ~s1s2~0) (<= ~s1s1~0 0) (<= 0 ~s2s1~0) (<= 0 |#NULL.offset|) (<= 0 (+ ~cs2_new~0 1)) (<= (+ ~side1_written~0 1) 0) (<= 0 |#StackHeapBarrier|) (<= (+ ~s2p_new~0 1) 0) (<= (+ ~s2s2_new~0 1) 0) (<= (+ ~s1s1_new~0 1) 0))' at error location [2021-11-23 02:24:48,251 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:24:48,251 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:24:48,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 14, 14] total 55 [2021-11-23 02:24:48,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984589495] [2021-11-23 02:24:48,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:24:48,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2021-11-23 02:24:48,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:24:48,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-11-23 02:24:48,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1989, Invalid=10001, Unknown=0, NotChecked=0, Total=11990 [2021-11-23 02:24:48,257 INFO L87 Difference]: Start difference. First operand 2828 states and 3355 transitions. Second operand has 55 states, 43 states have (on average 3.953488372093023) internal successors, (170), 44 states have internal predecessors, (170), 18 states have call successors, (50), 5 states have call predecessors, (50), 17 states have return successors, (49), 24 states have call predecessors, (49), 18 states have call successors, (49) [2021-11-23 02:24:54,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:24:54,590 INFO L93 Difference]: Finished difference Result 7655 states and 9904 transitions. [2021-11-23 02:24:54,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-11-23 02:24:54,591 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 43 states have (on average 3.953488372093023) internal successors, (170), 44 states have internal predecessors, (170), 18 states have call successors, (50), 5 states have call predecessors, (50), 17 states have return successors, (49), 24 states have call predecessors, (49), 18 states have call successors, (49) Word has length 137 [2021-11-23 02:24:54,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:24:54,608 INFO L225 Difference]: With dead ends: 7655 [2021-11-23 02:24:54,608 INFO L226 Difference]: Without dead ends: 4997 [2021-11-23 02:24:54,619 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 324 SyntacticMatches, 15 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5944 ImplicationChecksByTransitivity, 50.5s TimeCoverageRelationStatistics Valid=2461, Invalid=16171, Unknown=0, NotChecked=0, Total=18632 [2021-11-23 02:24:54,620 INFO L933 BasicCegarLoop]: 420 mSDtfsCounter, 853 mSDsluCounter, 12803 mSDsCounter, 0 mSdLazyCounter, 5864 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 12542 SdHoareTripleChecker+Invalid, 6137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 5864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2021-11-23 02:24:54,621 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [909 Valid, 12542 Invalid, 6137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 5864 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2021-11-23 02:24:54,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4997 states. [2021-11-23 02:24:54,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4997 to 2799. [2021-11-23 02:24:54,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2799 states, 2035 states have (on average 1.173955773955774) internal successors, (2389), 2061 states have internal predecessors, (2389), 466 states have call successors, (466), 297 states have call predecessors, (466), 297 states have return successors, (466), 440 states have call predecessors, (466), 466 states have call successors, (466) [2021-11-23 02:24:54,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2799 states to 2799 states and 3321 transitions. [2021-11-23 02:24:54,908 INFO L78 Accepts]: Start accepts. Automaton has 2799 states and 3321 transitions. Word has length 137 [2021-11-23 02:24:54,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:24:54,908 INFO L470 AbstractCegarLoop]: Abstraction has 2799 states and 3321 transitions. [2021-11-23 02:24:54,909 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 43 states have (on average 3.953488372093023) internal successors, (170), 44 states have internal predecessors, (170), 18 states have call successors, (50), 5 states have call predecessors, (50), 17 states have return successors, (49), 24 states have call predecessors, (49), 18 states have call successors, (49) [2021-11-23 02:24:54,909 INFO L276 IsEmpty]: Start isEmpty. Operand 2799 states and 3321 transitions. [2021-11-23 02:24:54,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-11-23 02:24:54,914 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:24:54,914 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:24:54,953 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-23 02:24:55,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-11-23 02:24:55,129 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:24:55,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:24:55,129 INFO L85 PathProgramCache]: Analyzing trace with hash 306941895, now seen corresponding path program 1 times [2021-11-23 02:24:55,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:24:55,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883399249] [2021-11-23 02:24:55,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:24:55,129 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:24:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:24:55,313 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-11-23 02:24:55,313 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:24:55,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883399249] [2021-11-23 02:24:55,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883399249] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:24:55,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052492588] [2021-11-23 02:24:55,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:24:55,314 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:24:55,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:24:55,315 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:24:55,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-23 02:24:55,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:24:55,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-23 02:24:55,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:24:56,032 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 65 proven. 8 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-11-23 02:24:56,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:24:56,582 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-11-23 02:24:56,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052492588] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:24:56,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2133063463] [2021-11-23 02:24:56,585 INFO L159 IcfgInterpreter]: Started Sifa with 75 locations of interest [2021-11-23 02:24:56,585 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:24:56,586 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:24:56,586 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:24:56,586 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:25:31,243 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 56 for LOIs [2021-11-23 02:25:31,292 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 93 for LOIs [2021-11-23 02:25:31,302 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 111 for LOIs [2021-11-23 02:25:31,396 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 113 for LOIs [2021-11-23 02:25:31,502 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 126 for LOIs [2021-11-23 02:25:31,701 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 92 for LOIs [2021-11-23 02:25:31,736 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:26:02,055 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '170192#(and (<= 0 (+ ~manual_selection_History_0~0 128)) (<= 0 (+ ~s1s1_new~0 1)) (<= 0 (+ 2 ~active_side_History_1~0)) (= ~s1p~0 0) (<= 0 (+ ~s2s2_new~0 1)) (= ~cs1~0 0) (<= 0 (+ ~s2s1_new~0 1)) (= ~s2s1~0 0) (<= (+ ~s1p_new~0 1) 0) (<= ~manual_selection_History_0~0 127) (<= 0 (+ ~s2p_new~0 1)) (= ~s1s1~0 0) (exists ((|v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_226| Int)) (and (<= |v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_226| 1) (= (ite (= |v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_226| 0) 0 1) |assert_#in~arg|) (<= 0 |v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_226|))) (<= 0 (+ ~s1s2_new~0 1)) (<= 0 ~active_side_History_0~0) (= assert_~arg |assert_#in~arg|) (<= (+ ~cs2_new~0 1) 0) (<= (+ ~s1s2_new~0 1) 0) (= ~s2s2~0 0) (<= 0 (+ ~s1p_new~0 1)) (<= (+ ~s2s1_new~0 1) 0) (= (mod assert_~arg 256) 0) (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~side2_written~0 1)) (= ~s1s2~0 0) (<= 0 (+ ~cs1_new~0 1)) (<= (+ ~cs1_new~0 1) 0) (= |#NULL.offset| 0) (<= 0 (+ ~nomsg~0 1)) (<= 0 (+ 2 ~active_side_History_2~0)) (<= 0 (+ ~side1_written~0 1)) (<= ~side2_written~0 0) (<= ~side1_written~0 1) (<= 0 (+ ~cs2_new~0 1)) (= ~cs2~0 0) (<= 0 |#StackHeapBarrier|) (<= (+ ~s2p_new~0 1) 0) (= ~s2p~0 0) (<= (+ ~s2s2_new~0 1) 0) (<= (+ ~s1s1_new~0 1) 0) (= |#NULL.base| 0))' at error location [2021-11-23 02:26:02,056 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:26:02,056 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:26:02,056 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 24 [2021-11-23 02:26:02,056 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417454586] [2021-11-23 02:26:02,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:26:02,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-23 02:26:02,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:26:02,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-23 02:26:02,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=790, Invalid=6692, Unknown=0, NotChecked=0, Total=7482 [2021-11-23 02:26:02,059 INFO L87 Difference]: Start difference. First operand 2799 states and 3321 transitions. Second operand has 24 states, 24 states have (on average 7.125) internal successors, (171), 24 states have internal predecessors, (171), 9 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (45), 9 states have call predecessors, (45), 9 states have call successors, (45) [2021-11-23 02:26:04,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:26:04,962 INFO L93 Difference]: Finished difference Result 7039 states and 8859 transitions. [2021-11-23 02:26:04,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-23 02:26:04,975 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 7.125) internal successors, (171), 24 states have internal predecessors, (171), 9 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (45), 9 states have call predecessors, (45), 9 states have call successors, (45) Word has length 137 [2021-11-23 02:26:04,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:26:04,993 INFO L225 Difference]: With dead ends: 7039 [2021-11-23 02:26:04,994 INFO L226 Difference]: Without dead ends: 4420 [2021-11-23 02:26:05,002 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 324 SyntacticMatches, 12 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4041 ImplicationChecksByTransitivity, 31.5s TimeCoverageRelationStatistics Valid=1005, Invalid=9501, Unknown=0, NotChecked=0, Total=10506 [2021-11-23 02:26:05,003 INFO L933 BasicCegarLoop]: 325 mSDtfsCounter, 1807 mSDsluCounter, 2804 mSDsCounter, 0 mSdLazyCounter, 2239 mSolverCounterSat, 736 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1807 SdHoareTripleChecker+Valid, 3067 SdHoareTripleChecker+Invalid, 2975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 736 IncrementalHoareTripleChecker+Valid, 2239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-23 02:26:05,003 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1807 Valid, 3067 Invalid, 2975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [736 Valid, 2239 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-11-23 02:26:05,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4420 states. [2021-11-23 02:26:05,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4420 to 3206. [2021-11-23 02:26:05,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3206 states, 2335 states have (on average 1.1700214132762312) internal successors, (2732), 2364 states have internal predecessors, (2732), 528 states have call successors, (528), 342 states have call predecessors, (528), 342 states have return successors, (528), 499 states have call predecessors, (528), 528 states have call successors, (528) [2021-11-23 02:26:05,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3206 states to 3206 states and 3788 transitions. [2021-11-23 02:26:05,333 INFO L78 Accepts]: Start accepts. Automaton has 3206 states and 3788 transitions. Word has length 137 [2021-11-23 02:26:05,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:26:05,333 INFO L470 AbstractCegarLoop]: Abstraction has 3206 states and 3788 transitions. [2021-11-23 02:26:05,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.125) internal successors, (171), 24 states have internal predecessors, (171), 9 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (45), 9 states have call predecessors, (45), 9 states have call successors, (45) [2021-11-23 02:26:05,334 INFO L276 IsEmpty]: Start isEmpty. Operand 3206 states and 3788 transitions. [2021-11-23 02:26:05,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-11-23 02:26:05,339 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:26:05,340 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 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] [2021-11-23 02:26:05,380 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-23 02:26:05,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:26:05,564 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:26:05,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:26:05,565 INFO L85 PathProgramCache]: Analyzing trace with hash 202483465, now seen corresponding path program 1 times [2021-11-23 02:26:05,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:26:05,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714473482] [2021-11-23 02:26:05,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:26:05,565 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:26:05,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:26:05,758 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-11-23 02:26:05,758 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:26:05,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714473482] [2021-11-23 02:26:05,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714473482] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:26:05,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694132690] [2021-11-23 02:26:05,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:26:05,759 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:26:05,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:26:05,764 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:26:05,789 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-23 02:26:05,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:26:05,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-23 02:26:05,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:26:06,673 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 64 proven. 11 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-11-23 02:26:06,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:26:07,211 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-11-23 02:26:07,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694132690] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:26:07,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [705485442] [2021-11-23 02:26:07,214 INFO L159 IcfgInterpreter]: Started Sifa with 73 locations of interest [2021-11-23 02:26:07,214 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:26:07,215 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:26:07,215 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:26:07,215 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:27:05,209 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 75 for LOIs [2021-11-23 02:27:05,311 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 108 for LOIs [2021-11-23 02:27:05,324 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 106 for LOIs [2021-11-23 02:27:05,429 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 113 for LOIs [2021-11-23 02:27:05,595 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 105 for LOIs [2021-11-23 02:27:05,646 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 106 for LOIs [2021-11-23 02:27:05,698 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:27:55,704 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '184454#(and (<= 0 (+ ~manual_selection_History_0~0 128)) (<= ~s1p~0 0) (<= ~cs2~0 0) (<= 0 |#NULL.base|) (<= 0 (+ ~s1s1_new~0 1)) (<= ~active_side_History_2~0 2) (<= 0 (+ 2 ~active_side_History_1~0)) (<= 0 (+ ~s2s2_new~0 1)) (<= ~active_side_History_1~0 2) (<= ~s2s1~0 0) (<= ~s2s2~0 0) (<= 0 (+ ~s2s1_new~0 1)) (<= (+ ~s1p_new~0 1) 0) (<= 0 ~s1s1~0) (<= 0 ~cs2~0) (<= ~manual_selection_History_0~0 127) (<= 0 (+ ~s2p_new~0 1)) (<= 0 ~side2_written~0) (<= ~s1s2~0 0) (<= 0 ~s2p~0) (<= 0 (+ ~manual_selection_History_2~0 128)) (<= ~s2p~0 0) (<= ~manual_selection_History_1~0 127) (<= 0 ~cs1~0) (<= 0 ~s1p~0) (<= 0 (+ ~s1s2_new~0 1)) (<= |#NULL.offset| 0) (<= 0 ~active_side_History_0~0) (= assert_~arg |assert_#in~arg|) (<= (+ ~cs2_new~0 1) 0) (<= (+ ~s1s2_new~0 1) 0) (<= 0 (+ ~s1p_new~0 1)) (<= (+ ~s2s1_new~0 1) 0) (<= ~active_side_History_0~0 2) (= (mod assert_~arg 256) 0) (<= ~manual_selection_History_2~0 127) (<= ~cs1~0 0) (<= 0 ~s2s2~0) (exists ((|v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_458| Int)) (and (<= |v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_458| 1) (<= 0 |v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_458|) (= (ite (= |v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_458| 0) 0 1) |assert_#in~arg|))) (<= (+ ~nomsg~0 1) 0) (<= |#NULL.base| 0) (<= 0 (+ ~cs1_new~0 1)) (<= (+ ~cs1_new~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= 0 (+ ~manual_selection_History_1~0 128)) (<= 0 (+ 2 ~active_side_History_2~0)) (<= 0 (+ ~side1_written~0 1)) (<= ~side2_written~0 0) (<= 0 ~s1s2~0) (<= ~s1s1~0 0) (<= 0 ~s2s1~0) (<= 0 |#NULL.offset|) (<= 0 (+ ~cs2_new~0 1)) (<= (+ ~side1_written~0 1) 0) (<= 0 |#StackHeapBarrier|) (<= (+ ~s2p_new~0 1) 0) (<= (+ ~s2s2_new~0 1) 0) (<= (+ ~s1s1_new~0 1) 0))' at error location [2021-11-23 02:27:55,705 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:27:55,705 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:27:55,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 24 [2021-11-23 02:27:55,705 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679728716] [2021-11-23 02:27:55,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:27:55,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-23 02:27:55,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:27:55,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-23 02:27:55,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=882, Invalid=6258, Unknown=0, NotChecked=0, Total=7140 [2021-11-23 02:27:55,707 INFO L87 Difference]: Start difference. First operand 3206 states and 3788 transitions. Second operand has 24 states, 24 states have (on average 7.291666666666667) internal successors, (175), 24 states have internal predecessors, (175), 9 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (45), 9 states have call predecessors, (45), 9 states have call successors, (45) [2021-11-23 02:27:59,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:27:59,056 INFO L93 Difference]: Finished difference Result 7781 states and 9873 transitions. [2021-11-23 02:27:59,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-23 02:27:59,060 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 7.291666666666667) internal successors, (175), 24 states have internal predecessors, (175), 9 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (45), 9 states have call predecessors, (45), 9 states have call successors, (45) Word has length 137 [2021-11-23 02:27:59,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:27:59,082 INFO L225 Difference]: With dead ends: 7781 [2021-11-23 02:27:59,082 INFO L226 Difference]: Without dead ends: 4782 [2021-11-23 02:27:59,092 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 328 SyntacticMatches, 10 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4676 ImplicationChecksByTransitivity, 51.2s TimeCoverageRelationStatistics Valid=1177, Invalid=9535, Unknown=0, NotChecked=0, Total=10712 [2021-11-23 02:27:59,093 INFO L933 BasicCegarLoop]: 316 mSDtfsCounter, 2492 mSDsluCounter, 2103 mSDsCounter, 0 mSdLazyCounter, 1808 mSolverCounterSat, 1618 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2492 SdHoareTripleChecker+Valid, 2384 SdHoareTripleChecker+Invalid, 3426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1618 IncrementalHoareTripleChecker+Valid, 1808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-23 02:27:59,093 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2492 Valid, 2384 Invalid, 3426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1618 Valid, 1808 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-11-23 02:27:59,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4782 states. [2021-11-23 02:27:59,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4782 to 3225. [2021-11-23 02:27:59,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3225 states, 2352 states have (on average 1.1700680272108843) internal successors, (2752), 2381 states have internal predecessors, (2752), 529 states have call successors, (529), 343 states have call predecessors, (529), 343 states have return successors, (529), 500 states have call predecessors, (529), 529 states have call successors, (529) [2021-11-23 02:27:59,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3225 states to 3225 states and 3810 transitions. [2021-11-23 02:27:59,488 INFO L78 Accepts]: Start accepts. Automaton has 3225 states and 3810 transitions. Word has length 137 [2021-11-23 02:27:59,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:27:59,488 INFO L470 AbstractCegarLoop]: Abstraction has 3225 states and 3810 transitions. [2021-11-23 02:27:59,489 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.291666666666667) internal successors, (175), 24 states have internal predecessors, (175), 9 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (45), 9 states have call predecessors, (45), 9 states have call successors, (45) [2021-11-23 02:27:59,489 INFO L276 IsEmpty]: Start isEmpty. Operand 3225 states and 3810 transitions. [2021-11-23 02:27:59,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-11-23 02:27:59,495 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:27:59,495 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:27:59,538 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-23 02:27:59,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:27:59,720 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:27:59,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:27:59,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1365456898, now seen corresponding path program 1 times [2021-11-23 02:27:59,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:27:59,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579664718] [2021-11-23 02:27:59,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:27:59,721 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:27:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 02:27:59,886 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 02:28:00,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 02:28:00,130 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-23 02:28:00,130 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-23 02:28:00,131 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-23 02:28:00,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-23 02:28:00,137 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:28:00,142 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-23 02:28:00,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:28:00 BoogieIcfgContainer [2021-11-23 02:28:00,400 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-23 02:28:00,403 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-23 02:28:00,403 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-23 02:28:00,404 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-23 02:28:00,404 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:21:57" (3/4) ... [2021-11-23 02:28:00,406 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-23 02:28:00,626 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/witness.graphml [2021-11-23 02:28:00,626 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-23 02:28:00,627 INFO L158 Benchmark]: Toolchain (without parser) took 364393.43ms. Allocated memory was 92.3MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 69.7MB in the beginning and 637.0MB in the end (delta: -567.3MB). Peak memory consumption was 971.0MB. Max. memory is 16.1GB. [2021-11-23 02:28:00,627 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 75.5MB. Free memory is still 53.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 02:28:00,627 INFO L158 Benchmark]: CACSL2BoogieTranslator took 491.44ms. Allocated memory is still 92.3MB. Free memory was 69.5MB in the beginning and 61.4MB in the end (delta: 8.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-23 02:28:00,628 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.86ms. Allocated memory is still 92.3MB. Free memory was 61.4MB in the beginning and 58.2MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 02:28:00,628 INFO L158 Benchmark]: Boogie Preprocessor took 55.50ms. Allocated memory is still 92.3MB. Free memory was 58.2MB in the beginning and 55.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 02:28:00,628 INFO L158 Benchmark]: RCFGBuilder took 1057.83ms. Allocated memory is still 92.3MB. Free memory was 55.6MB in the beginning and 52.9MB in the end (delta: 2.7MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. [2021-11-23 02:28:00,629 INFO L158 Benchmark]: TraceAbstraction took 362487.47ms. Allocated memory was 92.3MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 52.4MB in the beginning and 673.7MB in the end (delta: -621.3MB). Peak memory consumption was 919.1MB. Max. memory is 16.1GB. [2021-11-23 02:28:00,629 INFO L158 Benchmark]: Witness Printer took 223.44ms. Allocated memory is still 1.6GB. Free memory was 673.7MB in the beginning and 637.0MB in the end (delta: 36.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2021-11-23 02:28:00,631 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.30ms. Allocated memory is still 75.5MB. Free memory is still 53.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 491.44ms. Allocated memory is still 92.3MB. Free memory was 69.5MB in the beginning and 61.4MB in the end (delta: 8.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.86ms. Allocated memory is still 92.3MB. Free memory was 61.4MB in the beginning and 58.2MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.50ms. Allocated memory is still 92.3MB. Free memory was 58.2MB in the beginning and 55.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1057.83ms. Allocated memory is still 92.3MB. Free memory was 55.6MB in the beginning and 52.9MB in the end (delta: 2.7MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. * TraceAbstraction took 362487.47ms. Allocated memory was 92.3MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 52.4MB in the beginning and 673.7MB in the end (delta: -621.3MB). Peak memory consumption was 919.1MB. Max. memory is 16.1GB. * Witness Printer took 223.44ms. Allocated memory is still 1.6GB. Free memory was 673.7MB in the beginning and 637.0MB in the end (delta: 36.7MB). Peak memory consumption was 35.7MB. 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: 611]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t cs1 ; [L26] int8_t cs1_old ; [L27] int8_t cs1_new ; [L28] port_t cs2 ; [L29] int8_t cs2_old ; [L30] int8_t cs2_new ; [L31] port_t s1s2 ; [L32] int8_t s1s2_old ; [L33] int8_t s1s2_new ; [L34] port_t s1s1 ; [L35] int8_t s1s1_old ; [L36] int8_t s1s1_new ; [L37] port_t s2s1 ; [L38] int8_t s2s1_old ; [L39] int8_t s2s1_new ; [L40] port_t s2s2 ; [L41] int8_t s2s2_old ; [L42] int8_t s2s2_new ; [L43] port_t s1p ; [L44] int8_t s1p_old ; [L45] int8_t s1p_new ; [L46] port_t s2p ; [L47] int8_t s2p_old ; [L48] int8_t s2p_new ; [L51] _Bool side1Failed ; [L52] _Bool side2Failed ; [L53] msg_t side1_written ; [L54] msg_t side2_written ; [L60] static _Bool side1Failed_History_0 ; [L61] static _Bool side1Failed_History_1 ; [L62] static _Bool side1Failed_History_2 ; [L63] static _Bool side2Failed_History_0 ; [L64] static _Bool side2Failed_History_1 ; [L65] static _Bool side2Failed_History_2 ; [L66] static int8_t active_side_History_0 ; [L67] static int8_t active_side_History_1 ; [L68] static int8_t active_side_History_2 ; [L69] static msg_t manual_selection_History_0 ; [L70] static msg_t manual_selection_History_1 ; [L71] static msg_t manual_selection_History_2 ; [L534] int c1 ; [L535] int i2 ; [L538] c1 = 0 [L539] side1Failed = __VERIFIER_nondet_bool() [L540] side2Failed = __VERIFIER_nondet_bool() [L541] side1_written = __VERIFIER_nondet_char() [L542] side2_written = __VERIFIER_nondet_char() [L543] side1Failed_History_0 = __VERIFIER_nondet_bool() [L544] side1Failed_History_1 = __VERIFIER_nondet_bool() [L545] side1Failed_History_2 = __VERIFIER_nondet_bool() [L546] side2Failed_History_0 = __VERIFIER_nondet_bool() [L547] side2Failed_History_1 = __VERIFIER_nondet_bool() [L548] side2Failed_History_2 = __VERIFIER_nondet_bool() [L549] active_side_History_0 = __VERIFIER_nondet_char() [L550] active_side_History_1 = __VERIFIER_nondet_char() [L551] active_side_History_2 = __VERIFIER_nondet_char() [L552] manual_selection_History_0 = __VERIFIER_nondet_char() [L553] manual_selection_History_1 = __VERIFIER_nondet_char() [L554] manual_selection_History_2 = __VERIFIER_nondet_char() [L555] CALL, EXPR init() [L197] COND FALSE !((int )side1Failed_History_0 != 0) [L200] COND FALSE !((int )side2Failed_History_0 != 0) [L203] COND FALSE !((int )active_side_History_0 != -2) [L206] COND FALSE !((int )manual_selection_History_0 != 0) [L209] COND FALSE !((int )side1Failed_History_1 != 0) [L212] COND FALSE !((int )side2Failed_History_1 != 0) [L215] COND FALSE !((int )active_side_History_1 != -2) [L218] COND FALSE !((int )manual_selection_History_1 != 0) [L221] COND FALSE !((int )side1Failed_History_2 != 0) [L224] COND FALSE !((int )side2Failed_History_2 != 0) [L227] COND FALSE !((int )active_side_History_2 != -2) [L230] COND FALSE !((int )manual_selection_History_2 != 0) [L233] return (1); [L555] RET, EXPR init() [L555] i2 = init() [L556] CALL assume_abort_if_not(i2) VAL [\old(cond)=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) [L556] RET assume_abort_if_not(i2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, i2=1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L557] cs1_old = nomsg [L558] cs1_new = nomsg [L559] cs2_old = nomsg [L560] cs2_new = nomsg [L561] s1s2_old = nomsg [L562] s1s2_new = nomsg [L563] s1s1_old = nomsg [L564] s1s1_new = nomsg [L565] s2s1_old = nomsg [L566] s2s1_new = nomsg [L567] s2s2_old = nomsg [L568] s2s2_new = nomsg [L569] s1p_old = nomsg [L570] s1p_new = nomsg [L571] s2p_old = nomsg [L572] s2p_new = nomsg [L573] i2 = 0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L574] COND TRUE i2 < 10 [L576] CALL Console_task_each_pals_period() [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L257] CALL write_manual_selection_history(manual_selection) [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val [L257] RET write_manual_selection_history(manual_selection) [L258] EXPR manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] EXPR manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 [L576] RET Console_task_each_pals_period() [L577] CALL Side1_activestandby_task_each_pals_period() [L266] int8_t side1 ; [L267] int8_t side2 ; [L268] msg_t manual_selection ; [L269] int8_t next_state ; [L272] side1 = nomsg [L273] side2 = nomsg [L274] manual_selection = (msg_t )0 [L275] side1Failed = __VERIFIER_nondet_bool() [L276] CALL write_side1_failed_history(side1Failed) [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val [L276] RET write_side1_failed_history(side1Failed) [L277] COND TRUE \read(side1Failed) [L278] EXPR nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new [L278] s1s1_new = nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new [L279] EXPR nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new [L279] s1s2_new = nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new [L280] EXPR nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new [L280] s1p_new = nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new [L281] side1_written = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=0, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L577] RET Side1_activestandby_task_each_pals_period() [L578] CALL Side2_activestandby_task_each_pals_period() [L323] int8_t side1 ; [L324] int8_t side2 ; [L325] msg_t manual_selection ; [L326] int8_t next_state ; [L329] side1 = nomsg [L330] side2 = nomsg [L331] manual_selection = (msg_t )0 [L332] side2Failed = __VERIFIER_nondet_bool() [L333] CALL write_side2_failed_history(side2Failed) [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] side2Failed_History_0 = val [L333] RET write_side2_failed_history(side2Failed) [L334] COND FALSE !(\read(side2Failed)) [L341] side1 = s1s2_old [L342] s1s2_old = nomsg [L343] side2 = s2s2_old [L344] s2s2_old = nomsg [L345] manual_selection = cs2_old [L346] cs2_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L347] COND TRUE (int )side1 == (int )side2 [L348] next_state = (int8_t )0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L371] EXPR next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L371] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L372] EXPR next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L372] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L373] EXPR next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L373] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L374] side2_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L578] RET Side2_activestandby_task_each_pals_period() [L579] CALL Pendulum_prism_task_each_pals_period() [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\old(index)=0, \result=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, index=0, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)0)=-2, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] tmp = read_active_side_history((unsigned char)0) [L387] active_side = tmp [L388] side1 = nomsg [L389] side2 = nomsg [L390] side1 = s1p_old [L391] s1p_old = nomsg [L392] side2 = s2p_old [L393] s2p_old = nomsg [L394] COND FALSE !((int )side1 == 1) [L397] COND FALSE !((int )side2 == 1) [L400] COND FALSE !((int )side1 == 0) [L407] active_side = (int8_t )0 [L409] CALL write_active_side_history(active_side) [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] active_side_History_0 = val [L409] RET write_active_side_history(active_side) [L579] RET Pendulum_prism_task_each_pals_period() [L580] cs1_old = cs1_new [L581] cs1_new = nomsg [L582] cs2_old = cs2_new [L583] cs2_new = nomsg [L584] s1s2_old = s1s2_new [L585] s1s2_new = nomsg [L586] s1s1_old = s1s1_new [L587] s1s1_new = nomsg [L588] s2s1_old = s2s1_new [L589] s2s1_new = nomsg [L590] s2s2_old = s2s2_new [L591] s2s2_new = nomsg [L592] s1p_old = s1p_new [L593] s1p_new = nomsg [L594] s2p_old = s2p_new [L595] s2p_new = nomsg [L596] CALL, EXPR check() [L415] int tmp ; [L416] msg_t tmp___0 ; [L417] _Bool tmp___1 ; [L418] _Bool tmp___2 ; [L419] _Bool tmp___3 ; [L420] _Bool tmp___4 ; [L421] int8_t tmp___5 ; [L422] _Bool tmp___6 ; [L423] _Bool tmp___7 ; [L424] _Bool tmp___8 ; [L425] int8_t tmp___9 ; [L426] _Bool tmp___10 ; [L427] _Bool tmp___11 ; [L428] _Bool tmp___12 ; [L429] msg_t tmp___13 ; [L430] _Bool tmp___14 ; [L431] _Bool tmp___15 ; [L432] _Bool tmp___16 ; [L433] _Bool tmp___17 ; [L434] int8_t tmp___18 ; [L435] int8_t tmp___19 ; [L436] int8_t tmp___20 ; [L439] COND FALSE !(! side1Failed) [L442] COND TRUE ! side2Failed [L443] tmp = 1 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L447] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) [L447] RET assume_abort_if_not((_Bool )tmp) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L448] CALL, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L178] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L448] RET, EXPR read_manual_selection_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_manual_selection_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L448] tmp___0 = read_manual_selection_history((unsigned char)1) [L449] COND TRUE ! tmp___0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0] [L450] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=-256, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L450] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=-256, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0] [L450] tmp___1 = read_side1_failed_history((unsigned char)1) [L451] COND TRUE ! tmp___1 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0] [L452] CALL, EXPR read_side1_failed_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND TRUE (int )index == 0 [L89] return (side1Failed_History_0); VAL [\old(index)=0, \result=-255, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=0, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L452] RET, EXPR read_side1_failed_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)0)=-255, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0] [L452] tmp___2 = read_side1_failed_history((unsigned char)0) [L453] COND FALSE !(! tmp___2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1] [L478] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=-256, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L478] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=-256, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1] [L478] tmp___7 = read_side1_failed_history((unsigned char)1) [L479] COND FALSE !(\read(tmp___7)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1, tmp___7=0] [L494] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=-256, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L494] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=-256, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1, tmp___7=0] [L494] tmp___11 = read_side1_failed_history((unsigned char)1) [L495] COND TRUE ! tmp___11 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___2=1, tmp___7=0] [L496] CALL, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L118] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L496] RET, EXPR read_side2_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___2=1, tmp___7=0] [L496] tmp___12 = read_side2_failed_history((unsigned char)1) [L497] COND FALSE !(\read(tmp___12)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___7=0] [L510] CALL, EXPR read_active_side_history((unsigned char)2) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND FALSE !((int )index == 0) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=2, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L151] COND FALSE !((int )index == 1) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=2, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L154] COND TRUE (int )index == 2 [L155] return (active_side_History_2); VAL [\old(index)=2, \result=-2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=2, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L510] RET, EXPR read_active_side_history((unsigned char)2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)2)=-2, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___7=0] [L510] tmp___20 = read_active_side_history((unsigned char)2) [L511] COND FALSE !((int )tmp___20 > -2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___20=-2, tmp___7=0] [L529] return (1); VAL [\result=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___20=-2, tmp___7=0] [L596] RET, EXPR check() [L596] c1 = check() [L597] CALL assert(c1) VAL [\old(arg)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L609] COND FALSE !(! arg) VAL [\old(arg)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, arg=1, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L597] RET assert(c1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, c1=1, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, i2=0, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L598] i2 ++ VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, c1=1, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, i2=1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L574] COND TRUE i2 < 10 [L576] CALL Console_task_each_pals_period() [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L257] CALL write_manual_selection_history(manual_selection) [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val [L257] RET write_manual_selection_history(manual_selection) [L258] EXPR manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] EXPR manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 [L576] RET Console_task_each_pals_period() [L577] CALL Side1_activestandby_task_each_pals_period() [L266] int8_t side1 ; [L267] int8_t side2 ; [L268] msg_t manual_selection ; [L269] int8_t next_state ; [L272] side1 = nomsg [L273] side2 = nomsg [L274] manual_selection = (msg_t )0 [L275] side1Failed = __VERIFIER_nondet_bool() [L276] CALL write_side1_failed_history(side1Failed) [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val [L276] RET write_side1_failed_history(side1Failed) [L277] COND FALSE !(\read(side1Failed)) [L284] side1 = s1s1_old [L285] s1s1_old = nomsg [L286] side2 = s2s1_old [L287] s2s1_old = nomsg [L288] manual_selection = cs1_old [L289] cs1_old = nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=127, manual_selection=127, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L290] COND FALSE !((int )side1 == (int )side2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=127, manual_selection=127, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L293] COND TRUE (int )side1 == (int )nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=127, manual_selection=127, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L294] COND TRUE (int )side2 != (int )nomsg [L295] next_state = (int8_t )0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=127, manual_selection=127, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L314] EXPR next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L314] s1s1_new = next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L315] EXPR next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L315] s1s2_new = next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L316] EXPR next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new [L316] s1p_new = next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new [L317] side1_written = next_state VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=127, manual_selection=127, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L577] RET Side1_activestandby_task_each_pals_period() [L578] CALL Side2_activestandby_task_each_pals_period() [L323] int8_t side1 ; [L324] int8_t side2 ; [L325] msg_t manual_selection ; [L326] int8_t next_state ; [L329] side1 = nomsg [L330] side2 = nomsg [L331] manual_selection = (msg_t )0 [L332] side2Failed = __VERIFIER_nondet_bool() [L333] CALL write_side2_failed_history(side2Failed) [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] side2Failed_History_0 = val [L333] RET write_side2_failed_history(side2Failed) [L334] COND TRUE \read(side2Failed) [L335] EXPR nomsg != nomsg && s2s1_new == nomsg ? nomsg : s2s1_new [L335] s2s1_new = nomsg != nomsg && s2s1_new == nomsg ? nomsg : s2s1_new [L336] EXPR nomsg != nomsg && s2s2_new == nomsg ? nomsg : s2s2_new [L336] s2s2_new = nomsg != nomsg && s2s2_new == nomsg ? nomsg : s2s2_new [L337] EXPR nomsg != nomsg && s2p_new == nomsg ? nomsg : s2p_new [L337] s2p_new = nomsg != nomsg && s2p_new == nomsg ? nomsg : s2p_new [L338] side2_written = nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=127, manual_selection=0, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=-1, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L578] RET Side2_activestandby_task_each_pals_period() [L579] CALL Pendulum_prism_task_each_pals_period() [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L386] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\old(index)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=127, index=0, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L386] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)0)=0, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L386] tmp = read_active_side_history((unsigned char)0) [L387] active_side = tmp [L388] side1 = nomsg [L389] side2 = nomsg [L390] side1 = s1p_old [L391] s1p_old = nomsg [L392] side2 = s2p_old [L393] s2p_old = nomsg [L394] COND FALSE !((int )side1 == 1) [L397] COND FALSE !((int )side2 == 1) [L400] COND FALSE !((int )side1 == 0) [L407] active_side = (int8_t )0 [L409] CALL write_active_side_history(active_side) [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] active_side_History_0 = val [L409] RET write_active_side_history(active_side) [L579] RET Pendulum_prism_task_each_pals_period() [L580] cs1_old = cs1_new [L581] cs1_new = nomsg [L582] cs2_old = cs2_new [L583] cs2_new = nomsg [L584] s1s2_old = s1s2_new [L585] s1s2_new = nomsg [L586] s1s1_old = s1s1_new [L587] s1s1_new = nomsg [L588] s2s1_old = s2s1_new [L589] s2s1_new = nomsg [L590] s2s2_old = s2s2_new [L591] s2s2_new = nomsg [L592] s1p_old = s1p_new [L593] s1p_new = nomsg [L594] s2p_old = s2p_new [L595] s2p_new = nomsg [L596] CALL, EXPR check() [L415] int tmp ; [L416] msg_t tmp___0 ; [L417] _Bool tmp___1 ; [L418] _Bool tmp___2 ; [L419] _Bool tmp___3 ; [L420] _Bool tmp___4 ; [L421] int8_t tmp___5 ; [L422] _Bool tmp___6 ; [L423] _Bool tmp___7 ; [L424] _Bool tmp___8 ; [L425] int8_t tmp___9 ; [L426] _Bool tmp___10 ; [L427] _Bool tmp___11 ; [L428] _Bool tmp___12 ; [L429] msg_t tmp___13 ; [L430] _Bool tmp___14 ; [L431] _Bool tmp___15 ; [L432] _Bool tmp___16 ; [L433] _Bool tmp___17 ; [L434] int8_t tmp___18 ; [L435] int8_t tmp___19 ; [L436] int8_t tmp___20 ; [L439] COND TRUE ! side1Failed [L440] tmp = 1 VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L447] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) [L447] RET assume_abort_if_not((_Bool )tmp) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L448] CALL, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L178] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [\old(index)=1, \result=127, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L448] RET, EXPR read_manual_selection_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, read_manual_selection_history((unsigned char)1)=127, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L448] tmp___0 = read_manual_selection_history((unsigned char)1) [L449] COND FALSE !(! tmp___0) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=127] [L478] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=-255, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L478] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=-255, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=127] [L478] tmp___7 = read_side1_failed_history((unsigned char)1) [L479] COND TRUE \read(tmp___7) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=127, tmp___7=1] [L480] CALL, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L118] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L480] RET, EXPR read_side2_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=127, tmp___7=1] [L480] tmp___8 = read_side2_failed_history((unsigned char)1) [L481] COND TRUE ! tmp___8 VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=127, tmp___7=1, tmp___8=0] [L482] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\old(index)=0, \result=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=0, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L482] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)0)=0, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=127, tmp___7=1, tmp___8=0] [L482] tmp___5 = read_active_side_history((unsigned char)0) [L483] COND TRUE ! ((int )tmp___5 == 2) [L484] return (0); VAL [\result=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=127, tmp___5=0, tmp___7=1, tmp___8=0] [L596] RET, EXPR check() [L596] c1 = check() [L597] CALL assert(c1) VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L609] COND TRUE ! arg VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L611] reach_error() VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 144 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 362.2s, OverallIterations: 32, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 25.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11108 SdHoareTripleChecker+Valid, 15.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10759 mSDsluCounter, 57510 SdHoareTripleChecker+Invalid, 12.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50729 mSDsCounter, 3792 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17174 IncrementalHoareTripleChecker+Invalid, 20966 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3792 mSolverCounterUnsat, 9112 mSDtfsCounter, 17174 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2784 GetRequests, 2024 SyntacticMatches, 69 SemanticMatches, 691 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20360 ImplicationChecksByTransitivity, 174.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3225occurred in iteration=31, InterpolantAutomatonStates: 287, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.2s AutomataMinimizationTime, 31 MinimizatonAttempts, 14496 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 11.4s InterpolantComputationTime, 3621 NumberOfCodeBlocks, 3621 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 4090 ConstructedInterpolants, 0 QuantifiedInterpolants, 13771 SizeOfPredicates, 88 NumberOfNonLiveVariables, 5347 ConjunctsInSsa, 175 ConjunctsInUnsatCore, 47 InterpolantComputations, 25 PerfectInterpolantSequences, 1976/2096 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-11-23 02:28:00,690 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edb776f4-3268-4c70-af40-4c9573815346/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE