./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 ae007674 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a30aa210ed4a7c8ee647a70aef136aef282e5eccb07388ecda6495e33bc30b6d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 01:06:35,876 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 01:06:35,878 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 01:06:35,916 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 01:06:35,916 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 01:06:35,919 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 01:06:35,920 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 01:06:35,924 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 01:06:35,926 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 01:06:35,929 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 01:06:35,930 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 01:06:35,933 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 01:06:35,933 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 01:06:35,935 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 01:06:35,936 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 01:06:35,938 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 01:06:35,938 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 01:06:35,939 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 01:06:35,941 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 01:06:35,945 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 01:06:35,946 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 01:06:35,947 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 01:06:35,948 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 01:06:35,949 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 01:06:35,954 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 01:06:35,954 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 01:06:35,954 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 01:06:35,956 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 01:06:35,956 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 01:06:35,957 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 01:06:35,957 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 01:06:35,958 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 01:06:35,959 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 01:06:35,960 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 01:06:35,960 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 01:06:35,961 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 01:06:35,961 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 01:06:35,962 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 01:06:35,962 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 01:06:35,963 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 01:06:35,963 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 01:06:35,966 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-28 01:06:35,994 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 01:06:35,994 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 01:06:35,995 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 01:06:35,995 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 01:06:35,996 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 01:06:35,996 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 01:06:35,997 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 01:06:35,997 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 01:06:35,997 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 01:06:35,997 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 01:06:35,998 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-28 01:06:35,998 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 01:06:35,998 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-28 01:06:35,998 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 01:06:35,999 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-28 01:06:35,999 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 01:06:35,999 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-28 01:06:35,999 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-28 01:06:35,999 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-28 01:06:35,999 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 01:06:36,000 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-28 01:06:36,000 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 01:06:36,000 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 01:06:36,000 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 01:06:36,000 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 01:06:36,000 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 01:06:36,001 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 01:06:36,001 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-28 01:06:36,001 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 01:06:36,001 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 01:06:36,001 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-28 01:06:36,001 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-28 01:06:36,002 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-28 01:06:36,002 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a30aa210ed4a7c8ee647a70aef136aef282e5eccb07388ecda6495e33bc30b6d [2021-12-28 01:06:36,316 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 01:06:36,335 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 01:06:36,337 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 01:06:36,338 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 01:06:36,340 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 01:06:36,341 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2021-12-28 01:06:36,387 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4353e16e0/cb19a6564c444c4eb4cca2c364f06fad/FLAG96f8b83e5 [2021-12-28 01:06:36,781 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 01:06:36,783 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2021-12-28 01:06:36,796 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4353e16e0/cb19a6564c444c4eb4cca2c364f06fad/FLAG96f8b83e5 [2021-12-28 01:06:37,139 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4353e16e0/cb19a6564c444c4eb4cca2c364f06fad [2021-12-28 01:06:37,141 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 01:06:37,142 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 01:06:37,145 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 01:06:37,145 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 01:06:37,151 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 01:06:37,152 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 01:06:37" (1/1) ... [2021-12-28 01:06:37,153 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f70e01b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:06:37, skipping insertion in model container [2021-12-28 01:06:37,153 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 01:06:37" (1/1) ... [2021-12-28 01:06:37,158 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 01:06:37,177 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 01:06:37,344 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c[14540,14553] [2021-12-28 01:06:37,346 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 01:06:37,380 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 01:06:37,435 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c[14540,14553] [2021-12-28 01:06:37,436 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 01:06:37,446 INFO L208 MainTranslator]: Completed translation [2021-12-28 01:06:37,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:06:37 WrapperNode [2021-12-28 01:06:37,446 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 01:06:37,447 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 01:06:37,447 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 01:06:37,447 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 01:06:37,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:06:37" (1/1) ... [2021-12-28 01:06:37,459 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:06:37" (1/1) ... [2021-12-28 01:06:37,482 INFO L137 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 533 [2021-12-28 01:06:37,483 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 01:06:37,483 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 01:06:37,483 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 01:06:37,483 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 01:06:37,489 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:06:37" (1/1) ... [2021-12-28 01:06:37,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:06:37" (1/1) ... [2021-12-28 01:06:37,493 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:06:37" (1/1) ... [2021-12-28 01:06:37,493 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:06:37" (1/1) ... [2021-12-28 01:06:37,500 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:06:37" (1/1) ... [2021-12-28 01:06:37,504 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:06:37" (1/1) ... [2021-12-28 01:06:37,507 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:06:37" (1/1) ... [2021-12-28 01:06:37,510 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 01:06:37,511 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 01:06:37,511 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 01:06:37,511 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 01:06:37,511 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:06:37" (1/1) ... [2021-12-28 01:06:37,516 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 01:06:37,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:06:37,545 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-28 01:06:37,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-28 01:06:37,575 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2021-12-28 01:06:37,575 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2021-12-28 01:06:37,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 01:06:37,576 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2021-12-28 01:06:37,576 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2021-12-28 01:06:37,576 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2021-12-28 01:06:37,576 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2021-12-28 01:06:37,576 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2021-12-28 01:06:37,576 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2021-12-28 01:06:37,576 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-28 01:06:37,577 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-28 01:06:37,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 01:06:37,577 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2021-12-28 01:06:37,577 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2021-12-28 01:06:37,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 01:06:37,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 01:06:37,577 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2021-12-28 01:06:37,577 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2021-12-28 01:06:37,655 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 01:06:37,656 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 01:06:38,074 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 01:06:38,080 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 01:06:38,080 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-28 01:06:38,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 01:06:38 BoogieIcfgContainer [2021-12-28 01:06:38,091 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 01:06:38,093 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 01:06:38,093 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 01:06:38,095 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 01:06:38,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 01:06:37" (1/3) ... [2021-12-28 01:06:38,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e2a06e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 01:06:38, skipping insertion in model container [2021-12-28 01:06:38,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:06:37" (2/3) ... [2021-12-28 01:06:38,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e2a06e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 01:06:38, skipping insertion in model container [2021-12-28 01:06:38,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 01:06:38" (3/3) ... [2021-12-28 01:06:38,097 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2021-12-28 01:06:38,100 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 01:06:38,101 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-28 01:06:38,142 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 01:06:38,146 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-28 01:06:38,146 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-28 01:06:38,160 INFO L276 IsEmpty]: Start isEmpty. Operand has 205 states, 165 states have (on average 1.5454545454545454) internal successors, (255), 166 states have internal predecessors, (255), 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-12-28 01:06:38,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-28 01:06:38,166 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:06:38,166 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:06:38,166 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:06:38,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:06:38,170 INFO L85 PathProgramCache]: Analyzing trace with hash 255328600, now seen corresponding path program 1 times [2021-12-28 01:06:38,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:06:38,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597097164] [2021-12-28 01:06:38,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:06:38,178 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:06:38,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:38,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-28 01:06:38,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:38,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 01:06:38,354 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:06:38,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597097164] [2021-12-28 01:06:38,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597097164] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:06:38,355 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:06:38,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 01:06:38,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196764285] [2021-12-28 01:06:38,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:06:38,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-28 01:06:38,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:06:38,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-28 01:06:38,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-28 01:06:38,386 INFO L87 Difference]: Start difference. First operand has 205 states, 165 states have (on average 1.5454545454545454) internal successors, (255), 166 states have internal predecessors, (255), 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 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 01:06:38,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:06:38,431 INFO L93 Difference]: Finished difference Result 394 states and 634 transitions. [2021-12-28 01:06:38,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-28 01:06:38,434 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (3), 2 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 44 [2021-12-28 01:06:38,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:06:38,446 INFO L225 Difference]: With dead ends: 394 [2021-12-28 01:06:38,446 INFO L226 Difference]: Without dead ends: 201 [2021-12-28 01:06:38,450 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-28 01:06:38,452 INFO L933 BasicCegarLoop]: 308 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 01:06:38,453 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 01:06:38,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-12-28 01:06:38,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2021-12-28 01:06:38,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 162 states have (on average 1.4938271604938271) internal successors, (242), 162 states have internal predecessors, (242), 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-12-28 01:06:38,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 304 transitions. [2021-12-28 01:06:38,493 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 304 transitions. Word has length 44 [2021-12-28 01:06:38,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:06:38,493 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 304 transitions. [2021-12-28 01:06:38,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 01:06:38,494 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 304 transitions. [2021-12-28 01:06:38,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-28 01:06:38,495 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:06:38,495 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:06:38,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 01:06:38,496 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:06:38,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:06:38,497 INFO L85 PathProgramCache]: Analyzing trace with hash 246563096, now seen corresponding path program 1 times [2021-12-28 01:06:38,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:06:38,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39897115] [2021-12-28 01:06:38,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:06:38,499 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:06:38,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:38,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-28 01:06:38,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:38,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 01:06:38,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:06:38,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39897115] [2021-12-28 01:06:38,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39897115] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:06:38,590 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:06:38,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 01:06:38,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722208097] [2021-12-28 01:06:38,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:06:38,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 01:06:38,591 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:06:38,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 01:06:38,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 01:06:38,593 INFO L87 Difference]: Start difference. First operand 201 states and 304 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 01:06:38,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:06:38,680 INFO L93 Difference]: Finished difference Result 525 states and 799 transitions. [2021-12-28 01:06:38,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 01:06:38,681 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (3), 2 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 44 [2021-12-28 01:06:38,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:06:38,683 INFO L225 Difference]: With dead ends: 525 [2021-12-28 01:06:38,683 INFO L226 Difference]: Without dead ends: 338 [2021-12-28 01:06:38,685 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-12-28 01:06:38,686 INFO L933 BasicCegarLoop]: 323 mSDtfsCounter, 167 mSDsluCounter, 1243 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1566 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 01:06:38,686 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 1566 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 01:06:38,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2021-12-28 01:06:38,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 201. [2021-12-28 01:06:38,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 162 states have (on average 1.4197530864197532) internal successors, (230), 162 states have internal predecessors, (230), 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-12-28 01:06:38,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 292 transitions. [2021-12-28 01:06:38,707 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 292 transitions. Word has length 44 [2021-12-28 01:06:38,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:06:38,708 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 292 transitions. [2021-12-28 01:06:38,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 01:06:38,708 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 292 transitions. [2021-12-28 01:06:38,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-28 01:06:38,709 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:06:38,710 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:06:38,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-28 01:06:38,710 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:06:38,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:06:38,710 INFO L85 PathProgramCache]: Analyzing trace with hash -428937283, now seen corresponding path program 1 times [2021-12-28 01:06:38,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:06:38,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127011299] [2021-12-28 01:06:38,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:06:38,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:06:38,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:38,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 01:06:38,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:38,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 01:06:38,901 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:06:38,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127011299] [2021-12-28 01:06:38,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127011299] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:06:38,902 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:06:38,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 01:06:38,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173483325] [2021-12-28 01:06:38,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:06:38,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 01:06:38,903 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:06:38,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 01:06:38,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 01:06:38,906 INFO L87 Difference]: Start difference. First operand 201 states and 292 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 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-12-28 01:06:38,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:06:38,955 INFO L93 Difference]: Finished difference Result 389 states and 574 transitions. [2021-12-28 01:06:38,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 01:06:38,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 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 55 [2021-12-28 01:06:38,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:06:38,958 INFO L225 Difference]: With dead ends: 389 [2021-12-28 01:06:38,958 INFO L226 Difference]: Without dead ends: 205 [2021-12-28 01:06:38,959 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-12-28 01:06:38,965 INFO L933 BasicCegarLoop]: 286 mSDtfsCounter, 5 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 01:06:38,966 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 848 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 01:06:38,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2021-12-28 01:06:38,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2021-12-28 01:06:38,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 165 states have (on average 1.412121212121212) internal successors, (233), 165 states have internal predecessors, (233), 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-12-28 01:06:38,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 295 transitions. [2021-12-28 01:06:39,001 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 295 transitions. Word has length 55 [2021-12-28 01:06:39,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:06:39,001 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 295 transitions. [2021-12-28 01:06:39,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 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-12-28 01:06:39,002 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 295 transitions. [2021-12-28 01:06:39,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-28 01:06:39,006 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:06:39,006 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:06:39,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-28 01:06:39,007 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:06:39,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:06:39,008 INFO L85 PathProgramCache]: Analyzing trace with hash 544058639, now seen corresponding path program 1 times [2021-12-28 01:06:39,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:06:39,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911018555] [2021-12-28 01:06:39,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:06:39,010 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:06:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:39,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 01:06:39,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:39,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-28 01:06:39,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:39,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-28 01:06:39,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:39,128 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-28 01:06:39,128 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:06:39,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911018555] [2021-12-28 01:06:39,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911018555] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:06:39,129 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:06:39,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 01:06:39,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868625110] [2021-12-28 01:06:39,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:06:39,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 01:06:39,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:06:39,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 01:06:39,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 01:06:39,131 INFO L87 Difference]: Start difference. First operand 205 states and 295 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-28 01:06:39,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:06:39,182 INFO L93 Difference]: Finished difference Result 558 states and 814 transitions. [2021-12-28 01:06:39,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 01:06:39,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 71 [2021-12-28 01:06:39,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:06:39,187 INFO L225 Difference]: With dead ends: 558 [2021-12-28 01:06:39,187 INFO L226 Difference]: Without dead ends: 370 [2021-12-28 01:06:39,188 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-12-28 01:06:39,188 INFO L933 BasicCegarLoop]: 337 mSDtfsCounter, 223 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 01:06:39,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [223 Valid, 614 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 01:06:39,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-12-28 01:06:39,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 360. [2021-12-28 01:06:39,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 283 states have (on average 1.431095406360424) internal successors, (405), 284 states have internal predecessors, (405), 60 states have call successors, (60), 16 states have call predecessors, (60), 16 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2021-12-28 01:06:39,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 525 transitions. [2021-12-28 01:06:39,210 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 525 transitions. Word has length 71 [2021-12-28 01:06:39,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:06:39,211 INFO L470 AbstractCegarLoop]: Abstraction has 360 states and 525 transitions. [2021-12-28 01:06:39,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-28 01:06:39,211 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 525 transitions. [2021-12-28 01:06:39,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-12-28 01:06:39,213 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:06:39,213 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:06:39,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-28 01:06:39,214 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:06:39,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:06:39,214 INFO L85 PathProgramCache]: Analyzing trace with hash -729077, now seen corresponding path program 1 times [2021-12-28 01:06:39,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:06:39,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718005144] [2021-12-28 01:06:39,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:06:39,215 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:06:39,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:39,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 01:06:39,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:39,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-28 01:06:39,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:39,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-28 01:06:39,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:39,307 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-28 01:06:39,309 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:06:39,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718005144] [2021-12-28 01:06:39,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718005144] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:06:39,310 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:06:39,310 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 01:06:39,310 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225389321] [2021-12-28 01:06:39,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:06:39,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 01:06:39,311 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:06:39,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 01:06:39,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 01:06:39,312 INFO L87 Difference]: Start difference. First operand 360 states and 525 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-28 01:06:39,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:06:39,345 INFO L93 Difference]: Finished difference Result 997 states and 1468 transitions. [2021-12-28 01:06:39,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 01:06:39,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 72 [2021-12-28 01:06:39,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:06:39,350 INFO L225 Difference]: With dead ends: 997 [2021-12-28 01:06:39,350 INFO L226 Difference]: Without dead ends: 654 [2021-12-28 01:06:39,351 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-12-28 01:06:39,352 INFO L933 BasicCegarLoop]: 370 mSDtfsCounter, 231 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 01:06:39,352 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [231 Valid, 649 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 01:06:39,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2021-12-28 01:06:39,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 637. [2021-12-28 01:06:39,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 488 states have (on average 1.4487704918032787) internal successors, (707), 491 states have internal predecessors, (707), 117 states have call successors, (117), 31 states have call predecessors, (117), 31 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2021-12-28 01:06:39,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 941 transitions. [2021-12-28 01:06:39,383 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 941 transitions. Word has length 72 [2021-12-28 01:06:39,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:06:39,384 INFO L470 AbstractCegarLoop]: Abstraction has 637 states and 941 transitions. [2021-12-28 01:06:39,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-28 01:06:39,384 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 941 transitions. [2021-12-28 01:06:39,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-12-28 01:06:39,385 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:06:39,385 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:06:39,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-28 01:06:39,386 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:06:39,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:06:39,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1280592755, now seen corresponding path program 1 times [2021-12-28 01:06:39,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:06:39,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591516488] [2021-12-28 01:06:39,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:06:39,387 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:06:39,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:39,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 01:06:39,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:39,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-28 01:06:39,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:39,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-28 01:06:39,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:39,480 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-28 01:06:39,480 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:06:39,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591516488] [2021-12-28 01:06:39,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591516488] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:06:39,481 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:06:39,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 01:06:39,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426331642] [2021-12-28 01:06:39,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:06:39,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 01:06:39,481 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:06:39,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 01:06:39,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 01:06:39,482 INFO L87 Difference]: Start difference. First operand 637 states and 941 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-28 01:06:39,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:06:39,725 INFO L93 Difference]: Finished difference Result 1785 states and 2683 transitions. [2021-12-28 01:06:39,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 01:06:39,725 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 72 [2021-12-28 01:06:39,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:06:39,732 INFO L225 Difference]: With dead ends: 1785 [2021-12-28 01:06:39,733 INFO L226 Difference]: Without dead ends: 1165 [2021-12-28 01:06:39,734 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-28 01:06:39,735 INFO L933 BasicCegarLoop]: 287 mSDtfsCounter, 770 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 01:06:39,737 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [770 Valid, 776 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 01:06:39,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2021-12-28 01:06:39,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 762. [2021-12-28 01:06:39,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 762 states, 600 states have (on average 1.4283333333333332) internal successors, (857), 603 states have internal predecessors, (857), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2021-12-28 01:06:39,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1105 transitions. [2021-12-28 01:06:39,804 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 1105 transitions. Word has length 72 [2021-12-28 01:06:39,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:06:39,804 INFO L470 AbstractCegarLoop]: Abstraction has 762 states and 1105 transitions. [2021-12-28 01:06:39,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-28 01:06:39,804 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1105 transitions. [2021-12-28 01:06:39,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-28 01:06:39,806 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:06:39,806 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:06:39,806 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-28 01:06:39,806 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:06:39,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:06:39,806 INFO L85 PathProgramCache]: Analyzing trace with hash 740165986, now seen corresponding path program 1 times [2021-12-28 01:06:39,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:06:39,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183464305] [2021-12-28 01:06:39,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:06:39,807 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:06:39,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:39,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 01:06:39,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:39,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-28 01:06:39,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:39,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-28 01:06:39,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:39,885 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-28 01:06:39,885 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:06:39,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183464305] [2021-12-28 01:06:39,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183464305] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:06:39,885 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:06:39,885 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 01:06:39,885 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226552241] [2021-12-28 01:06:39,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:06:39,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 01:06:39,887 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:06:39,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 01:06:39,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 01:06:39,887 INFO L87 Difference]: Start difference. First operand 762 states and 1105 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-28 01:06:40,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:06:40,137 INFO L93 Difference]: Finished difference Result 1785 states and 2675 transitions. [2021-12-28 01:06:40,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 01:06:40,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 73 [2021-12-28 01:06:40,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:06:40,142 INFO L225 Difference]: With dead ends: 1785 [2021-12-28 01:06:40,142 INFO L226 Difference]: Without dead ends: 1165 [2021-12-28 01:06:40,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-28 01:06:40,144 INFO L933 BasicCegarLoop]: 288 mSDtfsCounter, 766 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 01:06:40,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [766 Valid, 779 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 01:06:40,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2021-12-28 01:06:40,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 762. [2021-12-28 01:06:40,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 762 states, 600 states have (on average 1.4216666666666666) internal successors, (853), 603 states have internal predecessors, (853), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2021-12-28 01:06:40,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1101 transitions. [2021-12-28 01:06:40,182 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 1101 transitions. Word has length 73 [2021-12-28 01:06:40,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:06:40,182 INFO L470 AbstractCegarLoop]: Abstraction has 762 states and 1101 transitions. [2021-12-28 01:06:40,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-28 01:06:40,182 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1101 transitions. [2021-12-28 01:06:40,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-12-28 01:06:40,183 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:06:40,183 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:06:40,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-28 01:06:40,183 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:06:40,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:06:40,183 INFO L85 PathProgramCache]: Analyzing trace with hash -2060570112, now seen corresponding path program 1 times [2021-12-28 01:06:40,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:06:40,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616380385] [2021-12-28 01:06:40,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:06:40,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:06:40,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:40,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 01:06:40,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:40,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-28 01:06:40,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:40,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 01:06:40,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:40,258 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-28 01:06:40,258 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:06:40,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616380385] [2021-12-28 01:06:40,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616380385] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:06:40,258 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:06:40,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 01:06:40,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426994553] [2021-12-28 01:06:40,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:06:40,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 01:06:40,259 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:06:40,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 01:06:40,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 01:06:40,259 INFO L87 Difference]: Start difference. First operand 762 states and 1101 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 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-12-28 01:06:40,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:06:40,303 INFO L93 Difference]: Finished difference Result 1402 states and 2052 transitions. [2021-12-28 01:06:40,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 01:06:40,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 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 74 [2021-12-28 01:06:40,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:06:40,307 INFO L225 Difference]: With dead ends: 1402 [2021-12-28 01:06:40,307 INFO L226 Difference]: Without dead ends: 782 [2021-12-28 01:06:40,308 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 01:06:40,309 INFO L933 BasicCegarLoop]: 288 mSDtfsCounter, 6 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 01:06:40,309 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 860 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 01:06:40,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2021-12-28 01:06:40,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 782. [2021-12-28 01:06:40,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 616 states have (on average 1.4107142857142858) internal successors, (869), 619 states have internal predecessors, (869), 124 states have call successors, (124), 41 states have call predecessors, (124), 41 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2021-12-28 01:06:40,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1117 transitions. [2021-12-28 01:06:40,346 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1117 transitions. Word has length 74 [2021-12-28 01:06:40,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:06:40,346 INFO L470 AbstractCegarLoop]: Abstraction has 782 states and 1117 transitions. [2021-12-28 01:06:40,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 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-12-28 01:06:40,346 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1117 transitions. [2021-12-28 01:06:40,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-12-28 01:06:40,347 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:06:40,347 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:06:40,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-28 01:06:40,348 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:06:40,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:06:40,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1071682645, now seen corresponding path program 1 times [2021-12-28 01:06:40,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:06:40,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113879620] [2021-12-28 01:06:40,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:06:40,349 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:06:40,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:40,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 01:06:40,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:40,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-28 01:06:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:40,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 01:06:40,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:40,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-28 01:06:40,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:40,427 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-28 01:06:40,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:06:40,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113879620] [2021-12-28 01:06:40,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113879620] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:06:40,427 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:06:40,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 01:06:40,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665930155] [2021-12-28 01:06:40,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:06:40,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 01:06:40,428 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:06:40,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 01:06:40,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 01:06:40,428 INFO L87 Difference]: Start difference. First operand 782 states and 1117 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 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-12-28 01:06:40,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:06:40,485 INFO L93 Difference]: Finished difference Result 1442 states and 2096 transitions. [2021-12-28 01:06:40,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 01:06:40,485 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 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 82 [2021-12-28 01:06:40,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:06:40,488 INFO L225 Difference]: With dead ends: 1442 [2021-12-28 01:06:40,488 INFO L226 Difference]: Without dead ends: 802 [2021-12-28 01:06:40,489 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 01:06:40,489 INFO L933 BasicCegarLoop]: 285 mSDtfsCounter, 6 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 01:06:40,490 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 846 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 01:06:40,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2021-12-28 01:06:40,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 802. [2021-12-28 01:06:40,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 632 states have (on average 1.4003164556962024) internal successors, (885), 635 states have internal predecessors, (885), 124 states have call successors, (124), 45 states have call predecessors, (124), 45 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2021-12-28 01:06:40,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1133 transitions. [2021-12-28 01:06:40,522 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1133 transitions. Word has length 82 [2021-12-28 01:06:40,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:06:40,522 INFO L470 AbstractCegarLoop]: Abstraction has 802 states and 1133 transitions. [2021-12-28 01:06:40,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 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-12-28 01:06:40,522 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1133 transitions. [2021-12-28 01:06:40,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-12-28 01:06:40,523 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:06:40,523 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:06:40,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-28 01:06:40,523 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:06:40,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:06:40,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1920470825, now seen corresponding path program 1 times [2021-12-28 01:06:40,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:06:40,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661770751] [2021-12-28 01:06:40,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:06:40,524 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:06:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:40,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 01:06:40,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:40,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-28 01:06:40,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:40,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 01:06:40,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:40,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-28 01:06:40,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:40,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 01:06:40,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:40,584 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-28 01:06:40,584 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:06:40,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661770751] [2021-12-28 01:06:40,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661770751] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:06:40,584 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:06:40,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 01:06:40,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942257725] [2021-12-28 01:06:40,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:06:40,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 01:06:40,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:06:40,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 01:06:40,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 01:06:40,585 INFO L87 Difference]: Start difference. First operand 802 states and 1133 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 3 states have internal predecessors, (75), 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-12-28 01:06:40,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:06:40,653 INFO L93 Difference]: Finished difference Result 1482 states and 2128 transitions. [2021-12-28 01:06:40,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 01:06:40,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 3 states have internal predecessors, (75), 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 90 [2021-12-28 01:06:40,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:06:40,657 INFO L225 Difference]: With dead ends: 1482 [2021-12-28 01:06:40,657 INFO L226 Difference]: Without dead ends: 822 [2021-12-28 01:06:40,659 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 01:06:40,659 INFO L933 BasicCegarLoop]: 285 mSDtfsCounter, 6 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 01:06:40,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 846 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 01:06:40,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2021-12-28 01:06:40,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 822. [2021-12-28 01:06:40,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 648 states have (on average 1.3904320987654322) internal successors, (901), 651 states have internal predecessors, (901), 124 states have call successors, (124), 49 states have call predecessors, (124), 49 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2021-12-28 01:06:40,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1149 transitions. [2021-12-28 01:06:40,696 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1149 transitions. Word has length 90 [2021-12-28 01:06:40,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:06:40,696 INFO L470 AbstractCegarLoop]: Abstraction has 822 states and 1149 transitions. [2021-12-28 01:06:40,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 3 states have internal predecessors, (75), 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-12-28 01:06:40,696 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1149 transitions. [2021-12-28 01:06:40,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-12-28 01:06:40,697 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:06:40,697 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:06:40,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-28 01:06:40,697 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:06:40,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:06:40,698 INFO L85 PathProgramCache]: Analyzing trace with hash -21962832, now seen corresponding path program 1 times [2021-12-28 01:06:40,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:06:40,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144429222] [2021-12-28 01:06:40,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:06:40,698 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:06:40,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:40,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 01:06:40,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:40,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-28 01:06:40,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:40,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 01:06:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:40,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-28 01:06:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:40,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 01:06:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:40,747 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-28 01:06:40,747 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:06:40,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144429222] [2021-12-28 01:06:40,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144429222] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:06:40,747 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:06:40,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 01:06:40,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866476788] [2021-12-28 01:06:40,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:06:40,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 01:06:40,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:06:40,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 01:06:40,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 01:06:40,748 INFO L87 Difference]: Start difference. First operand 822 states and 1149 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 3 states have internal predecessors, (75), 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-12-28 01:06:40,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:06:40,793 INFO L93 Difference]: Finished difference Result 1518 states and 2144 transitions. [2021-12-28 01:06:40,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 01:06:40,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 3 states have internal predecessors, (75), 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 90 [2021-12-28 01:06:40,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:06:40,797 INFO L225 Difference]: With dead ends: 1518 [2021-12-28 01:06:40,797 INFO L226 Difference]: Without dead ends: 838 [2021-12-28 01:06:40,798 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 01:06:40,799 INFO L933 BasicCegarLoop]: 290 mSDtfsCounter, 5 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 01:06:40,799 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 855 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 01:06:40,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2021-12-28 01:06:40,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2021-12-28 01:06:40,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 660 states have (on average 1.3833333333333333) internal successors, (913), 663 states have internal predecessors, (913), 124 states have call successors, (124), 53 states have call predecessors, (124), 53 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2021-12-28 01:06:40,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1161 transitions. [2021-12-28 01:06:40,840 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1161 transitions. Word has length 90 [2021-12-28 01:06:40,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:06:40,840 INFO L470 AbstractCegarLoop]: Abstraction has 838 states and 1161 transitions. [2021-12-28 01:06:40,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 3 states have internal predecessors, (75), 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-12-28 01:06:40,840 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1161 transitions. [2021-12-28 01:06:40,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-12-28 01:06:40,842 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:06:40,842 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:06:40,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-28 01:06:40,842 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:06:40,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:06:40,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1155165143, now seen corresponding path program 1 times [2021-12-28 01:06:40,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:06:40,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416662282] [2021-12-28 01:06:40,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:06:40,843 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:06:40,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:40,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 01:06:40,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:40,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-28 01:06:40,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:40,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 01:06:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:40,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-28 01:06:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:40,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 01:06:40,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:40,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-28 01:06:40,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:40,907 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-28 01:06:40,907 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:06:40,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416662282] [2021-12-28 01:06:40,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416662282] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:06:40,907 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:06:40,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 01:06:40,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194096732] [2021-12-28 01:06:40,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:06:40,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 01:06:40,908 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:06:40,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 01:06:40,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 01:06:40,908 INFO L87 Difference]: Start difference. First operand 838 states and 1161 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 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-12-28 01:06:40,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:06:40,954 INFO L93 Difference]: Finished difference Result 1558 states and 2180 transitions. [2021-12-28 01:06:40,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 01:06:40,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 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 98 [2021-12-28 01:06:40,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:06:40,957 INFO L225 Difference]: With dead ends: 1558 [2021-12-28 01:06:40,957 INFO L226 Difference]: Without dead ends: 862 [2021-12-28 01:06:40,959 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 01:06:40,959 INFO L933 BasicCegarLoop]: 289 mSDtfsCounter, 7 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 01:06:40,959 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 857 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 01:06:40,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2021-12-28 01:06:40,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 862. [2021-12-28 01:06:40,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 680 states have (on average 1.3720588235294118) internal successors, (933), 683 states have internal predecessors, (933), 124 states have call successors, (124), 57 states have call predecessors, (124), 57 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2021-12-28 01:06:40,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1181 transitions. [2021-12-28 01:06:40,989 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1181 transitions. Word has length 98 [2021-12-28 01:06:40,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:06:40,989 INFO L470 AbstractCegarLoop]: Abstraction has 862 states and 1181 transitions. [2021-12-28 01:06:40,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 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-12-28 01:06:40,990 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1181 transitions. [2021-12-28 01:06:40,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-12-28 01:06:40,997 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:06:40,997 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:06:40,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-28 01:06:40,997 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:06:40,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:06:40,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1039496388, now seen corresponding path program 1 times [2021-12-28 01:06:40,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:06:40,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70522635] [2021-12-28 01:06:40,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:06:40,998 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:06:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:41,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 01:06:41,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:41,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-28 01:06:41,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:41,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 01:06:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:41,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-28 01:06:41,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:41,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 01:06:41,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:41,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-28 01:06:41,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:41,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-28 01:06:41,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:41,094 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-28 01:06:41,094 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:06:41,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70522635] [2021-12-28 01:06:41,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70522635] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:06:41,095 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:06:41,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 01:06:41,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253619030] [2021-12-28 01:06:41,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:06:41,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 01:06:41,095 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:06:41,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 01:06:41,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 01:06:41,096 INFO L87 Difference]: Start difference. First operand 862 states and 1181 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 6 states have internal predecessors, (80), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-28 01:06:41,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:06:41,299 INFO L93 Difference]: Finished difference Result 2467 states and 3431 transitions. [2021-12-28 01:06:41,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 01:06:41,299 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 6 states have internal predecessors, (80), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 101 [2021-12-28 01:06:41,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:06:41,305 INFO L225 Difference]: With dead ends: 2467 [2021-12-28 01:06:41,305 INFO L226 Difference]: Without dead ends: 1747 [2021-12-28 01:06:41,322 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-28 01:06:41,323 INFO L933 BasicCegarLoop]: 411 mSDtfsCounter, 391 mSDsluCounter, 1849 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 2260 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 01:06:41,323 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [409 Valid, 2260 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 01:06:41,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1747 states. [2021-12-28 01:06:41,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1747 to 1146. [2021-12-28 01:06:41,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 891 states have (on average 1.3636363636363635) internal successors, (1215), 896 states have internal predecessors, (1215), 172 states have call successors, (172), 82 states have call predecessors, (172), 82 states have return successors, (172), 167 states have call predecessors, (172), 172 states have call successors, (172) [2021-12-28 01:06:41,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1559 transitions. [2021-12-28 01:06:41,378 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1559 transitions. Word has length 101 [2021-12-28 01:06:41,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:06:41,378 INFO L470 AbstractCegarLoop]: Abstraction has 1146 states and 1559 transitions. [2021-12-28 01:06:41,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 6 states have internal predecessors, (80), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-28 01:06:41,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1559 transitions. [2021-12-28 01:06:41,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-12-28 01:06:41,379 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:06:41,380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:06:41,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-28 01:06:41,380 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:06:41,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:06:41,380 INFO L85 PathProgramCache]: Analyzing trace with hash -410105680, now seen corresponding path program 1 times [2021-12-28 01:06:41,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:06:41,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519650717] [2021-12-28 01:06:41,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:06:41,380 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:06:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:41,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 01:06:41,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:41,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-28 01:06:41,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:41,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 01:06:41,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:41,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-28 01:06:41,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:41,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 01:06:41,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:41,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-28 01:06:41,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:41,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-28 01:06:41,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:41,445 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-28 01:06:41,445 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:06:41,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519650717] [2021-12-28 01:06:41,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519650717] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:06:41,445 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:06:41,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 01:06:41,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291044036] [2021-12-28 01:06:41,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:06:41,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 01:06:41,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:06:41,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 01:06:41,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 01:06:41,446 INFO L87 Difference]: Start difference. First operand 1146 states and 1559 transitions. Second operand has 6 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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-12-28 01:06:41,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:06:41,579 INFO L93 Difference]: Finished difference Result 1611 states and 2289 transitions. [2021-12-28 01:06:41,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 01:06:41,580 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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 104 [2021-12-28 01:06:41,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:06:41,585 INFO L225 Difference]: With dead ends: 1611 [2021-12-28 01:06:41,585 INFO L226 Difference]: Without dead ends: 1609 [2021-12-28 01:06:41,586 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 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-12-28 01:06:41,586 INFO L933 BasicCegarLoop]: 509 mSDtfsCounter, 255 mSDsluCounter, 1722 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 2231 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 01:06:41,586 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [277 Valid, 2231 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 01:06:41,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states. [2021-12-28 01:06:41,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 1154. [2021-12-28 01:06:41,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 895 states have (on average 1.3620111731843576) internal successors, (1219), 902 states have internal predecessors, (1219), 174 states have call successors, (174), 84 states have call predecessors, (174), 84 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2021-12-28 01:06:41,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1567 transitions. [2021-12-28 01:06:41,655 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1567 transitions. Word has length 104 [2021-12-28 01:06:41,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:06:41,655 INFO L470 AbstractCegarLoop]: Abstraction has 1154 states and 1567 transitions. [2021-12-28 01:06:41,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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-12-28 01:06:41,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1567 transitions. [2021-12-28 01:06:41,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-12-28 01:06:41,656 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:06:41,656 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:06:41,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-28 01:06:41,656 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:06:41,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:06:41,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1945149666, now seen corresponding path program 1 times [2021-12-28 01:06:41,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:06:41,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918003859] [2021-12-28 01:06:41,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:06:41,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:06:41,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:41,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 01:06:41,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:41,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-28 01:06:41,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:41,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 01:06:41,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:41,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-28 01:06:41,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:41,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 01:06:41,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:41,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-28 01:06:41,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:41,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-28 01:06:41,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:41,708 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-28 01:06:41,708 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:06:41,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918003859] [2021-12-28 01:06:41,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918003859] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:06:41,709 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:06:41,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 01:06:41,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032374233] [2021-12-28 01:06:41,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:06:41,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 01:06:41,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:06:41,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 01:06:41,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 01:06:41,709 INFO L87 Difference]: Start difference. First operand 1154 states and 1567 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 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-12-28 01:06:41,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:06:41,787 INFO L93 Difference]: Finished difference Result 2122 states and 2904 transitions. [2021-12-28 01:06:41,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 01:06:41,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 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 105 [2021-12-28 01:06:41,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:06:41,791 INFO L225 Difference]: With dead ends: 2122 [2021-12-28 01:06:41,791 INFO L226 Difference]: Without dead ends: 1178 [2021-12-28 01:06:41,793 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 01:06:41,793 INFO L933 BasicCegarLoop]: 290 mSDtfsCounter, 5 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 01:06:41,793 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 855 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 01:06:41,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2021-12-28 01:06:41,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1178. [2021-12-28 01:06:41,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1178 states, 913 states have (on average 1.3548740416210296) internal successors, (1237), 920 states have internal predecessors, (1237), 174 states have call successors, (174), 90 states have call predecessors, (174), 90 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2021-12-28 01:06:41,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 1585 transitions. [2021-12-28 01:06:41,848 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 1585 transitions. Word has length 105 [2021-12-28 01:06:41,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:06:41,848 INFO L470 AbstractCegarLoop]: Abstraction has 1178 states and 1585 transitions. [2021-12-28 01:06:41,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 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-12-28 01:06:41,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1585 transitions. [2021-12-28 01:06:41,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-12-28 01:06:41,849 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:06:41,849 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:06:41,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-28 01:06:41,849 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:06:41,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:06:41,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1810984556, now seen corresponding path program 1 times [2021-12-28 01:06:41,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:06:41,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104579040] [2021-12-28 01:06:41,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:06:41,850 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:06:41,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:41,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 01:06:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:41,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-28 01:06:41,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:41,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 01:06:41,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:41,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-28 01:06:41,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:41,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 01:06:41,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:41,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-28 01:06:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:41,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-28 01:06:41,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:41,914 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-28 01:06:41,914 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:06:41,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104579040] [2021-12-28 01:06:41,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104579040] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:06:41,914 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:06:41,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 01:06:41,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345962768] [2021-12-28 01:06:41,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:06:41,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 01:06:41,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:06:41,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 01:06:41,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 01:06:41,915 INFO L87 Difference]: Start difference. First operand 1178 states and 1585 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-28 01:06:42,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:06:42,092 INFO L93 Difference]: Finished difference Result 2408 states and 3282 transitions. [2021-12-28 01:06:42,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 01:06:42,092 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 107 [2021-12-28 01:06:42,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:06:42,097 INFO L225 Difference]: With dead ends: 2408 [2021-12-28 01:06:42,097 INFO L226 Difference]: Without dead ends: 1522 [2021-12-28 01:06:42,099 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-28 01:06:42,099 INFO L933 BasicCegarLoop]: 404 mSDtfsCounter, 513 mSDsluCounter, 1827 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 2231 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 01:06:42,100 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [518 Valid, 2231 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 01:06:42,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states. [2021-12-28 01:06:42,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1224. [2021-12-28 01:06:42,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 970 states have (on average 1.3443298969072166) internal successors, (1304), 982 states have internal predecessors, (1304), 162 states have call successors, (162), 91 states have call predecessors, (162), 91 states have return successors, (162), 150 states have call predecessors, (162), 162 states have call successors, (162) [2021-12-28 01:06:42,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1628 transitions. [2021-12-28 01:06:42,165 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1628 transitions. Word has length 107 [2021-12-28 01:06:42,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:06:42,165 INFO L470 AbstractCegarLoop]: Abstraction has 1224 states and 1628 transitions. [2021-12-28 01:06:42,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-28 01:06:42,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1628 transitions. [2021-12-28 01:06:42,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-12-28 01:06:42,166 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:06:42,166 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:06:42,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-28 01:06:42,166 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:06:42,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:06:42,166 INFO L85 PathProgramCache]: Analyzing trace with hash 687723298, now seen corresponding path program 1 times [2021-12-28 01:06:42,166 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:06:42,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839757010] [2021-12-28 01:06:42,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:06:42,167 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:06:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:42,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 01:06:42,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:42,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-28 01:06:42,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:42,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 01:06:42,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:42,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-28 01:06:42,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:42,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 01:06:42,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:42,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-28 01:06:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:42,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-28 01:06:42,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:42,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-28 01:06:42,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:42,255 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-28 01:06:42,255 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:06:42,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839757010] [2021-12-28 01:06:42,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839757010] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:06:42,255 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:06:42,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 01:06:42,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261590257] [2021-12-28 01:06:42,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:06:42,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 01:06:42,256 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:06:42,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 01:06:42,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 01:06:42,256 INFO L87 Difference]: Start difference. First operand 1224 states and 1628 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 3 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-12-28 01:06:42,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:06:42,534 INFO L93 Difference]: Finished difference Result 2518 states and 3425 transitions. [2021-12-28 01:06:42,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 01:06:42,536 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 3 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 109 [2021-12-28 01:06:42,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:06:42,541 INFO L225 Difference]: With dead ends: 2518 [2021-12-28 01:06:42,541 INFO L226 Difference]: Without dead ends: 1566 [2021-12-28 01:06:42,543 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-28 01:06:42,544 INFO L933 BasicCegarLoop]: 434 mSDtfsCounter, 395 mSDsluCounter, 1947 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 2381 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 01:06:42,544 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [409 Valid, 2381 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 01:06:42,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2021-12-28 01:06:42,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1110. [2021-12-28 01:06:42,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 883 states have (on average 1.345413363533409) internal successors, (1188), 893 states have internal predecessors, (1188), 145 states have call successors, (145), 81 states have call predecessors, (145), 81 states have return successors, (145), 135 states have call predecessors, (145), 145 states have call successors, (145) [2021-12-28 01:06:42,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1478 transitions. [2021-12-28 01:06:42,622 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1478 transitions. Word has length 109 [2021-12-28 01:06:42,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:06:42,622 INFO L470 AbstractCegarLoop]: Abstraction has 1110 states and 1478 transitions. [2021-12-28 01:06:42,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 3 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-12-28 01:06:42,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1478 transitions. [2021-12-28 01:06:42,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-12-28 01:06:42,623 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:06:42,624 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:06:42,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-28 01:06:42,624 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:06:42,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:06:42,624 INFO L85 PathProgramCache]: Analyzing trace with hash 943897966, now seen corresponding path program 1 times [2021-12-28 01:06:42,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:06:42,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667486484] [2021-12-28 01:06:42,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:06:42,625 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:06:42,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:42,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 01:06:42,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:42,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-28 01:06:42,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:42,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 01:06:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:42,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-28 01:06:42,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:42,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 01:06:42,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:42,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-28 01:06:42,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:42,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-28 01:06:42,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:42,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 01:06:42,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:42,749 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-28 01:06:42,749 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:06:42,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667486484] [2021-12-28 01:06:42,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667486484] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:06:42,749 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:06:42,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 01:06:42,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481394371] [2021-12-28 01:06:42,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:06:42,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 01:06:42,750 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:06:42,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 01:06:42,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-28 01:06:42,751 INFO L87 Difference]: Start difference. First operand 1110 states and 1478 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 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-12-28 01:06:43,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:06:43,287 INFO L93 Difference]: Finished difference Result 2589 states and 3532 transitions. [2021-12-28 01:06:43,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 01:06:43,287 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 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 110 [2021-12-28 01:06:43,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:06:43,293 INFO L225 Difference]: With dead ends: 2589 [2021-12-28 01:06:43,293 INFO L226 Difference]: Without dead ends: 1671 [2021-12-28 01:06:43,295 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-12-28 01:06:43,296 INFO L933 BasicCegarLoop]: 501 mSDtfsCounter, 1030 mSDsluCounter, 1628 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1036 SdHoareTripleChecker+Valid, 2129 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 01:06:43,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1036 Valid, 2129 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 01:06:43,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2021-12-28 01:06:43,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1126. [2021-12-28 01:06:43,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 891 states have (on average 1.3254769921436589) internal successors, (1181), 902 states have internal predecessors, (1181), 148 states have call successors, (148), 86 states have call predecessors, (148), 86 states have return successors, (148), 137 states have call predecessors, (148), 148 states have call successors, (148) [2021-12-28 01:06:43,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1477 transitions. [2021-12-28 01:06:43,401 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1477 transitions. Word has length 110 [2021-12-28 01:06:43,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:06:43,401 INFO L470 AbstractCegarLoop]: Abstraction has 1126 states and 1477 transitions. [2021-12-28 01:06:43,401 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 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-12-28 01:06:43,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1477 transitions. [2021-12-28 01:06:43,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-12-28 01:06:43,402 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:06:43,403 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:06:43,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-28 01:06:43,403 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:06:43,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:06:43,403 INFO L85 PathProgramCache]: Analyzing trace with hash 272075901, now seen corresponding path program 1 times [2021-12-28 01:06:43,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:06:43,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629384651] [2021-12-28 01:06:43,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:06:43,404 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:06:43,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:43,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 01:06:43,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:43,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-28 01:06:43,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:43,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 01:06:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:43,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-28 01:06:43,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:43,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 01:06:43,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:43,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-28 01:06:43,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:43,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-28 01:06:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:43,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 01:06:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:43,488 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-28 01:06:43,488 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:06:43,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629384651] [2021-12-28 01:06:43,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629384651] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:06:43,488 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:06:43,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 01:06:43,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77320501] [2021-12-28 01:06:43,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:06:43,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 01:06:43,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:06:43,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 01:06:43,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 01:06:43,491 INFO L87 Difference]: Start difference. First operand 1126 states and 1477 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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-12-28 01:06:43,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:06:43,758 INFO L93 Difference]: Finished difference Result 3155 states and 4223 transitions. [2021-12-28 01:06:43,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 01:06:43,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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 110 [2021-12-28 01:06:43,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:06:43,768 INFO L225 Difference]: With dead ends: 3155 [2021-12-28 01:06:43,768 INFO L226 Difference]: Without dead ends: 2272 [2021-12-28 01:06:43,770 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 01:06:43,771 INFO L933 BasicCegarLoop]: 503 mSDtfsCounter, 434 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 01:06:43,771 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [434 Valid, 1211 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 01:06:43,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2272 states. [2021-12-28 01:06:43,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2272 to 1915. [2021-12-28 01:06:43,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1915 states, 1490 states have (on average 1.323489932885906) internal successors, (1972), 1509 states have internal predecessors, (1972), 272 states have call successors, (272), 152 states have call predecessors, (272), 152 states have return successors, (272), 253 states have call predecessors, (272), 272 states have call successors, (272) [2021-12-28 01:06:43,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1915 states to 1915 states and 2516 transitions. [2021-12-28 01:06:43,963 INFO L78 Accepts]: Start accepts. Automaton has 1915 states and 2516 transitions. Word has length 110 [2021-12-28 01:06:43,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:06:43,964 INFO L470 AbstractCegarLoop]: Abstraction has 1915 states and 2516 transitions. [2021-12-28 01:06:43,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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-12-28 01:06:43,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 2516 transitions. [2021-12-28 01:06:43,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-12-28 01:06:43,965 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:06:43,966 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:06:43,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-28 01:06:43,966 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:06:43,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:06:43,967 INFO L85 PathProgramCache]: Analyzing trace with hash 173907826, now seen corresponding path program 1 times [2021-12-28 01:06:43,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:06:43,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791846324] [2021-12-28 01:06:43,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:06:43,967 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:06:43,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:44,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 01:06:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:44,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-28 01:06:44,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:44,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 01:06:44,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:44,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-28 01:06:44,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:44,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 01:06:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:44,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-28 01:06:44,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:44,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-28 01:06:44,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:44,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 01:06:44,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:44,072 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-28 01:06:44,072 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:06:44,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791846324] [2021-12-28 01:06:44,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791846324] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:06:44,072 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:06:44,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 01:06:44,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693608191] [2021-12-28 01:06:44,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:06:44,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 01:06:44,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:06:44,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 01:06:44,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 01:06:44,074 INFO L87 Difference]: Start difference. First operand 1915 states and 2516 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 states have internal predecessors, (89), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-28 01:06:44,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:06:44,842 INFO L93 Difference]: Finished difference Result 4352 states and 5848 transitions. [2021-12-28 01:06:44,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 01:06:44,842 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 states have internal predecessors, (89), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 112 [2021-12-28 01:06:44,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:06:44,853 INFO L225 Difference]: With dead ends: 4352 [2021-12-28 01:06:44,854 INFO L226 Difference]: Without dead ends: 2774 [2021-12-28 01:06:44,857 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-12-28 01:06:44,857 INFO L933 BasicCegarLoop]: 570 mSDtfsCounter, 788 mSDsluCounter, 1912 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 2482 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 01:06:44,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [791 Valid, 2482 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-28 01:06:44,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2774 states. [2021-12-28 01:06:45,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2774 to 1936. [2021-12-28 01:06:45,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1936 states, 1498 states have (on average 1.3190921228304406) internal successors, (1976), 1518 states have internal predecessors, (1976), 280 states have call successors, (280), 157 states have call predecessors, (280), 157 states have return successors, (280), 260 states have call predecessors, (280), 280 states have call successors, (280) [2021-12-28 01:06:45,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1936 states and 2536 transitions. [2021-12-28 01:06:45,094 INFO L78 Accepts]: Start accepts. Automaton has 1936 states and 2536 transitions. Word has length 112 [2021-12-28 01:06:45,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:06:45,095 INFO L470 AbstractCegarLoop]: Abstraction has 1936 states and 2536 transitions. [2021-12-28 01:06:45,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 states have internal predecessors, (89), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-28 01:06:45,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 2536 transitions. [2021-12-28 01:06:45,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-12-28 01:06:45,097 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:06:45,097 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:06:45,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-28 01:06:45,098 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:06:45,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:06:45,098 INFO L85 PathProgramCache]: Analyzing trace with hash 540191593, now seen corresponding path program 1 times [2021-12-28 01:06:45,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:06:45,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092637705] [2021-12-28 01:06:45,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:06:45,099 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:06:45,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:45,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 01:06:45,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:45,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-28 01:06:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:45,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-28 01:06:45,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:45,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 01:06:45,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:45,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-28 01:06:45,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:45,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-28 01:06:45,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:45,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-28 01:06:45,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:45,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-28 01:06:45,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:45,166 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-28 01:06:45,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:06:45,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092637705] [2021-12-28 01:06:45,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092637705] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:06:45,167 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:06:45,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 01:06:45,167 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040581258] [2021-12-28 01:06:45,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:06:45,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 01:06:45,168 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:06:45,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 01:06:45,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 01:06:45,169 INFO L87 Difference]: Start difference. First operand 1936 states and 2536 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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-12-28 01:06:45,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:06:45,542 INFO L93 Difference]: Finished difference Result 5122 states and 6787 transitions. [2021-12-28 01:06:45,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 01:06:45,542 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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 113 [2021-12-28 01:06:45,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:06:45,554 INFO L225 Difference]: With dead ends: 5122 [2021-12-28 01:06:45,554 INFO L226 Difference]: Without dead ends: 3560 [2021-12-28 01:06:45,558 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 01:06:45,558 INFO L933 BasicCegarLoop]: 519 mSDtfsCounter, 481 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 01:06:45,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [481 Valid, 1275 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 01:06:45,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3560 states. [2021-12-28 01:06:45,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3560 to 2987. [2021-12-28 01:06:45,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2987 states, 2274 states have (on average 1.3153034300791557) internal successors, (2991), 2305 states have internal predecessors, (2991), 460 states have call successors, (460), 252 states have call predecessors, (460), 252 states have return successors, (460), 429 states have call predecessors, (460), 460 states have call successors, (460) [2021-12-28 01:06:45,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2987 states to 2987 states and 3911 transitions. [2021-12-28 01:06:45,786 INFO L78 Accepts]: Start accepts. Automaton has 2987 states and 3911 transitions. Word has length 113 [2021-12-28 01:06:45,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:06:45,787 INFO L470 AbstractCegarLoop]: Abstraction has 2987 states and 3911 transitions. [2021-12-28 01:06:45,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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-12-28 01:06:45,787 INFO L276 IsEmpty]: Start isEmpty. Operand 2987 states and 3911 transitions. [2021-12-28 01:06:45,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-12-28 01:06:45,789 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:06:45,789 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:06:45,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-28 01:06:45,789 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:06:45,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:06:45,790 INFO L85 PathProgramCache]: Analyzing trace with hash -290051495, now seen corresponding path program 1 times [2021-12-28 01:06:45,790 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:06:45,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594304186] [2021-12-28 01:06:45,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:06:45,790 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:06:45,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:45,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 01:06:45,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:45,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 01:06:45,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:45,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-28 01:06:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:45,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-28 01:06:45,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:45,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-28 01:06:45,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:45,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-28 01:06:45,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:45,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-28 01:06:45,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:45,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-28 01:06:45,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:45,845 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-28 01:06:45,845 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:06:45,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594304186] [2021-12-28 01:06:45,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594304186] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:06:45,846 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:06:45,846 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 01:06:45,846 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182360236] [2021-12-28 01:06:45,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:06:45,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 01:06:45,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:06:45,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 01:06:45,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 01:06:45,847 INFO L87 Difference]: Start difference. First operand 2987 states and 3911 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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-12-28 01:06:46,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:06:46,232 INFO L93 Difference]: Finished difference Result 7078 states and 9333 transitions. [2021-12-28 01:06:46,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 01:06:46,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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 113 [2021-12-28 01:06:46,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:06:46,244 INFO L225 Difference]: With dead ends: 7078 [2021-12-28 01:06:46,244 INFO L226 Difference]: Without dead ends: 4591 [2021-12-28 01:06:46,248 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 01:06:46,249 INFO L933 BasicCegarLoop]: 543 mSDtfsCounter, 428 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 01:06:46,249 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [428 Valid, 1272 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 01:06:46,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4591 states. [2021-12-28 01:06:46,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4591 to 4255. [2021-12-28 01:06:46,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4255 states, 3218 states have (on average 1.3132380360472342) internal successors, (4226), 3262 states have internal predecessors, (4226), 672 states have call successors, (672), 364 states have call predecessors, (672), 364 states have return successors, (672), 628 states have call predecessors, (672), 672 states have call successors, (672) [2021-12-28 01:06:46,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4255 states to 4255 states and 5570 transitions. [2021-12-28 01:06:46,556 INFO L78 Accepts]: Start accepts. Automaton has 4255 states and 5570 transitions. Word has length 113 [2021-12-28 01:06:46,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:06:46,556 INFO L470 AbstractCegarLoop]: Abstraction has 4255 states and 5570 transitions. [2021-12-28 01:06:46,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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-12-28 01:06:46,557 INFO L276 IsEmpty]: Start isEmpty. Operand 4255 states and 5570 transitions. [2021-12-28 01:06:46,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-12-28 01:06:46,559 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:06:46,559 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:06:46,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-28 01:06:46,560 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:06:46,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:06:46,560 INFO L85 PathProgramCache]: Analyzing trace with hash 725293879, now seen corresponding path program 1 times [2021-12-28 01:06:46,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:06:46,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006901219] [2021-12-28 01:06:46,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:06:46,560 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:06:46,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:46,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 01:06:46,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:46,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-28 01:06:46,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:46,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 01:06:46,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:46,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-12-28 01:06:46,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:46,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-28 01:06:46,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:46,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-28 01:06:46,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:46,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-28 01:06:46,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:46,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-28 01:06:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:46,600 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-28 01:06:46,601 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:06:46,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006901219] [2021-12-28 01:06:46,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006901219] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:06:46,601 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:06:46,601 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 01:06:46,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921642340] [2021-12-28 01:06:46,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:06:46,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 01:06:46,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:06:46,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 01:06:46,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 01:06:46,602 INFO L87 Difference]: Start difference. First operand 4255 states and 5570 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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-12-28 01:06:47,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:06:47,196 INFO L93 Difference]: Finished difference Result 9626 states and 13040 transitions. [2021-12-28 01:06:47,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 01:06:47,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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 114 [2021-12-28 01:06:47,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:06:47,211 INFO L225 Difference]: With dead ends: 9626 [2021-12-28 01:06:47,212 INFO L226 Difference]: Without dead ends: 5764 [2021-12-28 01:06:47,219 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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-12-28 01:06:47,220 INFO L933 BasicCegarLoop]: 452 mSDtfsCounter, 148 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 01:06:47,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 697 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 01:06:47,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5764 states. [2021-12-28 01:06:47,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5764 to 4261. [2021-12-28 01:06:47,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4261 states, 3224 states have (on average 1.3126550868486353) internal successors, (4232), 3268 states have internal predecessors, (4232), 672 states have call successors, (672), 364 states have call predecessors, (672), 364 states have return successors, (672), 628 states have call predecessors, (672), 672 states have call successors, (672) [2021-12-28 01:06:47,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4261 states to 4261 states and 5576 transitions. [2021-12-28 01:06:47,616 INFO L78 Accepts]: Start accepts. Automaton has 4261 states and 5576 transitions. Word has length 114 [2021-12-28 01:06:47,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:06:47,617 INFO L470 AbstractCegarLoop]: Abstraction has 4261 states and 5576 transitions. [2021-12-28 01:06:47,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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-12-28 01:06:47,617 INFO L276 IsEmpty]: Start isEmpty. Operand 4261 states and 5576 transitions. [2021-12-28 01:06:47,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-12-28 01:06:47,620 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:06:47,620 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:06:47,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-28 01:06:47,621 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:06:47,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:06:47,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1766585516, now seen corresponding path program 1 times [2021-12-28 01:06:47,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:06:47,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542875756] [2021-12-28 01:06:47,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:06:47,622 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:06:47,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:47,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 01:06:47,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:47,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 01:06:47,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:47,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-28 01:06:47,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:47,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-28 01:06:47,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:47,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-28 01:06:47,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:47,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-28 01:06:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:47,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-28 01:06:47,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:47,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-28 01:06:47,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:47,683 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-28 01:06:47,684 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:06:47,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542875756] [2021-12-28 01:06:47,684 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542875756] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:06:47,684 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:06:47,684 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 01:06:47,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028749946] [2021-12-28 01:06:47,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:06:47,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 01:06:47,685 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:06:47,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 01:06:47,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 01:06:47,686 INFO L87 Difference]: Start difference. First operand 4261 states and 5576 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-12-28 01:06:48,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:06:48,122 INFO L93 Difference]: Finished difference Result 8938 states and 11948 transitions. [2021-12-28 01:06:48,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 01:06:48,122 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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 115 [2021-12-28 01:06:48,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:06:48,137 INFO L225 Difference]: With dead ends: 8938 [2021-12-28 01:06:48,137 INFO L226 Difference]: Without dead ends: 4770 [2021-12-28 01:06:48,146 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 01:06:48,148 INFO L933 BasicCegarLoop]: 329 mSDtfsCounter, 356 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 01:06:48,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [381 Valid, 871 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 01:06:48,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4770 states. [2021-12-28 01:06:48,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4770 to 3836. [2021-12-28 01:06:48,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3836 states, 2882 states have (on average 1.3178348369188064) internal successors, (3798), 2916 states have internal predecessors, (3798), 620 states have call successors, (620), 333 states have call predecessors, (620), 333 states have return successors, (620), 586 states have call predecessors, (620), 620 states have call successors, (620) [2021-12-28 01:06:48,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3836 states to 3836 states and 5038 transitions. [2021-12-28 01:06:48,475 INFO L78 Accepts]: Start accepts. Automaton has 3836 states and 5038 transitions. Word has length 115 [2021-12-28 01:06:48,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:06:48,475 INFO L470 AbstractCegarLoop]: Abstraction has 3836 states and 5038 transitions. [2021-12-28 01:06:48,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-12-28 01:06:48,476 INFO L276 IsEmpty]: Start isEmpty. Operand 3836 states and 5038 transitions. [2021-12-28 01:06:48,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-12-28 01:06:48,477 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:06:48,477 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:06:48,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-28 01:06:48,477 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:06:48,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:06:48,478 INFO L85 PathProgramCache]: Analyzing trace with hash -723784830, now seen corresponding path program 1 times [2021-12-28 01:06:48,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:06:48,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000407233] [2021-12-28 01:06:48,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:06:48,478 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:06:48,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:48,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 01:06:48,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:48,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-28 01:06:48,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:48,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 01:06:48,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:48,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-12-28 01:06:48,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:48,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-28 01:06:48,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:48,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-28 01:06:48,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:48,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-28 01:06:48,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:48,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-28 01:06:48,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:48,521 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-28 01:06:48,521 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:06:48,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000407233] [2021-12-28 01:06:48,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000407233] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:06:48,522 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:06:48,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 01:06:48,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763085405] [2021-12-28 01:06:48,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:06:48,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 01:06:48,524 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:06:48,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 01:06:48,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 01:06:48,524 INFO L87 Difference]: Start difference. First operand 3836 states and 5038 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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-12-28 01:06:48,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:06:48,977 INFO L93 Difference]: Finished difference Result 8444 states and 11382 transitions. [2021-12-28 01:06:48,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 01:06:48,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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 116 [2021-12-28 01:06:48,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:06:48,990 INFO L225 Difference]: With dead ends: 8444 [2021-12-28 01:06:48,990 INFO L226 Difference]: Without dead ends: 4815 [2021-12-28 01:06:48,996 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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-12-28 01:06:48,997 INFO L933 BasicCegarLoop]: 432 mSDtfsCounter, 148 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 01:06:48,997 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 674 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 01:06:49,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4815 states. [2021-12-28 01:06:49,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4815 to 3846. [2021-12-28 01:06:49,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3846 states, 2892 states have (on average 1.3167358229598893) internal successors, (3808), 2926 states have internal predecessors, (3808), 620 states have call successors, (620), 333 states have call predecessors, (620), 333 states have return successors, (620), 586 states have call predecessors, (620), 620 states have call successors, (620) [2021-12-28 01:06:49,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3846 states to 3846 states and 5048 transitions. [2021-12-28 01:06:49,266 INFO L78 Accepts]: Start accepts. Automaton has 3846 states and 5048 transitions. Word has length 116 [2021-12-28 01:06:49,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:06:49,267 INFO L470 AbstractCegarLoop]: Abstraction has 3846 states and 5048 transitions. [2021-12-28 01:06:49,267 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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-12-28 01:06:49,267 INFO L276 IsEmpty]: Start isEmpty. Operand 3846 states and 5048 transitions. [2021-12-28 01:06:49,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-12-28 01:06:49,268 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:06:49,268 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:06:49,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-28 01:06:49,269 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:06:49,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:06:49,269 INFO L85 PathProgramCache]: Analyzing trace with hash -440834179, now seen corresponding path program 1 times [2021-12-28 01:06:49,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:06:49,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943926379] [2021-12-28 01:06:49,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:06:49,269 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:06:49,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:49,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 01:06:49,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:49,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-28 01:06:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:49,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 01:06:49,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:49,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-12-28 01:06:49,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:49,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-28 01:06:49,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:49,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-28 01:06:49,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:49,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-28 01:06:49,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:49,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-28 01:06:49,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:49,339 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-28 01:06:49,339 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:06:49,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943926379] [2021-12-28 01:06:49,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943926379] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:06:49,340 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:06:49,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 01:06:49,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484846018] [2021-12-28 01:06:49,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:06:49,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 01:06:49,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:06:49,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 01:06:49,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 01:06:49,344 INFO L87 Difference]: Start difference. First operand 3846 states and 5048 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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-12-28 01:06:49,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:06:49,707 INFO L93 Difference]: Finished difference Result 8395 states and 11302 transitions. [2021-12-28 01:06:49,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 01:06:49,708 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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 116 [2021-12-28 01:06:49,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:06:49,719 INFO L225 Difference]: With dead ends: 8395 [2021-12-28 01:06:49,719 INFO L226 Difference]: Without dead ends: 4691 [2021-12-28 01:06:49,725 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 01:06:49,726 INFO L933 BasicCegarLoop]: 354 mSDtfsCounter, 271 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 01:06:49,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [296 Valid, 902 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 01:06:49,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4691 states. [2021-12-28 01:06:49,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4691 to 2895. [2021-12-28 01:06:49,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2895 states, 2175 states have (on average 1.3066666666666666) internal successors, (2842), 2194 states have internal predecessors, (2842), 469 states have call successors, (469), 250 states have call predecessors, (469), 250 states have return successors, (469), 450 states have call predecessors, (469), 469 states have call successors, (469) [2021-12-28 01:06:49,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2895 states to 2895 states and 3780 transitions. [2021-12-28 01:06:49,961 INFO L78 Accepts]: Start accepts. Automaton has 2895 states and 3780 transitions. Word has length 116 [2021-12-28 01:06:49,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:06:49,962 INFO L470 AbstractCegarLoop]: Abstraction has 2895 states and 3780 transitions. [2021-12-28 01:06:49,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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-12-28 01:06:49,962 INFO L276 IsEmpty]: Start isEmpty. Operand 2895 states and 3780 transitions. [2021-12-28 01:06:49,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-12-28 01:06:49,966 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:06:49,966 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:06:49,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-28 01:06:49,967 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:06:49,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:06:49,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1943845531, now seen corresponding path program 1 times [2021-12-28 01:06:49,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:06:49,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207653335] [2021-12-28 01:06:49,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:06:49,968 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:06:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:50,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 01:06:50,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:50,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-28 01:06:50,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:50,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 01:06:50,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:50,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-28 01:06:50,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:50,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 01:06:50,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:50,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-28 01:06:50,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:50,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-28 01:06:50,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:50,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-28 01:06:50,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:50,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-12-28 01:06:50,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:50,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-28 01:06:50,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:50,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-12-28 01:06:50,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:50,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-28 01:06:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:50,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2021-12-28 01:06:50,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:50,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2021-12-28 01:06:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:50,136 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 16 proven. 28 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-28 01:06:50,136 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:06:50,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207653335] [2021-12-28 01:06:50,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207653335] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:06:50,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069776305] [2021-12-28 01:06:50,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:06:50,137 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:06:50,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:06:50,161 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 01:06:50,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-28 01:06:50,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:50,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-28 01:06:50,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:06:50,695 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 77 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-28 01:06:50,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 01:06:51,001 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 44 proven. 2 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2021-12-28 01:06:51,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069776305] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 01:06:51,002 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 01:06:51,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2021-12-28 01:06:51,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670422414] [2021-12-28 01:06:51,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 01:06:51,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-28 01:06:51,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:06:51,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-28 01:06:51,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2021-12-28 01:06:51,004 INFO L87 Difference]: Start difference. First operand 2895 states and 3780 transitions. Second operand has 14 states, 14 states have (on average 18.571428571428573) internal successors, (260), 13 states have internal predecessors, (260), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2021-12-28 01:06:54,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:06:54,157 INFO L93 Difference]: Finished difference Result 9922 states and 13848 transitions. [2021-12-28 01:06:54,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-12-28 01:06:54,157 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 18.571428571428573) internal successors, (260), 13 states have internal predecessors, (260), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) Word has length 184 [2021-12-28 01:06:54,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:06:54,177 INFO L225 Difference]: With dead ends: 9922 [2021-12-28 01:06:54,177 INFO L226 Difference]: Without dead ends: 7306 [2021-12-28 01:06:54,183 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 400 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1358 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=749, Invalid=3411, Unknown=0, NotChecked=0, Total=4160 [2021-12-28 01:06:54,183 INFO L933 BasicCegarLoop]: 334 mSDtfsCounter, 4409 mSDsluCounter, 2924 mSDsCounter, 0 mSdLazyCounter, 2010 mSolverCounterSat, 1308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4409 SdHoareTripleChecker+Valid, 3258 SdHoareTripleChecker+Invalid, 3318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1308 IncrementalHoareTripleChecker+Valid, 2010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-12-28 01:06:54,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4409 Valid, 3258 Invalid, 3318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1308 Valid, 2010 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-12-28 01:06:54,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7306 states. [2021-12-28 01:06:54,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7306 to 3419. [2021-12-28 01:06:54,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3419 states, 2592 states have (on average 1.3036265432098766) internal successors, (3379), 2612 states have internal predecessors, (3379), 531 states have call successors, (531), 295 states have call predecessors, (531), 295 states have return successors, (531), 511 states have call predecessors, (531), 531 states have call successors, (531) [2021-12-28 01:06:54,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3419 states to 3419 states and 4441 transitions. [2021-12-28 01:06:54,500 INFO L78 Accepts]: Start accepts. Automaton has 3419 states and 4441 transitions. Word has length 184 [2021-12-28 01:06:54,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:06:54,500 INFO L470 AbstractCegarLoop]: Abstraction has 3419 states and 4441 transitions. [2021-12-28 01:06:54,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 18.571428571428573) internal successors, (260), 13 states have internal predecessors, (260), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2021-12-28 01:06:54,501 INFO L276 IsEmpty]: Start isEmpty. Operand 3419 states and 4441 transitions. [2021-12-28 01:06:54,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2021-12-28 01:06:54,505 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:06:54,505 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-12-28 01:06:54,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-28 01:06:54,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-12-28 01:06:54,719 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:06:54,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:06:54,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1757506182, now seen corresponding path program 1 times [2021-12-28 01:06:54,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:06:54,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719474548] [2021-12-28 01:06:54,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:06:54,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:06:54,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:54,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 01:06:54,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:54,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-28 01:06:54,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:54,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 01:06:54,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:54,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-28 01:06:54,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:54,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 01:06:54,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:54,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-28 01:06:54,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:54,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-28 01:06:54,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:54,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-28 01:06:54,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:54,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-28 01:06:54,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:54,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-12-28 01:06:54,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:54,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-12-28 01:06:54,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:54,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-28 01:06:54,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:54,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2021-12-28 01:06:54,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:54,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2021-12-28 01:06:54,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:54,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2021-12-28 01:06:54,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:54,871 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 16 proven. 23 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2021-12-28 01:06:54,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:06:54,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719474548] [2021-12-28 01:06:54,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719474548] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:06:54,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186197849] [2021-12-28 01:06:54,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:06:54,872 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:06:54,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:06:54,885 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 01:06:54,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-28 01:06:55,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:06:55,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-28 01:06:55,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:06:55,413 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 36 proven. 53 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-28 01:06:55,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 01:06:55,743 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 15 proven. 26 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-12-28 01:06:55,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186197849] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 01:06:55,744 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 01:06:55,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2021-12-28 01:06:55,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992811806] [2021-12-28 01:06:55,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 01:06:55,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-28 01:06:55,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:06:55,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-28 01:06:55,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-12-28 01:06:55,746 INFO L87 Difference]: Start difference. First operand 3419 states and 4441 transitions. Second operand has 16 states, 16 states have (on average 16.375) internal successors, (262), 14 states have internal predecessors, (262), 6 states have call successors, (43), 4 states have call predecessors, (43), 7 states have return successors, (42), 8 states have call predecessors, (42), 6 states have call successors, (42) [2021-12-28 01:07:03,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:07:03,547 INFO L93 Difference]: Finished difference Result 17212 states and 23325 transitions. [2021-12-28 01:07:03,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2021-12-28 01:07:03,548 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 16.375) internal successors, (262), 14 states have internal predecessors, (262), 6 states have call successors, (43), 4 states have call predecessors, (43), 7 states have return successors, (42), 8 states have call predecessors, (42), 6 states have call successors, (42) Word has length 192 [2021-12-28 01:07:03,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:07:03,591 INFO L225 Difference]: With dead ends: 17212 [2021-12-28 01:07:03,591 INFO L226 Difference]: Without dead ends: 14081 [2021-12-28 01:07:03,601 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 472 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5045 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1835, Invalid=12207, Unknown=0, NotChecked=0, Total=14042 [2021-12-28 01:07:03,602 INFO L933 BasicCegarLoop]: 1788 mSDtfsCounter, 5757 mSDsluCounter, 13477 mSDsCounter, 0 mSdLazyCounter, 5456 mSolverCounterSat, 3537 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5757 SdHoareTripleChecker+Valid, 15265 SdHoareTripleChecker+Invalid, 8993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3537 IncrementalHoareTripleChecker+Valid, 5456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2021-12-28 01:07:03,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5757 Valid, 15265 Invalid, 8993 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3537 Valid, 5456 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2021-12-28 01:07:03,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14081 states. [2021-12-28 01:07:04,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14081 to 6242. [2021-12-28 01:07:04,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6242 states, 4698 states have (on average 1.3018305661983822) internal successors, (6116), 4736 states have internal predecessors, (6116), 992 states have call successors, (992), 551 states have call predecessors, (992), 551 states have return successors, (992), 954 states have call predecessors, (992), 992 states have call successors, (992) [2021-12-28 01:07:04,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6242 states to 6242 states and 8100 transitions. [2021-12-28 01:07:04,469 INFO L78 Accepts]: Start accepts. Automaton has 6242 states and 8100 transitions. Word has length 192 [2021-12-28 01:07:04,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:07:04,472 INFO L470 AbstractCegarLoop]: Abstraction has 6242 states and 8100 transitions. [2021-12-28 01:07:04,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 16.375) internal successors, (262), 14 states have internal predecessors, (262), 6 states have call successors, (43), 4 states have call predecessors, (43), 7 states have return successors, (42), 8 states have call predecessors, (42), 6 states have call successors, (42) [2021-12-28 01:07:04,472 INFO L276 IsEmpty]: Start isEmpty. Operand 6242 states and 8100 transitions. [2021-12-28 01:07:04,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2021-12-28 01:07:04,480 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:07:04,480 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:07:04,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-28 01:07:04,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-12-28 01:07:04,711 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:07:04,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:07:04,712 INFO L85 PathProgramCache]: Analyzing trace with hash 2073750461, now seen corresponding path program 1 times [2021-12-28 01:07:04,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:07:04,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909595699] [2021-12-28 01:07:04,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:07:04,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:07:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:04,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 01:07:04,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:04,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-28 01:07:04,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:04,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-28 01:07:04,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:04,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 01:07:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:04,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-28 01:07:04,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:04,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-28 01:07:04,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:04,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-28 01:07:04,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:04,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-28 01:07:04,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:04,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-28 01:07:04,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:04,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-28 01:07:04,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:04,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2021-12-28 01:07:04,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:04,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2021-12-28 01:07:04,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:04,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-12-28 01:07:04,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:04,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2021-12-28 01:07:04,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:04,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2021-12-28 01:07:04,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:04,805 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-12-28 01:07:04,805 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:07:04,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909595699] [2021-12-28 01:07:04,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909595699] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:07:04,805 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:07:04,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 01:07:04,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965141020] [2021-12-28 01:07:04,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:07:04,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 01:07:04,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:07:04,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 01:07:04,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 01:07:04,808 INFO L87 Difference]: Start difference. First operand 6242 states and 8100 transitions. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 6 states have internal predecessors, (115), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-28 01:07:06,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:07:06,549 INFO L93 Difference]: Finished difference Result 20990 states and 27898 transitions. [2021-12-28 01:07:06,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-28 01:07:06,549 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 6 states have internal predecessors, (115), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 194 [2021-12-28 01:07:06,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:07:06,599 INFO L225 Difference]: With dead ends: 20990 [2021-12-28 01:07:06,600 INFO L226 Difference]: Without dead ends: 15098 [2021-12-28 01:07:06,617 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-12-28 01:07:06,618 INFO L933 BasicCegarLoop]: 566 mSDtfsCounter, 801 mSDsluCounter, 2482 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 3048 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 01:07:06,618 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [820 Valid, 3048 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 01:07:06,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15098 states. [2021-12-28 01:07:07,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15098 to 8084. [2021-12-28 01:07:07,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8084 states, 6028 states have (on average 1.3012607830126077) internal successors, (7844), 6079 states have internal predecessors, (7844), 1335 states have call successors, (1335), 720 states have call predecessors, (1335), 720 states have return successors, (1335), 1284 states have call predecessors, (1335), 1335 states have call successors, (1335) [2021-12-28 01:07:07,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8084 states to 8084 states and 10514 transitions. [2021-12-28 01:07:07,520 INFO L78 Accepts]: Start accepts. Automaton has 8084 states and 10514 transitions. Word has length 194 [2021-12-28 01:07:07,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:07:07,521 INFO L470 AbstractCegarLoop]: Abstraction has 8084 states and 10514 transitions. [2021-12-28 01:07:07,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 6 states have internal predecessors, (115), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-28 01:07:07,521 INFO L276 IsEmpty]: Start isEmpty. Operand 8084 states and 10514 transitions. [2021-12-28 01:07:07,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2021-12-28 01:07:07,530 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:07:07,531 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:07:07,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-28 01:07:07,531 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:07:07,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:07:07,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1452894841, now seen corresponding path program 1 times [2021-12-28 01:07:07,531 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:07:07,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906153027] [2021-12-28 01:07:07,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:07:07,532 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:07:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:07,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 01:07:07,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:07,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-28 01:07:07,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:07,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-28 01:07:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:07,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 01:07:07,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:07,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-28 01:07:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:07,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-28 01:07:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:07,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-28 01:07:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:07,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-28 01:07:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:07,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-28 01:07:07,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:07,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-28 01:07:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:07,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-12-28 01:07:07,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:07,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2021-12-28 01:07:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:07,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2021-12-28 01:07:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:07,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2021-12-28 01:07:07,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:07,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2021-12-28 01:07:07,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:07,648 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-12-28 01:07:07,648 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:07:07,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906153027] [2021-12-28 01:07:07,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906153027] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:07:07,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367135114] [2021-12-28 01:07:07,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:07:07,648 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:07:07,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:07:07,649 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 01:07:07,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-28 01:07:07,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:07,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-28 01:07:07,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:07:08,060 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 49 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-12-28 01:07:08,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 01:07:08,344 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-12-28 01:07:08,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367135114] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-28 01:07:08,345 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-28 01:07:08,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 7] total 13 [2021-12-28 01:07:08,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277586315] [2021-12-28 01:07:08,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:07:08,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 01:07:08,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:07:08,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 01:07:08,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-12-28 01:07:08,347 INFO L87 Difference]: Start difference. First operand 8084 states and 10514 transitions. Second operand has 5 states, 4 states have (on average 27.75) internal successors, (111), 5 states have internal predecessors, (111), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-28 01:07:08,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:07:08,889 INFO L93 Difference]: Finished difference Result 13320 states and 17375 transitions. [2021-12-28 01:07:08,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 01:07:08,890 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 27.75) internal successors, (111), 5 states have internal predecessors, (111), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 195 [2021-12-28 01:07:08,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:07:08,900 INFO L225 Difference]: With dead ends: 13320 [2021-12-28 01:07:08,900 INFO L226 Difference]: Without dead ends: 5440 [2021-12-28 01:07:08,906 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-12-28 01:07:08,906 INFO L933 BasicCegarLoop]: 289 mSDtfsCounter, 2 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 01:07:08,906 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 859 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 01:07:08,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5440 states. [2021-12-28 01:07:09,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5440 to 5440. [2021-12-28 01:07:09,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5440 states, 4058 states have (on average 1.3013799901429275) internal successors, (5281), 4092 states have internal predecessors, (5281), 901 states have call successors, (901), 480 states have call predecessors, (901), 480 states have return successors, (901), 867 states have call predecessors, (901), 901 states have call successors, (901) [2021-12-28 01:07:09,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5440 states to 5440 states and 7083 transitions. [2021-12-28 01:07:09,355 INFO L78 Accepts]: Start accepts. Automaton has 5440 states and 7083 transitions. Word has length 195 [2021-12-28 01:07:09,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:07:09,355 INFO L470 AbstractCegarLoop]: Abstraction has 5440 states and 7083 transitions. [2021-12-28 01:07:09,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 27.75) internal successors, (111), 5 states have internal predecessors, (111), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-28 01:07:09,356 INFO L276 IsEmpty]: Start isEmpty. Operand 5440 states and 7083 transitions. [2021-12-28 01:07:09,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2021-12-28 01:07:09,363 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:07:09,363 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-12-28 01:07:09,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-28 01:07:09,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:07:09,579 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:07:09,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:07:09,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1119904118, now seen corresponding path program 1 times [2021-12-28 01:07:09,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:07:09,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118020687] [2021-12-28 01:07:09,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:07:09,580 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:07:09,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:09,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 01:07:09,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:09,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-28 01:07:09,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:09,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-28 01:07:09,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:09,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 01:07:09,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:09,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-28 01:07:09,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:09,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-28 01:07:09,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:09,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-28 01:07:09,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:09,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-28 01:07:09,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:09,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-28 01:07:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:09,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-28 01:07:09,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:09,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-12-28 01:07:09,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:09,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2021-12-28 01:07:09,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:09,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2021-12-28 01:07:09,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:09,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2021-12-28 01:07:09,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:09,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2021-12-28 01:07:09,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:09,741 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-12-28 01:07:09,741 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:07:09,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118020687] [2021-12-28 01:07:09,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118020687] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:07:09,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586284431] [2021-12-28 01:07:09,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:07:09,741 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:07:09,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:07:09,746 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 01:07:09,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-28 01:07:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:09,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-28 01:07:09,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:07:10,223 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 51 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-12-28 01:07:10,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 01:07:10,506 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-12-28 01:07:10,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586284431] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 01:07:10,507 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 01:07:10,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 17 [2021-12-28 01:07:10,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299612599] [2021-12-28 01:07:10,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 01:07:10,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-28 01:07:10,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:07:10,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-28 01:07:10,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2021-12-28 01:07:10,508 INFO L87 Difference]: Start difference. First operand 5440 states and 7083 transitions. Second operand has 17 states, 17 states have (on average 14.352941176470589) internal successors, (244), 16 states have internal predecessors, (244), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2021-12-28 01:07:14,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:07:14,397 INFO L93 Difference]: Finished difference Result 15340 states and 20999 transitions. [2021-12-28 01:07:14,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2021-12-28 01:07:14,398 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 14.352941176470589) internal successors, (244), 16 states have internal predecessors, (244), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) Word has length 195 [2021-12-28 01:07:14,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:07:14,445 INFO L225 Difference]: With dead ends: 15340 [2021-12-28 01:07:14,446 INFO L226 Difference]: Without dead ends: 10105 [2021-12-28 01:07:14,455 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1413 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=662, Invalid=4168, Unknown=0, NotChecked=0, Total=4830 [2021-12-28 01:07:14,456 INFO L933 BasicCegarLoop]: 562 mSDtfsCounter, 3192 mSDsluCounter, 5433 mSDsCounter, 0 mSdLazyCounter, 3840 mSolverCounterSat, 1184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3192 SdHoareTripleChecker+Valid, 5995 SdHoareTripleChecker+Invalid, 5024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1184 IncrementalHoareTripleChecker+Valid, 3840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-12-28 01:07:14,456 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3192 Valid, 5995 Invalid, 5024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1184 Valid, 3840 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-12-28 01:07:14,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10105 states. [2021-12-28 01:07:15,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10105 to 6038. [2021-12-28 01:07:15,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6038 states, 4502 states have (on average 1.2972012438916036) internal successors, (5840), 4540 states have internal predecessors, (5840), 998 states have call successors, (998), 537 states have call predecessors, (998), 537 states have return successors, (998), 960 states have call predecessors, (998), 998 states have call successors, (998) [2021-12-28 01:07:15,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6038 states to 6038 states and 7836 transitions. [2021-12-28 01:07:15,160 INFO L78 Accepts]: Start accepts. Automaton has 6038 states and 7836 transitions. Word has length 195 [2021-12-28 01:07:15,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:07:15,161 INFO L470 AbstractCegarLoop]: Abstraction has 6038 states and 7836 transitions. [2021-12-28 01:07:15,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 14.352941176470589) internal successors, (244), 16 states have internal predecessors, (244), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2021-12-28 01:07:15,161 INFO L276 IsEmpty]: Start isEmpty. Operand 6038 states and 7836 transitions. [2021-12-28 01:07:15,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2021-12-28 01:07:15,168 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:07:15,168 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:07:15,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-28 01:07:15,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:07:15,384 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:07:15,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:07:15,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1845710140, now seen corresponding path program 1 times [2021-12-28 01:07:15,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:07:15,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942397367] [2021-12-28 01:07:15,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:07:15,385 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:07:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:15,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 01:07:15,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:15,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-28 01:07:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:15,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-28 01:07:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:15,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 01:07:15,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:15,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-28 01:07:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:15,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-28 01:07:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:15,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-28 01:07:15,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:15,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-28 01:07:15,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:15,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-28 01:07:15,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:15,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-28 01:07:15,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:15,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-12-28 01:07:15,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:15,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-12-28 01:07:15,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:15,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2021-12-28 01:07:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:15,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2021-12-28 01:07:15,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:15,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2021-12-28 01:07:15,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:15,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2021-12-28 01:07:15,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:15,479 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2021-12-28 01:07:15,479 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:07:15,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942397367] [2021-12-28 01:07:15,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942397367] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:07:15,480 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:07:15,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 01:07:15,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256338850] [2021-12-28 01:07:15,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:07:15,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 01:07:15,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:07:15,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 01:07:15,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-28 01:07:15,481 INFO L87 Difference]: Start difference. First operand 6038 states and 7836 transitions. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-28 01:07:16,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:07:16,093 INFO L93 Difference]: Finished difference Result 11521 states and 15006 transitions. [2021-12-28 01:07:16,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 01:07:16,094 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 203 [2021-12-28 01:07:16,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:07:16,108 INFO L225 Difference]: With dead ends: 11521 [2021-12-28 01:07:16,108 INFO L226 Difference]: Without dead ends: 5677 [2021-12-28 01:07:16,116 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-28 01:07:16,117 INFO L933 BasicCegarLoop]: 253 mSDtfsCounter, 449 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 01:07:16,117 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [449 Valid, 438 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 01:07:16,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5677 states. [2021-12-28 01:07:16,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5677 to 5677. [2021-12-28 01:07:16,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5677 states, 4235 states have (on average 1.298229043683589) internal successors, (5498), 4271 states have internal predecessors, (5498), 938 states have call successors, (938), 503 states have call predecessors, (938), 503 states have return successors, (938), 902 states have call predecessors, (938), 938 states have call successors, (938) [2021-12-28 01:07:16,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5677 states to 5677 states and 7374 transitions. [2021-12-28 01:07:16,734 INFO L78 Accepts]: Start accepts. Automaton has 5677 states and 7374 transitions. Word has length 203 [2021-12-28 01:07:16,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:07:16,734 INFO L470 AbstractCegarLoop]: Abstraction has 5677 states and 7374 transitions. [2021-12-28 01:07:16,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-28 01:07:16,735 INFO L276 IsEmpty]: Start isEmpty. Operand 5677 states and 7374 transitions. [2021-12-28 01:07:16,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2021-12-28 01:07:16,762 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:07:16,762 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:07:16,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-12-28 01:07:16,762 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:07:16,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:07:16,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1739070418, now seen corresponding path program 1 times [2021-12-28 01:07:16,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:07:16,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97182091] [2021-12-28 01:07:16,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:07:16,763 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:07:16,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:16,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 01:07:16,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:16,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-28 01:07:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:16,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-28 01:07:16,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:16,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 01:07:16,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:16,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-28 01:07:16,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:16,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-28 01:07:16,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:16,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-28 01:07:16,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:16,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-28 01:07:16,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:16,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-28 01:07:16,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:17,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-28 01:07:17,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:17,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-12-28 01:07:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:17,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2021-12-28 01:07:17,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:17,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2021-12-28 01:07:17,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:17,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2021-12-28 01:07:17,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:17,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2021-12-28 01:07:17,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:17,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2021-12-28 01:07:17,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:17,014 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 28 proven. 19 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2021-12-28 01:07:17,014 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:07:17,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97182091] [2021-12-28 01:07:17,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97182091] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:07:17,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028030465] [2021-12-28 01:07:17,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:07:17,015 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:07:17,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:07:17,036 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 01:07:17,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-28 01:07:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:17,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-28 01:07:17,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:07:17,543 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 80 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-12-28 01:07:17,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 01:07:17,833 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-12-28 01:07:17,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028030465] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 01:07:17,833 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 01:07:17,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 17 [2021-12-28 01:07:17,834 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999701334] [2021-12-28 01:07:17,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 01:07:17,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-28 01:07:17,834 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:07:17,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-28 01:07:17,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2021-12-28 01:07:17,835 INFO L87 Difference]: Start difference. First operand 5677 states and 7374 transitions. Second operand has 17 states, 17 states have (on average 15.411764705882353) internal successors, (262), 16 states have internal predecessors, (262), 6 states have call successors, (40), 4 states have call predecessors, (40), 6 states have return successors, (40), 7 states have call predecessors, (40), 6 states have call successors, (40) [2021-12-28 01:07:22,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:07:22,964 INFO L93 Difference]: Finished difference Result 16844 states and 23130 transitions. [2021-12-28 01:07:22,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-12-28 01:07:22,964 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 15.411764705882353) internal successors, (262), 16 states have internal predecessors, (262), 6 states have call successors, (40), 4 states have call predecessors, (40), 6 states have return successors, (40), 7 states have call predecessors, (40), 6 states have call successors, (40) Word has length 204 [2021-12-28 01:07:22,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:07:22,994 INFO L225 Difference]: With dead ends: 16844 [2021-12-28 01:07:22,994 INFO L226 Difference]: Without dead ends: 11372 [2021-12-28 01:07:23,004 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 441 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2055 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=886, Invalid=5594, Unknown=0, NotChecked=0, Total=6480 [2021-12-28 01:07:23,005 INFO L933 BasicCegarLoop]: 631 mSDtfsCounter, 2973 mSDsluCounter, 6257 mSDsCounter, 0 mSdLazyCounter, 5191 mSolverCounterSat, 1461 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2973 SdHoareTripleChecker+Valid, 6888 SdHoareTripleChecker+Invalid, 6652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1461 IncrementalHoareTripleChecker+Valid, 5191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-12-28 01:07:23,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2973 Valid, 6888 Invalid, 6652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1461 Valid, 5191 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2021-12-28 01:07:23,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11372 states. [2021-12-28 01:07:23,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11372 to 6321. [2021-12-28 01:07:23,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6321 states, 4723 states have (on average 1.2945161973322041) internal successors, (6114), 4763 states have internal predecessors, (6114), 1036 states have call successors, (1036), 561 states have call predecessors, (1036), 561 states have return successors, (1036), 996 states have call predecessors, (1036), 1036 states have call successors, (1036) [2021-12-28 01:07:23,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6321 states to 6321 states and 8186 transitions. [2021-12-28 01:07:23,906 INFO L78 Accepts]: Start accepts. Automaton has 6321 states and 8186 transitions. Word has length 204 [2021-12-28 01:07:23,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:07:23,906 INFO L470 AbstractCegarLoop]: Abstraction has 6321 states and 8186 transitions. [2021-12-28 01:07:23,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 15.411764705882353) internal successors, (262), 16 states have internal predecessors, (262), 6 states have call successors, (40), 4 states have call predecessors, (40), 6 states have return successors, (40), 7 states have call predecessors, (40), 6 states have call successors, (40) [2021-12-28 01:07:23,907 INFO L276 IsEmpty]: Start isEmpty. Operand 6321 states and 8186 transitions. [2021-12-28 01:07:23,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2021-12-28 01:07:23,914 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:07:23,914 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:07:23,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-28 01:07:24,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-12-28 01:07:24,128 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:07:24,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:07:24,128 INFO L85 PathProgramCache]: Analyzing trace with hash 2074523146, now seen corresponding path program 1 times [2021-12-28 01:07:24,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:07:24,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554838791] [2021-12-28 01:07:24,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:07:24,128 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:07:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:24,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 01:07:24,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:24,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-28 01:07:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:24,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-28 01:07:24,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:24,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 01:07:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:24,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-28 01:07:24,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:24,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-28 01:07:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:24,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-28 01:07:24,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:24,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-28 01:07:24,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:24,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-28 01:07:24,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:24,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2021-12-28 01:07:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:24,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-28 01:07:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:24,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-28 01:07:24,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:24,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2021-12-28 01:07:24,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:24,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2021-12-28 01:07:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:24,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2021-12-28 01:07:24,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:24,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2021-12-28 01:07:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:24,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2021-12-28 01:07:24,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:07:24,187 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2021-12-28 01:07:24,187 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:07:24,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554838791] [2021-12-28 01:07:24,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554838791] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:07:24,188 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:07:24,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 01:07:24,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726699109] [2021-12-28 01:07:24,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:07:24,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 01:07:24,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:07:24,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 01:07:24,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-28 01:07:24,189 INFO L87 Difference]: Start difference. First operand 6321 states and 8186 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-12-28 01:07:24,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:07:24,865 INFO L93 Difference]: Finished difference Result 11879 states and 15447 transitions. [2021-12-28 01:07:24,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 01:07:24,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 211 [2021-12-28 01:07:24,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:07:24,878 INFO L225 Difference]: With dead ends: 11879 [2021-12-28 01:07:24,878 INFO L226 Difference]: Without dead ends: 5754 [2021-12-28 01:07:24,889 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-28 01:07:24,890 INFO L933 BasicCegarLoop]: 261 mSDtfsCounter, 233 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 01:07:24,890 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 484 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 01:07:24,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5754 states. [2021-12-28 01:07:25,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5754 to 5746. [2021-12-28 01:07:25,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5746 states, 4302 states have (on average 1.294746629474663) internal successors, (5570), 4338 states have internal predecessors, (5570), 939 states have call successors, (939), 504 states have call predecessors, (939), 504 states have return successors, (939), 903 states have call predecessors, (939), 939 states have call successors, (939) [2021-12-28 01:07:25,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5746 states to 5746 states and 7448 transitions. [2021-12-28 01:07:25,600 INFO L78 Accepts]: Start accepts. Automaton has 5746 states and 7448 transitions. Word has length 211 [2021-12-28 01:07:25,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:07:25,600 INFO L470 AbstractCegarLoop]: Abstraction has 5746 states and 7448 transitions. [2021-12-28 01:07:25,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-12-28 01:07:25,600 INFO L276 IsEmpty]: Start isEmpty. Operand 5746 states and 7448 transitions. [2021-12-28 01:07:25,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2021-12-28 01:07:25,606 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:07:25,606 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:07:25,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-12-28 01:07:25,607 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:07:25,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:07:25,607 INFO L85 PathProgramCache]: Analyzing trace with hash 13361221, now seen corresponding path program 1 times [2021-12-28 01:07:25,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:07:25,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479367545] [2021-12-28 01:07:25,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:07:25,607 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:07:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 01:07:25,661 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 01:07:25,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 01:07:25,761 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 01:07:25,761 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-28 01:07:25,762 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-28 01:07:25,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-12-28 01:07:25,766 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:07:25,768 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-28 01:07:25,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 01:07:25 BoogieIcfgContainer [2021-12-28 01:07:25,938 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-28 01:07:25,939 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-28 01:07:25,939 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-28 01:07:25,939 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-28 01:07:25,939 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 01:06:38" (3/4) ... [2021-12-28 01:07:25,941 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-28 01:07:26,103 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-28 01:07:26,103 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-28 01:07:26,104 INFO L158 Benchmark]: Toolchain (without parser) took 48961.82ms. Allocated memory was 54.5MB in the beginning and 2.6GB in the end (delta: 2.6GB). Free memory was 30.5MB in the beginning and 2.4GB in the end (delta: -2.4GB). Peak memory consumption was 203.7MB. Max. memory is 16.1GB. [2021-12-28 01:07:26,104 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 54.5MB. Free memory is still 36.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 01:07:26,105 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.85ms. Allocated memory was 54.5MB in the beginning and 75.5MB in the end (delta: 21.0MB). Free memory was 30.3MB in the beginning and 54.5MB in the end (delta: -24.2MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2021-12-28 01:07:26,107 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.79ms. Allocated memory is still 75.5MB. Free memory was 54.5MB in the beginning and 51.1MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-28 01:07:26,110 INFO L158 Benchmark]: Boogie Preprocessor took 26.87ms. Allocated memory is still 75.5MB. Free memory was 51.1MB in the beginning and 48.6MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-28 01:07:26,110 INFO L158 Benchmark]: RCFGBuilder took 580.95ms. Allocated memory is still 75.5MB. Free memory was 48.6MB in the beginning and 37.3MB in the end (delta: 11.3MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2021-12-28 01:07:26,112 INFO L158 Benchmark]: TraceAbstraction took 47845.42ms. Allocated memory was 75.5MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 36.7MB in the beginning and 2.4GB in the end (delta: -2.4GB). Peak memory consumption was 136.5MB. Max. memory is 16.1GB. [2021-12-28 01:07:26,112 INFO L158 Benchmark]: Witness Printer took 164.53ms. Allocated memory is still 2.6GB. Free memory was 2.4GB in the beginning and 2.4GB in the end (delta: 51.9MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2021-12-28 01:07:26,112 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.16ms. Allocated memory is still 54.5MB. Free memory is still 36.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.85ms. Allocated memory was 54.5MB in the beginning and 75.5MB in the end (delta: 21.0MB). Free memory was 30.3MB in the beginning and 54.5MB in the end (delta: -24.2MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.79ms. Allocated memory is still 75.5MB. Free memory was 54.5MB in the beginning and 51.1MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.87ms. Allocated memory is still 75.5MB. Free memory was 51.1MB in the beginning and 48.6MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 580.95ms. Allocated memory is still 75.5MB. Free memory was 48.6MB in the beginning and 37.3MB in the end (delta: 11.3MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * TraceAbstraction took 47845.42ms. Allocated memory was 75.5MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 36.7MB in the beginning and 2.4GB in the end (delta: -2.4GB). Peak memory consumption was 136.5MB. Max. memory is 16.1GB. * Witness Printer took 164.53ms. Allocated memory is still 2.6GB. Free memory was 2.4GB in the beginning and 2.4GB in the end (delta: 51.9MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 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 ; VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=0, 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=0, side1Failed_History_0=0, 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] [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) VAL [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, side2_written=0] [L200] COND FALSE !((int )side2Failed_History_0 != 0) VAL [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, side2_written=0, side2Failed_History_0=0] [L203] COND FALSE !((int )active_side_History_0 != -2) VAL [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, side2_written=0, side2Failed_History_0=0] [L206] COND FALSE !((int )manual_selection_History_0 != 0) VAL [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, side2_written=0, side2Failed_History_0=0] [L209] COND FALSE !((int )side1Failed_History_1 != 0) VAL [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, side2_written=0, side2Failed_History_0=0] [L212] COND FALSE !((int )side2Failed_History_1 != 0) VAL [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, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0] [L215] COND FALSE !((int )active_side_History_1 != -2) VAL [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, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0] [L218] COND FALSE !((int )manual_selection_History_1 != 0) VAL [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, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0] [L221] COND FALSE !((int )side1Failed_History_2 != 0) VAL [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] [L224] COND FALSE !((int )side2Failed_History_2 != 0) VAL [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] [L227] COND FALSE !((int )active_side_History_2 != -2) VAL [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] [L230] COND FALSE !((int )manual_selection_History_2 != 0) [L233] return (1); VAL [\result=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] [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) VAL [\old(cond)=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cond=1, 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] [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 VAL [\old(val)=4, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=4, 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, val=4] [L257] RET write_manual_selection_history(manual_selection) [L258] EXPR manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=4, manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new=4, manual_selection_History_0=4, 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, tmp=4] [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 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=4, manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new=4, manual_selection_History_0=4, 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, tmp=4] [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection=0, manual_selection_History_0=4, 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, tmp=4] [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 VAL [\old(val)=-255, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, 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=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=-255] [L276] RET write_side1_failed_history(side1Failed) [L277] COND TRUE \read(side1Failed) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection=0, manual_selection_History_0=4, 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=0, 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] [L278] EXPR nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection=0, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new=-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=0, 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] [L278] s1s1_new = nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new [L279] EXPR nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection=0, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new=-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=0, 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] [L279] s1s2_new = nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new [L280] EXPR nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection=0, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new=-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=0, 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] [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=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection=0, manual_selection_History_0=4, 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 VAL [\old(val)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, 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=-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, val=0] [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=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection=-1, manual_selection_History_0=4, 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=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection=-1, manual_selection_History_0=4, 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 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection=-1, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new=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] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L372] EXPR next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection=-1, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new=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=0, 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] [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 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection=-1, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new=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=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] [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=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection=-1, manual_selection_History_0=4, 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=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, 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=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, 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=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, index=0, manual_selection_History_0=4, 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=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, 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 VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, 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=-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, tmp=-2] [L394] COND FALSE !((int )side1 == 1) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, 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=-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, tmp=-2] [L397] COND FALSE !((int )side2 == 1) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, 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=-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, tmp=-2] [L400] COND FALSE !((int )side1 == 0) [L407] active_side = (int8_t )0 VAL [active_side=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, 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=-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, tmp=-2] [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 VAL [\old(val)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, 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, val=0] [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 ; VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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] [L439] COND FALSE !(! side1Failed) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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] [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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cond=1, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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] [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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=4, cs2=0, cs2_new=-1, cs2_old=4, index=1, manual_selection_History_0=4, 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=4, cs2=0, cs2_new=-1, cs2_old=4, index=1, manual_selection_History_0=4, 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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=4, cs2=0, cs2_new=-1, cs2_old=4, index=1, manual_selection_History_0=4, 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=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, index=1, manual_selection_History_0=4, 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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_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] [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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=4, cs2=0, cs2_new=-1, cs2_old=4, index=0, manual_selection_History_0=4, 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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=4, cs2=0, cs2_new=-1, cs2_old=4, index=1, manual_selection_History_0=4, 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=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, index=1, manual_selection_History_0=4, 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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_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___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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=4, cs2=0, cs2_new=-1, cs2_old=4, index=1, manual_selection_History_0=4, 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=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, index=1, manual_selection_History_0=4, 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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_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___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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=4, cs2=0, cs2_new=-1, cs2_old=4, index=1, manual_selection_History_0=4, 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=4, cs2=0, cs2_new=-1, cs2_old=4, index=1, manual_selection_History_0=4, 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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=4, cs2=0, cs2_new=-1, cs2_old=4, index=2, manual_selection_History_0=4, 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=4, cs2=0, cs2_new=-1, cs2_old=4, index=2, manual_selection_History_0=4, 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=4, cs2=0, cs2_new=-1, cs2_old=4, index=2, manual_selection_History_0=4, 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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=4, cs2=0, cs2_new=-1, cs2_old=4, i2=0, manual_selection_History_0=4, 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=4, cs2=0, cs2_new=-1, cs2_old=4, i2=1, manual_selection_History_0=4, 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 VAL [\old(val)=-128, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=-128, manual_selection_History_1=4, 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, val=-128] [L257] RET write_manual_selection_history(manual_selection) [L258] EXPR manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection=-128, manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new=-128, manual_selection_History_0=-128, manual_selection_History_1=4, 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=-128] [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 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection=-128, manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new=-128, manual_selection_History_0=-128, manual_selection_History_1=4, 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=-128] [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=4, cs2=0, cs2_new=-128, cs2_old=4, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=4, 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=-128] [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 VAL [\old(val)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=4, cs2=0, cs2_new=-128, cs2_old=4, manual_selection_History_0=-128, manual_selection_History_1=4, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=4, manual_selection=4, manual_selection_History_0=-128, manual_selection_History_1=4, 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=4, manual_selection=4, manual_selection_History_0=-128, manual_selection_History_1=4, 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=4, manual_selection=4, manual_selection_History_0=-128, manual_selection_History_1=4, 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=4, manual_selection=4, manual_selection_History_0=-128, manual_selection_History_1=4, 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 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=4, manual_selection=4, manual_selection_History_0=-128, manual_selection_History_1=4, manual_selection_History_2=0, next_state=0, next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new=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] s1s1_new = next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L315] EXPR next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=4, manual_selection=4, manual_selection_History_0=-128, manual_selection_History_1=4, manual_selection_History_2=0, next_state=0, next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=0, 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] [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 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=4, manual_selection=4, manual_selection_History_0=-128, manual_selection_History_1=4, manual_selection_History_2=0, next_state=0, next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new=0, nomsg=-1, s1p=0, s1p_new=-1, 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=-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] [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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=4, manual_selection=4, manual_selection_History_0=-128, manual_selection_History_1=4, 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 VAL [\old(val)=257, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=4, manual_selection_History_0=-128, manual_selection_History_1=4, 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=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, val=257] [L333] RET write_side2_failed_history(side2Failed) [L334] COND TRUE \read(side2Failed) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=4, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=4, 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=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L335] EXPR nomsg != nomsg && s2s1_new == nomsg ? nomsg : s2s1_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=4, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=4, manual_selection_History_2=0, nomsg=-1, nomsg != nomsg && s2s1_new == nomsg ? nomsg : s2s1_new=-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=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L335] s2s1_new = nomsg != nomsg && s2s1_new == nomsg ? nomsg : s2s1_new [L336] EXPR nomsg != nomsg && s2s2_new == nomsg ? nomsg : s2s2_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=4, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=4, manual_selection_History_2=0, nomsg=-1, nomsg != nomsg && s2s2_new == nomsg ? nomsg : s2s2_new=-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=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L336] s2s2_new = nomsg != nomsg && s2s2_new == nomsg ? nomsg : s2s2_new [L337] EXPR nomsg != nomsg && s2p_new == nomsg ? nomsg : s2p_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=4, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=4, manual_selection_History_2=0, nomsg=-1, nomsg != nomsg && s2p_new == nomsg ? nomsg : s2p_new=-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=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=4, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=4, 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=4, manual_selection_History_0=-128, manual_selection_History_1=4, 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=4, manual_selection_History_0=-128, manual_selection_History_1=4, 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=4, index=0, manual_selection_History_0=-128, manual_selection_History_1=4, 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=4, manual_selection_History_0=-128, manual_selection_History_1=4, 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 VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=4, manual_selection_History_0=-128, manual_selection_History_1=4, 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=-1, 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=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L394] COND FALSE !((int )side1 == 1) VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=4, manual_selection_History_0=-128, manual_selection_History_1=4, 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=-1, 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=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L397] COND FALSE !((int )side2 == 1) VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=4, manual_selection_History_0=-128, manual_selection_History_1=4, 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=-1, 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=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L400] COND FALSE !((int )side1 == 0) [L407] active_side = (int8_t )0 VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=4, manual_selection_History_0=-128, manual_selection_History_1=4, 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=-1, 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=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=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 VAL [\old(val)=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=4, manual_selection_History_0=-128, manual_selection_History_1=4, 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=-1, 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, val=0] [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 ; VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=4, 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] [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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=4, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=4, 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) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cond=1, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=4, 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] [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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=4, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=4, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=4, 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=4, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=4, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=4, manual_selection_History_2=0, nomsg=-1, read_manual_selection_history((unsigned char)1)=4, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=4, 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=4] [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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=4, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=4, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=4, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=4, 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=4] [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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=4, 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=4, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=4, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=4, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=4, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=4, 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=4, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=4, 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=4, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=4, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=0, manual_selection_History_0=-128, manual_selection_History_1=4, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=4, 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=4, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=4, 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=4, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=4, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=4, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=4, 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, 205 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 47.6s, OverallIterations: 35, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 30.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 25866 SdHoareTripleChecker+Valid, 12.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25651 mSDsluCounter, 67510 SdHoareTripleChecker+Invalid, 10.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52939 mSDsCounter, 8497 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19435 IncrementalHoareTripleChecker+Invalid, 27932 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8497 mSolverCounterUnsat, 14571 mSDtfsCounter, 19435 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3100 GetRequests, 2625 SyntacticMatches, 8 SemanticMatches, 467 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9937 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8084occurred in iteration=29, InterpolantAutomatonStates: 450, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.4s AutomataMinimizationTime, 34 MinimizatonAttempts, 38497 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 5170 NumberOfCodeBlocks, 5170 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 5884 ConstructedInterpolants, 0 QuantifiedInterpolants, 14152 SizeOfPredicates, 12 NumberOfNonLiveVariables, 3982 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 44 InterpolantComputations, 30 PerfectInterpolantSequences, 1923/2111 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-28 01:07:26,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE