./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 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.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 2354c4d30c0335eb0a6c6e03cf8d087a440768412264986840e048ded8afea74 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 17:55:50,097 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 17:55:50,099 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 17:55:50,133 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 17:55:50,133 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 17:55:50,134 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 17:55:50,136 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 17:55:50,137 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 17:55:50,139 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 17:55:50,142 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 17:55:50,142 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 17:55:50,144 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 17:55:50,144 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 17:55:50,146 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 17:55:50,146 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 17:55:50,149 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 17:55:50,149 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 17:55:50,150 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 17:55:50,151 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 17:55:50,156 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 17:55:50,157 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 17:55:50,158 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 17:55:50,158 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 17:55:50,159 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 17:55:50,160 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 17:55:50,165 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 17:55:50,165 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 17:55:50,165 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 17:55:50,166 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 17:55:50,166 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 17:55:50,167 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 17:55:50,167 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 17:55:50,168 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 17:55:50,169 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 17:55:50,169 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 17:55:50,170 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 17:55:50,170 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 17:55:50,170 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 17:55:50,175 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 17:55:50,175 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 17:55:50,176 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 17:55:50,177 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 17:55:50,179 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 17:55:50,201 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 17:55:50,202 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 17:55:50,202 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 17:55:50,202 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 17:55:50,203 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 17:55:50,203 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 17:55:50,203 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 17:55:50,203 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 17:55:50,203 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 17:55:50,204 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 17:55:50,204 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 17:55:50,205 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 17:55:50,205 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 17:55:50,205 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 17:55:50,205 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 17:55:50,205 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 17:55:50,205 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 17:55:50,205 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 17:55:50,205 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 17:55:50,207 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 17:55:50,207 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 17:55:50,207 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 17:55:50,207 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 17:55:50,207 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 17:55:50,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 17:55:50,208 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 17:55:50,208 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 17:55:50,208 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 17:55:50,208 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 17:55:50,208 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 17:55:50,208 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 17:55:50,209 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 17:55:50,209 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 17:55:50,209 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 -> 2354c4d30c0335eb0a6c6e03cf8d087a440768412264986840e048ded8afea74 [2022-07-22 17:55:50,426 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 17:55:50,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 17:55:50,456 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 17:55:50,457 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 17:55:50,461 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 17:55:50,461 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2022-07-22 17:55:50,501 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/836d2ebc5/6ada243882124f59aebeba65e7ca1db5/FLAGfe51c2407 [2022-07-22 17:55:50,911 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 17:55:50,911 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2022-07-22 17:55:50,918 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/836d2ebc5/6ada243882124f59aebeba65e7ca1db5/FLAGfe51c2407 [2022-07-22 17:55:50,929 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/836d2ebc5/6ada243882124f59aebeba65e7ca1db5 [2022-07-22 17:55:50,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 17:55:50,932 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 17:55:50,934 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 17:55:50,934 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 17:55:50,937 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 17:55:50,937 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 05:55:50" (1/1) ... [2022-07-22 17:55:50,938 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6124d38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:55:50, skipping insertion in model container [2022-07-22 17:55:50,938 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 05:55:50" (1/1) ... [2022-07-22 17:55:50,942 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 17:55:50,980 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 17:55:51,128 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.1.ufo.BOUNDED-10.pals.c[14700,14713] [2022-07-22 17:55:51,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 17:55:51,136 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 17:55:51,210 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.1.ufo.BOUNDED-10.pals.c[14700,14713] [2022-07-22 17:55:51,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 17:55:51,221 INFO L208 MainTranslator]: Completed translation [2022-07-22 17:55:51,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:55:51 WrapperNode [2022-07-22 17:55:51,221 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 17:55:51,222 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 17:55:51,223 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 17:55:51,223 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 17:55:51,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:55:51" (1/1) ... [2022-07-22 17:55:51,237 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:55:51" (1/1) ... [2022-07-22 17:55:51,288 INFO L137 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 538 [2022-07-22 17:55:51,288 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 17:55:51,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 17:55:51,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 17:55:51,289 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 17:55:51,296 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:55:51" (1/1) ... [2022-07-22 17:55:51,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:55:51" (1/1) ... [2022-07-22 17:55:51,300 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:55:51" (1/1) ... [2022-07-22 17:55:51,304 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:55:51" (1/1) ... [2022-07-22 17:55:51,311 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:55:51" (1/1) ... [2022-07-22 17:55:51,316 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:55:51" (1/1) ... [2022-07-22 17:55:51,318 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:55:51" (1/1) ... [2022-07-22 17:55:51,321 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 17:55:51,322 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 17:55:51,322 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 17:55:51,322 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 17:55:51,323 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:55:51" (1/1) ... [2022-07-22 17:55:51,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 17:55:51,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:55:51,353 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) [2022-07-22 17:55:51,373 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 [2022-07-22 17:55:51,403 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2022-07-22 17:55:51,403 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2022-07-22 17:55:51,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 17:55:51,403 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2022-07-22 17:55:51,403 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2022-07-22 17:55:51,404 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2022-07-22 17:55:51,404 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2022-07-22 17:55:51,404 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2022-07-22 17:55:51,404 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2022-07-22 17:55:51,404 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-22 17:55:51,404 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-22 17:55:51,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 17:55:51,405 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2022-07-22 17:55:51,405 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2022-07-22 17:55:51,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 17:55:51,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 17:55:51,405 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2022-07-22 17:55:51,405 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2022-07-22 17:55:51,480 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 17:55:51,482 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 17:55:51,860 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 17:55:51,867 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 17:55:51,867 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-22 17:55:51,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 05:55:51 BoogieIcfgContainer [2022-07-22 17:55:51,869 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 17:55:51,870 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 17:55:51,870 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 17:55:51,873 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 17:55:51,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 05:55:50" (1/3) ... [2022-07-22 17:55:51,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@429a6e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 05:55:51, skipping insertion in model container [2022-07-22 17:55:51,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:55:51" (2/3) ... [2022-07-22 17:55:51,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@429a6e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 05:55:51, skipping insertion in model container [2022-07-22 17:55:51,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 05:55:51" (3/3) ... [2022-07-22 17:55:51,875 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2022-07-22 17:55:51,884 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 17:55:51,884 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 17:55:51,962 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 17:55:51,967 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@ad7b131, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3f94630a [2022-07-22 17:55:51,967 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 17:55:51,970 INFO L276 IsEmpty]: Start isEmpty. Operand has 207 states, 167 states have (on average 1.5508982035928143) internal successors, (259), 168 states have internal predecessors, (259), 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) [2022-07-22 17:55:51,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-22 17:55:51,978 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:55:51,978 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:55:51,979 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:55:51,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:55:51,984 INFO L85 PathProgramCache]: Analyzing trace with hash -518679476, now seen corresponding path program 1 times [2022-07-22 17:55:51,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:55:51,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367414427] [2022-07-22 17:55:51,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:55:51,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:55:52,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:52,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:55:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:52,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 17:55:52,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:55:52,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367414427] [2022-07-22 17:55:52,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367414427] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:55:52,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 17:55:52,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 17:55:52,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702795937] [2022-07-22 17:55:52,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:55:52,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 17:55:52,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:55:52,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 17:55:52,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 17:55:52,214 INFO L87 Difference]: Start difference. First operand has 207 states, 167 states have (on average 1.5508982035928143) internal successors, (259), 168 states have internal predecessors, (259), 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) [2022-07-22 17:55:52,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:55:52,275 INFO L93 Difference]: Finished difference Result 398 states and 642 transitions. [2022-07-22 17:55:52,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 17:55:52,277 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 [2022-07-22 17:55:52,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:55:52,289 INFO L225 Difference]: With dead ends: 398 [2022-07-22 17:55:52,289 INFO L226 Difference]: Without dead ends: 203 [2022-07-22 17:55:52,298 INFO L412 NwaCegarLoop]: 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 [2022-07-22 17:55:52,301 INFO L413 NwaCegarLoop]: 312 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, 312 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 [2022-07-22 17:55:52,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 17:55:52,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-07-22 17:55:52,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2022-07-22 17:55:52,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 164 states have (on average 1.5) internal successors, (246), 164 states have internal predecessors, (246), 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) [2022-07-22 17:55:52,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 308 transitions. [2022-07-22 17:55:52,359 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 308 transitions. Word has length 44 [2022-07-22 17:55:52,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:55:52,360 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 308 transitions. [2022-07-22 17:55:52,360 INFO L496 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) [2022-07-22 17:55:52,360 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 308 transitions. [2022-07-22 17:55:52,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-22 17:55:52,363 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:55:52,363 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:55:52,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 17:55:52,364 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:55:52,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:55:52,364 INFO L85 PathProgramCache]: Analyzing trace with hash -527444980, now seen corresponding path program 1 times [2022-07-22 17:55:52,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:55:52,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090004698] [2022-07-22 17:55:52,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:55:52,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:55:52,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:52,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:55:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:52,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 17:55:52,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:55:52,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090004698] [2022-07-22 17:55:52,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090004698] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:55:52,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 17:55:52,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 17:55:52,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111210476] [2022-07-22 17:55:52,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:55:52,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 17:55:52,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:55:52,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 17:55:52,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 17:55:52,450 INFO L87 Difference]: Start difference. First operand 203 states and 308 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) [2022-07-22 17:55:52,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:55:52,535 INFO L93 Difference]: Finished difference Result 531 states and 811 transitions. [2022-07-22 17:55:52,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 17:55:52,536 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 [2022-07-22 17:55:52,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:55:52,538 INFO L225 Difference]: With dead ends: 531 [2022-07-22 17:55:52,538 INFO L226 Difference]: Without dead ends: 342 [2022-07-22 17:55:52,539 INFO L412 NwaCegarLoop]: 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 [2022-07-22 17:55:52,540 INFO L413 NwaCegarLoop]: 327 mSDtfsCounter, 171 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 1584 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 17:55:52,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 1584 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 17:55:52,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-07-22 17:55:52,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 203. [2022-07-22 17:55:52,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 164 states have (on average 1.4268292682926829) internal successors, (234), 164 states have internal predecessors, (234), 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) [2022-07-22 17:55:52,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 296 transitions. [2022-07-22 17:55:52,555 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 296 transitions. Word has length 44 [2022-07-22 17:55:52,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:55:52,555 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 296 transitions. [2022-07-22 17:55:52,556 INFO L496 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) [2022-07-22 17:55:52,556 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 296 transitions. [2022-07-22 17:55:52,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-22 17:55:52,557 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:55:52,557 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:55:52,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 17:55:52,557 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:55:52,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:55:52,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1202945359, now seen corresponding path program 1 times [2022-07-22 17:55:52,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:55:52,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958421428] [2022-07-22 17:55:52,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:55:52,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:55:52,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:52,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 17:55:52,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:52,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 17:55:52,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:55:52,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958421428] [2022-07-22 17:55:52,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958421428] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:55:52,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 17:55:52,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 17:55:52,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85251903] [2022-07-22 17:55:52,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:55:52,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 17:55:52,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:55:52,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 17:55:52,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 17:55:52,708 INFO L87 Difference]: Start difference. First operand 203 states and 296 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) [2022-07-22 17:55:52,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:55:52,738 INFO L93 Difference]: Finished difference Result 393 states and 582 transitions. [2022-07-22 17:55:52,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 17:55:52,738 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 [2022-07-22 17:55:52,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:55:52,739 INFO L225 Difference]: With dead ends: 393 [2022-07-22 17:55:52,740 INFO L226 Difference]: Without dead ends: 207 [2022-07-22 17:55:52,740 INFO L412 NwaCegarLoop]: 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 [2022-07-22 17:55:52,741 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 5 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 860 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 [2022-07-22 17:55:52,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 860 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 17:55:52,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-07-22 17:55:52,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2022-07-22 17:55:52,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 167 states have (on average 1.4191616766467066) internal successors, (237), 167 states have internal predecessors, (237), 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) [2022-07-22 17:55:52,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 299 transitions. [2022-07-22 17:55:52,753 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 299 transitions. Word has length 55 [2022-07-22 17:55:52,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:55:52,754 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 299 transitions. [2022-07-22 17:55:52,754 INFO L496 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) [2022-07-22 17:55:52,754 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 299 transitions. [2022-07-22 17:55:52,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-22 17:55:52,755 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:55:52,756 INFO L195 NwaCegarLoop]: 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] [2022-07-22 17:55:52,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 17:55:52,756 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:55:52,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:55:52,756 INFO L85 PathProgramCache]: Analyzing trace with hash -915994749, now seen corresponding path program 1 times [2022-07-22 17:55:52,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:55:52,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809175676] [2022-07-22 17:55:52,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:55:52,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:55:52,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:52,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 17:55:52,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:52,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 17:55:52,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:52,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-22 17:55:52,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:52,833 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 17:55:52,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:55:52,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809175676] [2022-07-22 17:55:52,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809175676] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:55:52,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 17:55:52,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 17:55:52,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643074978] [2022-07-22 17:55:52,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:55:52,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 17:55:52,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:55:52,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 17:55:52,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 17:55:52,835 INFO L87 Difference]: Start difference. First operand 207 states and 299 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) [2022-07-22 17:55:52,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:55:52,856 INFO L93 Difference]: Finished difference Result 564 states and 826 transitions. [2022-07-22 17:55:52,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 17:55:52,857 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 [2022-07-22 17:55:52,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:55:52,859 INFO L225 Difference]: With dead ends: 564 [2022-07-22 17:55:52,859 INFO L226 Difference]: Without dead ends: 374 [2022-07-22 17:55:52,860 INFO L412 NwaCegarLoop]: 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 [2022-07-22 17:55:52,860 INFO L413 NwaCegarLoop]: 341 mSDtfsCounter, 227 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 622 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 [2022-07-22 17:55:52,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 622 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 17:55:52,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-07-22 17:55:52,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 364. [2022-07-22 17:55:52,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 287 states have (on average 1.4390243902439024) internal successors, (413), 288 states have internal predecessors, (413), 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) [2022-07-22 17:55:52,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 533 transitions. [2022-07-22 17:55:52,876 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 533 transitions. Word has length 71 [2022-07-22 17:55:52,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:55:52,877 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 533 transitions. [2022-07-22 17:55:52,877 INFO L496 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) [2022-07-22 17:55:52,877 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 533 transitions. [2022-07-22 17:55:52,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-22 17:55:52,878 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:55:52,878 INFO L195 NwaCegarLoop]: 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] [2022-07-22 17:55:52,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 17:55:52,879 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:55:52,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:55:52,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1756914315, now seen corresponding path program 1 times [2022-07-22 17:55:52,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:55:52,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191703102] [2022-07-22 17:55:52,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:55:52,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:55:52,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:52,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 17:55:52,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:52,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 17:55:52,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:52,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-22 17:55:52,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:52,949 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 17:55:52,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:55:52,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191703102] [2022-07-22 17:55:52,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191703102] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:55:52,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 17:55:52,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 17:55:52,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503107223] [2022-07-22 17:55:52,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:55:52,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 17:55:52,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:55:52,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 17:55:52,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 17:55:52,952 INFO L87 Difference]: Start difference. First operand 364 states and 533 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) [2022-07-22 17:55:52,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:55:52,993 INFO L93 Difference]: Finished difference Result 1009 states and 1492 transitions. [2022-07-22 17:55:52,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 17:55:52,993 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 [2022-07-22 17:55:52,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:55:52,997 INFO L225 Difference]: With dead ends: 1009 [2022-07-22 17:55:52,998 INFO L226 Difference]: Without dead ends: 662 [2022-07-22 17:55:52,999 INFO L412 NwaCegarLoop]: 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 [2022-07-22 17:55:52,999 INFO L413 NwaCegarLoop]: 374 mSDtfsCounter, 235 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 657 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 [2022-07-22 17:55:53,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 657 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 17:55:53,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2022-07-22 17:55:53,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 645. [2022-07-22 17:55:53,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 496 states have (on average 1.4576612903225807) internal successors, (723), 499 states have internal predecessors, (723), 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) [2022-07-22 17:55:53,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 957 transitions. [2022-07-22 17:55:53,030 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 957 transitions. Word has length 72 [2022-07-22 17:55:53,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:55:53,031 INFO L495 AbstractCegarLoop]: Abstraction has 645 states and 957 transitions. [2022-07-22 17:55:53,031 INFO L496 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) [2022-07-22 17:55:53,031 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 957 transitions. [2022-07-22 17:55:53,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-22 17:55:53,032 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:55:53,032 INFO L195 NwaCegarLoop]: 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] [2022-07-22 17:55:53,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 17:55:53,033 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:55:53,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:55:53,033 INFO L85 PathProgramCache]: Analyzing trace with hash 477050637, now seen corresponding path program 1 times [2022-07-22 17:55:53,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:55:53,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978011664] [2022-07-22 17:55:53,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:55:53,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:55:53,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:53,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 17:55:53,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:53,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 17:55:53,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:53,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-22 17:55:53,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:53,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 17:55:53,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:55:53,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978011664] [2022-07-22 17:55:53,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978011664] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:55:53,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 17:55:53,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 17:55:53,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368202616] [2022-07-22 17:55:53,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:55:53,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 17:55:53,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:55:53,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 17:55:53,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 17:55:53,094 INFO L87 Difference]: Start difference. First operand 645 states and 957 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) [2022-07-22 17:55:53,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:55:53,347 INFO L93 Difference]: Finished difference Result 1805 states and 2723 transitions. [2022-07-22 17:55:53,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 17:55:53,348 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 [2022-07-22 17:55:53,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:55:53,352 INFO L225 Difference]: With dead ends: 1805 [2022-07-22 17:55:53,353 INFO L226 Difference]: Without dead ends: 1177 [2022-07-22 17:55:53,354 INFO L412 NwaCegarLoop]: 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 [2022-07-22 17:55:53,355 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 786 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 17:55:53,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 778 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 17:55:53,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2022-07-22 17:55:53,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 770. [2022-07-22 17:55:53,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 608 states have (on average 1.4358552631578947) internal successors, (873), 611 states have internal predecessors, (873), 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) [2022-07-22 17:55:53,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1121 transitions. [2022-07-22 17:55:53,397 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1121 transitions. Word has length 72 [2022-07-22 17:55:53,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:55:53,398 INFO L495 AbstractCegarLoop]: Abstraction has 770 states and 1121 transitions. [2022-07-22 17:55:53,398 INFO L496 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) [2022-07-22 17:55:53,398 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1121 transitions. [2022-07-22 17:55:53,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-22 17:55:53,399 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:55:53,399 INFO L195 NwaCegarLoop]: 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] [2022-07-22 17:55:53,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 17:55:53,400 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:55:53,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:55:53,400 INFO L85 PathProgramCache]: Analyzing trace with hash -221882142, now seen corresponding path program 1 times [2022-07-22 17:55:53,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:55:53,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453665751] [2022-07-22 17:55:53,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:55:53,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:55:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:53,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 17:55:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:53,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 17:55:53,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:53,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-22 17:55:53,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:53,455 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 17:55:53,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:55:53,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453665751] [2022-07-22 17:55:53,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453665751] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:55:53,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 17:55:53,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 17:55:53,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932950818] [2022-07-22 17:55:53,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:55:53,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 17:55:53,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:55:53,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 17:55:53,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 17:55:53,458 INFO L87 Difference]: Start difference. First operand 770 states and 1121 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) [2022-07-22 17:55:53,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:55:53,692 INFO L93 Difference]: Finished difference Result 1809 states and 2723 transitions. [2022-07-22 17:55:53,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 17:55:53,692 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 [2022-07-22 17:55:53,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:55:53,698 INFO L225 Difference]: With dead ends: 1809 [2022-07-22 17:55:53,698 INFO L226 Difference]: Without dead ends: 1181 [2022-07-22 17:55:53,700 INFO L412 NwaCegarLoop]: 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 [2022-07-22 17:55:53,701 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 783 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 17:55:53,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [783 Valid, 780 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 17:55:53,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2022-07-22 17:55:53,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 778. [2022-07-22 17:55:53,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 616 states have (on average 1.4301948051948052) internal successors, (881), 619 states have internal predecessors, (881), 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) [2022-07-22 17:55:53,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1129 transitions. [2022-07-22 17:55:53,754 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1129 transitions. Word has length 73 [2022-07-22 17:55:53,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:55:53,755 INFO L495 AbstractCegarLoop]: Abstraction has 778 states and 1129 transitions. [2022-07-22 17:55:53,755 INFO L496 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) [2022-07-22 17:55:53,756 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1129 transitions. [2022-07-22 17:55:53,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-22 17:55:53,757 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:55:53,757 INFO L195 NwaCegarLoop]: 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] [2022-07-22 17:55:53,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-22 17:55:53,760 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:55:53,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:55:53,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1379275244, now seen corresponding path program 1 times [2022-07-22 17:55:53,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:55:53,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551739032] [2022-07-22 17:55:53,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:55:53,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:55:53,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:53,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 17:55:53,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:53,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 17:55:53,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:53,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-22 17:55:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:53,858 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 17:55:53,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:55:53,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551739032] [2022-07-22 17:55:53,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551739032] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:55:53,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 17:55:53,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 17:55:53,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54434233] [2022-07-22 17:55:53,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:55:53,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 17:55:53,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:55:53,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 17:55:53,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 17:55:53,862 INFO L87 Difference]: Start difference. First operand 778 states and 1129 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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) [2022-07-22 17:55:54,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:55:54,085 INFO L93 Difference]: Finished difference Result 1809 states and 2715 transitions. [2022-07-22 17:55:54,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 17:55:54,085 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 75 [2022-07-22 17:55:54,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:55:54,089 INFO L225 Difference]: With dead ends: 1809 [2022-07-22 17:55:54,089 INFO L226 Difference]: Without dead ends: 1181 [2022-07-22 17:55:54,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 17:55:54,091 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 238 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 17:55:54,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 747 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 17:55:54,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2022-07-22 17:55:54,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 778. [2022-07-22 17:55:54,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 616 states have (on average 1.4237012987012987) internal successors, (877), 619 states have internal predecessors, (877), 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) [2022-07-22 17:55:54,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1125 transitions. [2022-07-22 17:55:54,134 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1125 transitions. Word has length 75 [2022-07-22 17:55:54,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:55:54,134 INFO L495 AbstractCegarLoop]: Abstraction has 778 states and 1125 transitions. [2022-07-22 17:55:54,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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) [2022-07-22 17:55:54,135 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1125 transitions. [2022-07-22 17:55:54,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-22 17:55:54,135 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:55:54,136 INFO L195 NwaCegarLoop]: 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] [2022-07-22 17:55:54,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 17:55:54,136 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:55:54,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:55:54,136 INFO L85 PathProgramCache]: Analyzing trace with hash -156149797, now seen corresponding path program 1 times [2022-07-22 17:55:54,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:55:54,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653487903] [2022-07-22 17:55:54,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:55:54,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:55:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:54,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 17:55:54,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:54,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 17:55:54,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:54,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 17:55:54,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:54,182 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 17:55:54,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:55:54,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653487903] [2022-07-22 17:55:54,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653487903] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:55:54,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 17:55:54,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 17:55:54,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900023932] [2022-07-22 17:55:54,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:55:54,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 17:55:54,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:55:54,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 17:55:54,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 17:55:54,184 INFO L87 Difference]: Start difference. First operand 778 states and 1125 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 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) [2022-07-22 17:55:54,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:55:54,244 INFO L93 Difference]: Finished difference Result 1426 states and 2092 transitions. [2022-07-22 17:55:54,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 17:55:54,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 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 76 [2022-07-22 17:55:54,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:55:54,247 INFO L225 Difference]: With dead ends: 1426 [2022-07-22 17:55:54,247 INFO L226 Difference]: Without dead ends: 798 [2022-07-22 17:55:54,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 17:55:54,249 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 6 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 872 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 [2022-07-22 17:55:54,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 872 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 17:55:54,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2022-07-22 17:55:54,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 798. [2022-07-22 17:55:54,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 632 states have (on average 1.4129746835443038) internal successors, (893), 635 states have internal predecessors, (893), 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) [2022-07-22 17:55:54,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1141 transitions. [2022-07-22 17:55:54,291 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1141 transitions. Word has length 76 [2022-07-22 17:55:54,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:55:54,291 INFO L495 AbstractCegarLoop]: Abstraction has 798 states and 1141 transitions. [2022-07-22 17:55:54,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 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) [2022-07-22 17:55:54,291 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1141 transitions. [2022-07-22 17:55:54,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-22 17:55:54,292 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:55:54,292 INFO L195 NwaCegarLoop]: 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] [2022-07-22 17:55:54,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-22 17:55:54,293 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:55:54,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:55:54,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1992242591, now seen corresponding path program 1 times [2022-07-22 17:55:54,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:55:54,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655395456] [2022-07-22 17:55:54,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:55:54,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:55:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:54,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 17:55:54,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:54,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 17:55:54,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:54,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 17:55:54,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:54,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-22 17:55:54,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:54,342 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 17:55:54,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:55:54,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655395456] [2022-07-22 17:55:54,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655395456] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:55:54,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 17:55:54,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 17:55:54,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816276515] [2022-07-22 17:55:54,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:55:54,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 17:55:54,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:55:54,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 17:55:54,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 17:55:54,344 INFO L87 Difference]: Start difference. First operand 798 states and 1141 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 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) [2022-07-22 17:55:54,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:55:54,416 INFO L93 Difference]: Finished difference Result 1466 states and 2136 transitions. [2022-07-22 17:55:54,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 17:55:54,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 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 84 [2022-07-22 17:55:54,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:55:54,419 INFO L225 Difference]: With dead ends: 1466 [2022-07-22 17:55:54,420 INFO L226 Difference]: Without dead ends: 818 [2022-07-22 17:55:54,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 17:55:54,421 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 6 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 858 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 [2022-07-22 17:55:54,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 858 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 17:55:54,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2022-07-22 17:55:54,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 818. [2022-07-22 17:55:54,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 648 states have (on average 1.4027777777777777) internal successors, (909), 651 states have internal predecessors, (909), 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) [2022-07-22 17:55:54,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1157 transitions. [2022-07-22 17:55:54,470 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1157 transitions. Word has length 84 [2022-07-22 17:55:54,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:55:54,470 INFO L495 AbstractCegarLoop]: Abstraction has 818 states and 1157 transitions. [2022-07-22 17:55:54,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 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) [2022-07-22 17:55:54,471 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1157 transitions. [2022-07-22 17:55:54,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-22 17:55:54,472 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:55:54,472 INFO L195 NwaCegarLoop]: 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, 1, 1] [2022-07-22 17:55:54,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-22 17:55:54,472 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:55:54,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:55:54,473 INFO L85 PathProgramCache]: Analyzing trace with hash -115565173, now seen corresponding path program 1 times [2022-07-22 17:55:54,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:55:54,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698165635] [2022-07-22 17:55:54,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:55:54,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:55:54,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:54,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 17:55:54,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:54,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 17:55:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:54,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 17:55:54,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:54,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-22 17:55:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:54,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-22 17:55:54,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:54,523 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 17:55:54,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:55:54,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698165635] [2022-07-22 17:55:54,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698165635] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:55:54,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 17:55:54,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 17:55:54,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217098178] [2022-07-22 17:55:54,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:55:54,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 17:55:54,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:55:54,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 17:55:54,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 17:55:54,526 INFO L87 Difference]: Start difference. First operand 818 states and 1157 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, (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) [2022-07-22 17:55:54,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:55:54,612 INFO L93 Difference]: Finished difference Result 1502 states and 2152 transitions. [2022-07-22 17:55:54,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 17:55:54,613 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, (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 92 [2022-07-22 17:55:54,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:55:54,616 INFO L225 Difference]: With dead ends: 1502 [2022-07-22 17:55:54,616 INFO L226 Difference]: Without dead ends: 834 [2022-07-22 17:55:54,617 INFO L412 NwaCegarLoop]: 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 [2022-07-22 17:55:54,618 INFO L413 NwaCegarLoop]: 294 mSDtfsCounter, 5 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 867 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 [2022-07-22 17:55:54,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 867 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 17:55:54,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2022-07-22 17:55:54,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 834. [2022-07-22 17:55:54,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 660 states have (on average 1.3954545454545455) internal successors, (921), 663 states have internal predecessors, (921), 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) [2022-07-22 17:55:54,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1169 transitions. [2022-07-22 17:55:54,707 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1169 transitions. Word has length 92 [2022-07-22 17:55:54,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:55:54,708 INFO L495 AbstractCegarLoop]: Abstraction has 834 states and 1169 transitions. [2022-07-22 17:55:54,708 INFO L496 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, (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) [2022-07-22 17:55:54,708 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1169 transitions. [2022-07-22 17:55:54,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-22 17:55:54,709 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:55:54,709 INFO L195 NwaCegarLoop]: 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, 1, 1] [2022-07-22 17:55:54,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-22 17:55:54,709 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:55:54,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:55:54,709 INFO L85 PathProgramCache]: Analyzing trace with hash -2014073166, now seen corresponding path program 1 times [2022-07-22 17:55:54,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:55:54,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804295710] [2022-07-22 17:55:54,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:55:54,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:55:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:54,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 17:55:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:54,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 17:55:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:54,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 17:55:54,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:54,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-22 17:55:54,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:54,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-22 17:55:54,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:54,778 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 17:55:54,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:55:54,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804295710] [2022-07-22 17:55:54,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804295710] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:55:54,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 17:55:54,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 17:55:54,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352814936] [2022-07-22 17:55:54,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:55:54,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 17:55:54,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:55:54,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 17:55:54,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 17:55:54,780 INFO L87 Difference]: Start difference. First operand 834 states and 1169 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, (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) [2022-07-22 17:55:54,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:55:54,831 INFO L93 Difference]: Finished difference Result 1538 states and 2192 transitions. [2022-07-22 17:55:54,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 17:55:54,831 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, (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 92 [2022-07-22 17:55:54,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:55:54,834 INFO L225 Difference]: With dead ends: 1538 [2022-07-22 17:55:54,834 INFO L226 Difference]: Without dead ends: 854 [2022-07-22 17:55:54,836 INFO L412 NwaCegarLoop]: 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 [2022-07-22 17:55:54,836 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 6 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 858 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 [2022-07-22 17:55:54,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 858 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 17:55:54,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2022-07-22 17:55:54,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 854. [2022-07-22 17:55:54,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 854 states, 676 states have (on average 1.386094674556213) internal successors, (937), 679 states have internal predecessors, (937), 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) [2022-07-22 17:55:54,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1185 transitions. [2022-07-22 17:55:54,872 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1185 transitions. Word has length 92 [2022-07-22 17:55:54,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:55:54,873 INFO L495 AbstractCegarLoop]: Abstraction has 854 states and 1185 transitions. [2022-07-22 17:55:54,873 INFO L496 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, (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) [2022-07-22 17:55:54,874 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1185 transitions. [2022-07-22 17:55:54,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-22 17:55:54,877 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:55:54,877 INFO L195 NwaCegarLoop]: 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, 1, 1] [2022-07-22 17:55:54,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-22 17:55:54,878 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:55:54,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:55:54,878 INFO L85 PathProgramCache]: Analyzing trace with hash -794519374, now seen corresponding path program 1 times [2022-07-22 17:55:54,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:55:54,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767227330] [2022-07-22 17:55:54,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:55:54,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:55:54,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:54,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 17:55:54,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:54,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 17:55:54,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:54,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 17:55:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:54,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-22 17:55:54,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:54,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-22 17:55:54,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:54,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 17:55:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:54,944 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 17:55:54,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:55:54,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767227330] [2022-07-22 17:55:54,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767227330] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:55:54,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 17:55:54,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 17:55:54,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900626173] [2022-07-22 17:55:54,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:55:54,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 17:55:54,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:55:54,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 17:55:54,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 17:55:54,945 INFO L87 Difference]: Start difference. First operand 854 states and 1185 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 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) [2022-07-22 17:55:55,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:55:55,012 INFO L93 Difference]: Finished difference Result 1582 states and 2220 transitions. [2022-07-22 17:55:55,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 17:55:55,012 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 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 100 [2022-07-22 17:55:55,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:55:55,016 INFO L225 Difference]: With dead ends: 1582 [2022-07-22 17:55:55,016 INFO L226 Difference]: Without dead ends: 878 [2022-07-22 17:55:55,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 17:55:55,018 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 7 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 869 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 [2022-07-22 17:55:55,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 869 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 17:55:55,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2022-07-22 17:55:55,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 878. [2022-07-22 17:55:55,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 696 states have (on average 1.375) internal successors, (957), 699 states have internal predecessors, (957), 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) [2022-07-22 17:55:55,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1205 transitions. [2022-07-22 17:55:55,055 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1205 transitions. Word has length 100 [2022-07-22 17:55:55,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:55:55,055 INFO L495 AbstractCegarLoop]: Abstraction has 878 states and 1205 transitions. [2022-07-22 17:55:55,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 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) [2022-07-22 17:55:55,055 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1205 transitions. [2022-07-22 17:55:55,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-22 17:55:55,057 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:55:55,057 INFO L195 NwaCegarLoop]: 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, 1, 1] [2022-07-22 17:55:55,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-22 17:55:55,057 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:55:55,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:55:55,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1401758325, now seen corresponding path program 1 times [2022-07-22 17:55:55,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:55:55,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527549122] [2022-07-22 17:55:55,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:55:55,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:55:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:55,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 17:55:55,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:55,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 17:55:55,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:55,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 17:55:55,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:55,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-22 17:55:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:55,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-22 17:55:55,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:55,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 17:55:55,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:55,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-22 17:55:55,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:55,189 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-22 17:55:55,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:55:55,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527549122] [2022-07-22 17:55:55,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527549122] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:55:55,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 17:55:55,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 17:55:55,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152154096] [2022-07-22 17:55:55,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:55:55,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 17:55:55,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:55:55,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 17:55:55,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 17:55:55,190 INFO L87 Difference]: Start difference. First operand 878 states and 1205 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, (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) [2022-07-22 17:55:55,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:55:55,410 INFO L93 Difference]: Finished difference Result 2499 states and 3487 transitions. [2022-07-22 17:55:55,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 17:55:55,411 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, (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 103 [2022-07-22 17:55:55,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:55:55,416 INFO L225 Difference]: With dead ends: 2499 [2022-07-22 17:55:55,417 INFO L226 Difference]: Without dead ends: 1771 [2022-07-22 17:55:55,418 INFO L412 NwaCegarLoop]: 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 [2022-07-22 17:55:55,418 INFO L413 NwaCegarLoop]: 419 mSDtfsCounter, 395 mSDsluCounter, 1893 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 2312 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 [2022-07-22 17:55:55,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 2312 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 17:55:55,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1771 states. [2022-07-22 17:55:55,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1771 to 1162. [2022-07-22 17:55:55,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1162 states, 907 states have (on average 1.3660418963616316) internal successors, (1239), 912 states have internal predecessors, (1239), 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) [2022-07-22 17:55:55,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1583 transitions. [2022-07-22 17:55:55,479 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 1583 transitions. Word has length 103 [2022-07-22 17:55:55,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:55:55,479 INFO L495 AbstractCegarLoop]: Abstraction has 1162 states and 1583 transitions. [2022-07-22 17:55:55,479 INFO L496 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, (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) [2022-07-22 17:55:55,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1583 transitions. [2022-07-22 17:55:55,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-22 17:55:55,480 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:55:55,480 INFO L195 NwaCegarLoop]: 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] [2022-07-22 17:55:55,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-22 17:55:55,480 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:55:55,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:55:55,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1324741963, now seen corresponding path program 1 times [2022-07-22 17:55:55,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:55:55,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856473779] [2022-07-22 17:55:55,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:55:55,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:55:55,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:55,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 17:55:55,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:55,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 17:55:55,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:55,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 17:55:55,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:55,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-22 17:55:55,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:55,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-22 17:55:55,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:55,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 17:55:55,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:55,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-22 17:55:55,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:55,537 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-22 17:55:55,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:55:55,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856473779] [2022-07-22 17:55:55,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856473779] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:55:55,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 17:55:55,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 17:55:55,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141777258] [2022-07-22 17:55:55,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:55:55,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 17:55:55,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:55:55,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 17:55:55,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 17:55:55,539 INFO L87 Difference]: Start difference. First operand 1162 states and 1583 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 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) [2022-07-22 17:55:55,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:55:55,611 INFO L93 Difference]: Finished difference Result 2130 states and 2928 transitions. [2022-07-22 17:55:55,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 17:55:55,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 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 107 [2022-07-22 17:55:55,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:55:55,615 INFO L225 Difference]: With dead ends: 2130 [2022-07-22 17:55:55,615 INFO L226 Difference]: Without dead ends: 1186 [2022-07-22 17:55:55,617 INFO L412 NwaCegarLoop]: 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 [2022-07-22 17:55:55,618 INFO L413 NwaCegarLoop]: 294 mSDtfsCounter, 5 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 867 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 [2022-07-22 17:55:55,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 867 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 17:55:55,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2022-07-22 17:55:55,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1186. [2022-07-22 17:55:55,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1186 states, 925 states have (on average 1.358918918918919) internal successors, (1257), 930 states have internal predecessors, (1257), 172 states have call successors, (172), 88 states have call predecessors, (172), 88 states have return successors, (172), 167 states have call predecessors, (172), 172 states have call successors, (172) [2022-07-22 17:55:55,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1601 transitions. [2022-07-22 17:55:55,668 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1601 transitions. Word has length 107 [2022-07-22 17:55:55,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:55:55,669 INFO L495 AbstractCegarLoop]: Abstraction has 1186 states and 1601 transitions. [2022-07-22 17:55:55,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 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) [2022-07-22 17:55:55,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1601 transitions. [2022-07-22 17:55:55,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-22 17:55:55,670 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:55:55,670 INFO L195 NwaCegarLoop]: 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, 1, 1] [2022-07-22 17:55:55,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-22 17:55:55,670 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:55:55,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:55:55,671 INFO L85 PathProgramCache]: Analyzing trace with hash 682815691, now seen corresponding path program 1 times [2022-07-22 17:55:55,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:55:55,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735633670] [2022-07-22 17:55:55,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:55:55,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:55:55,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:55,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 17:55:55,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:55,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 17:55:55,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:55,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 17:55:55,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:55,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-22 17:55:55,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:55,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-22 17:55:55,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:55,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 17:55:55,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:55,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-22 17:55:55,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:55,738 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-22 17:55:55,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:55:55,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735633670] [2022-07-22 17:55:55,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735633670] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:55:55,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 17:55:55,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 17:55:55,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695694733] [2022-07-22 17:55:55,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:55:55,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 17:55:55,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:55:55,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 17:55:55,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 17:55:55,741 INFO L87 Difference]: Start difference. First operand 1186 states and 1601 transitions. Second operand has 6 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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) [2022-07-22 17:55:55,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:55:55,859 INFO L93 Difference]: Finished difference Result 1659 states and 2347 transitions. [2022-07-22 17:55:55,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 17:55:55,859 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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 106 [2022-07-22 17:55:55,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:55:55,865 INFO L225 Difference]: With dead ends: 1659 [2022-07-22 17:55:55,865 INFO L226 Difference]: Without dead ends: 1657 [2022-07-22 17:55:55,866 INFO L412 NwaCegarLoop]: 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 [2022-07-22 17:55:55,866 INFO L413 NwaCegarLoop]: 517 mSDtfsCounter, 263 mSDsluCounter, 1742 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 2259 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 17:55:55,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 2259 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 17:55:55,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2022-07-22 17:55:55,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1194. [2022-07-22 17:55:55,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1194 states, 929 states have (on average 1.3573735199138859) internal successors, (1261), 936 states have internal predecessors, (1261), 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) [2022-07-22 17:55:55,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 1609 transitions. [2022-07-22 17:55:55,935 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 1609 transitions. Word has length 106 [2022-07-22 17:55:55,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:55:55,936 INFO L495 AbstractCegarLoop]: Abstraction has 1194 states and 1609 transitions. [2022-07-22 17:55:55,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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) [2022-07-22 17:55:55,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1609 transitions. [2022-07-22 17:55:55,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-22 17:55:55,937 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:55:55,937 INFO L195 NwaCegarLoop]: 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, 1, 1] [2022-07-22 17:55:55,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-22 17:55:55,937 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:55:55,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:55:55,938 INFO L85 PathProgramCache]: Analyzing trace with hash -614162587, now seen corresponding path program 1 times [2022-07-22 17:55:55,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:55:55,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393386686] [2022-07-22 17:55:55,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:55:55,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:55:55,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:55,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 17:55:55,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:55,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 17:55:55,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:55,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 17:55:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:56,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-22 17:55:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:56,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-22 17:55:56,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:56,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 17:55:56,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:56,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-22 17:55:56,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:56,039 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-22 17:55:56,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:55:56,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393386686] [2022-07-22 17:55:56,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393386686] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:55:56,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 17:55:56,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 17:55:56,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3616135] [2022-07-22 17:55:56,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:55:56,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 17:55:56,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:55:56,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 17:55:56,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 17:55:56,042 INFO L87 Difference]: Start difference. First operand 1194 states and 1609 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 6 states have internal predecessors, (85), 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) [2022-07-22 17:55:56,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:55:56,196 INFO L93 Difference]: Finished difference Result 2456 states and 3370 transitions. [2022-07-22 17:55:56,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 17:55:56,196 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 6 states have internal predecessors, (85), 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 109 [2022-07-22 17:55:56,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:55:56,201 INFO L225 Difference]: With dead ends: 2456 [2022-07-22 17:55:56,201 INFO L226 Difference]: Without dead ends: 1562 [2022-07-22 17:55:56,203 INFO L412 NwaCegarLoop]: 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 [2022-07-22 17:55:56,204 INFO L413 NwaCegarLoop]: 412 mSDtfsCounter, 527 mSDsluCounter, 1863 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 2275 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 [2022-07-22 17:55:56,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 2275 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 17:55:56,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2022-07-22 17:55:56,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1240. [2022-07-22 17:55:56,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1240 states, 986 states have (on average 1.3468559837728196) internal successors, (1328), 998 states have internal predecessors, (1328), 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) [2022-07-22 17:55:56,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1652 transitions. [2022-07-22 17:55:56,292 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1652 transitions. Word has length 109 [2022-07-22 17:55:56,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:55:56,293 INFO L495 AbstractCegarLoop]: Abstraction has 1240 states and 1652 transitions. [2022-07-22 17:55:56,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 6 states have internal predecessors, (85), 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) [2022-07-22 17:55:56,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1652 transitions. [2022-07-22 17:55:56,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-22 17:55:56,294 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:55:56,294 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:55:56,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-22 17:55:56,295 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:55:56,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:55:56,295 INFO L85 PathProgramCache]: Analyzing trace with hash 326540891, now seen corresponding path program 1 times [2022-07-22 17:55:56,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:55:56,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719178677] [2022-07-22 17:55:56,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:55:56,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:55:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:56,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 17:55:56,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:56,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 17:55:56,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:56,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 17:55:56,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:56,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-22 17:55:56,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:56,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-22 17:55:56,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:56,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 17:55:56,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:56,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-22 17:55:56,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:56,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-22 17:55:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:56,416 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-22 17:55:56,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:55:56,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719178677] [2022-07-22 17:55:56,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719178677] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:55:56,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 17:55:56,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 17:55:56,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272531598] [2022-07-22 17:55:56,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:55:56,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 17:55:56,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:55:56,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 17:55:56,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 17:55:56,418 INFO L87 Difference]: Start difference. First operand 1240 states and 1652 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 states have internal predecessors, (84), 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) [2022-07-22 17:55:56,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:55:56,612 INFO L93 Difference]: Finished difference Result 2550 states and 3481 transitions. [2022-07-22 17:55:56,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 17:55:56,613 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 states have internal predecessors, (84), 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 111 [2022-07-22 17:55:56,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:55:56,618 INFO L225 Difference]: With dead ends: 2550 [2022-07-22 17:55:56,619 INFO L226 Difference]: Without dead ends: 1590 [2022-07-22 17:55:56,621 INFO L412 NwaCegarLoop]: 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 [2022-07-22 17:55:56,621 INFO L413 NwaCegarLoop]: 442 mSDtfsCounter, 399 mSDsluCounter, 1983 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 2425 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.1s IncrementalHoareTripleChecker+Time [2022-07-22 17:55:56,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 2425 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 17:55:56,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2022-07-22 17:55:56,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1126. [2022-07-22 17:55:56,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 899 states have (on average 1.3481646273637375) internal successors, (1212), 909 states have internal predecessors, (1212), 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) [2022-07-22 17:55:56,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1502 transitions. [2022-07-22 17:55:56,705 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1502 transitions. Word has length 111 [2022-07-22 17:55:56,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:55:56,706 INFO L495 AbstractCegarLoop]: Abstraction has 1126 states and 1502 transitions. [2022-07-22 17:55:56,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 states have internal predecessors, (84), 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) [2022-07-22 17:55:56,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1502 transitions. [2022-07-22 17:55:56,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-22 17:55:56,707 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:55:56,707 INFO L195 NwaCegarLoop]: 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] [2022-07-22 17:55:56,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-22 17:55:56,707 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:55:56,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:55:56,708 INFO L85 PathProgramCache]: Analyzing trace with hash 2059853897, now seen corresponding path program 1 times [2022-07-22 17:55:56,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:55:56,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016527864] [2022-07-22 17:55:56,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:55:56,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:55:56,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:56,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 17:55:56,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:56,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 17:55:56,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:56,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 17:55:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:56,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-22 17:55:56,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:56,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-22 17:55:56,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:56,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 17:55:56,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:56,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-22 17:55:56,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:56,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-22 17:55:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:56,788 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-22 17:55:56,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:55:56,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016527864] [2022-07-22 17:55:56,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016527864] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:55:56,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 17:55:56,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 17:55:56,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604998873] [2022-07-22 17:55:56,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:55:56,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 17:55:56,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:55:56,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 17:55:56,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-22 17:55:56,790 INFO L87 Difference]: Start difference. First operand 1126 states and 1502 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 7 states have internal predecessors, (89), 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) [2022-07-22 17:55:57,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:55:57,204 INFO L93 Difference]: Finished difference Result 2621 states and 3588 transitions. [2022-07-22 17:55:57,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 17:55:57,204 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 7 states have internal predecessors, (89), 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 112 [2022-07-22 17:55:57,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:55:57,210 INFO L225 Difference]: With dead ends: 2621 [2022-07-22 17:55:57,210 INFO L226 Difference]: Without dead ends: 1695 [2022-07-22 17:55:57,212 INFO L412 NwaCegarLoop]: 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 [2022-07-22 17:55:57,213 INFO L413 NwaCegarLoop]: 509 mSDtfsCounter, 930 mSDsluCounter, 1656 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 2165 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 17:55:57,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 2165 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 17:55:57,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2022-07-22 17:55:57,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1142. [2022-07-22 17:55:57,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 907 states have (on average 1.328555678059537) internal successors, (1205), 918 states have internal predecessors, (1205), 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) [2022-07-22 17:55:57,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1501 transitions. [2022-07-22 17:55:57,307 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1501 transitions. Word has length 112 [2022-07-22 17:55:57,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:55:57,308 INFO L495 AbstractCegarLoop]: Abstraction has 1142 states and 1501 transitions. [2022-07-22 17:55:57,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 7 states have internal predecessors, (89), 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) [2022-07-22 17:55:57,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1501 transitions. [2022-07-22 17:55:57,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-22 17:55:57,309 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:55:57,309 INFO L195 NwaCegarLoop]: 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] [2022-07-22 17:55:57,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-22 17:55:57,309 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:55:57,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:55:57,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1941201166, now seen corresponding path program 1 times [2022-07-22 17:55:57,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:55:57,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017677151] [2022-07-22 17:55:57,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:55:57,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:55:57,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:57,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 17:55:57,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:57,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 17:55:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:57,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 17:55:57,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:57,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-22 17:55:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:57,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-22 17:55:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:57,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 17:55:57,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:57,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-22 17:55:57,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:57,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-22 17:55:57,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:57,348 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-22 17:55:57,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:55:57,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017677151] [2022-07-22 17:55:57,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017677151] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:55:57,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 17:55:57,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 17:55:57,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575686620] [2022-07-22 17:55:57,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:55:57,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 17:55:57,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:55:57,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 17:55:57,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 17:55:57,350 INFO L87 Difference]: Start difference. First operand 1142 states and 1501 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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) [2022-07-22 17:55:57,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:55:57,586 INFO L93 Difference]: Finished difference Result 3187 states and 4275 transitions. [2022-07-22 17:55:57,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 17:55:57,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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 112 [2022-07-22 17:55:57,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:55:57,597 INFO L225 Difference]: With dead ends: 3187 [2022-07-22 17:55:57,597 INFO L226 Difference]: Without dead ends: 2296 [2022-07-22 17:55:57,599 INFO L412 NwaCegarLoop]: 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 [2022-07-22 17:55:57,599 INFO L413 NwaCegarLoop]: 511 mSDtfsCounter, 440 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 1227 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 [2022-07-22 17:55:57,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 1227 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 17:55:57,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2296 states. [2022-07-22 17:55:57,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2296 to 1939. [2022-07-22 17:55:57,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1939 states, 1514 states have (on average 1.3262879788639366) internal successors, (2008), 1533 states have internal predecessors, (2008), 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) [2022-07-22 17:55:57,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 2552 transitions. [2022-07-22 17:55:57,728 INFO L78 Accepts]: Start accepts. Automaton has 1939 states and 2552 transitions. Word has length 112 [2022-07-22 17:55:57,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:55:57,729 INFO L495 AbstractCegarLoop]: Abstraction has 1939 states and 2552 transitions. [2022-07-22 17:55:57,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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) [2022-07-22 17:55:57,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 2552 transitions. [2022-07-22 17:55:57,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-22 17:55:57,730 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:55:57,730 INFO L195 NwaCegarLoop]: 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] [2022-07-22 17:55:57,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-22 17:55:57,730 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:55:57,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:55:57,731 INFO L85 PathProgramCache]: Analyzing trace with hash -2103041469, now seen corresponding path program 1 times [2022-07-22 17:55:57,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:55:57,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678013739] [2022-07-22 17:55:57,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:55:57,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:55:57,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:57,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 17:55:57,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:57,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 17:55:57,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:57,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 17:55:57,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:57,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-22 17:55:57,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:57,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-22 17:55:57,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:57,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 17:55:57,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:57,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-22 17:55:57,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:57,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-22 17:55:57,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:55:57,843 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-22 17:55:57,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:55:57,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678013739] [2022-07-22 17:55:57,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678013739] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:55:57,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 17:55:57,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 17:55:57,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050300891] [2022-07-22 17:55:57,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:55:57,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 17:55:57,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:55:57,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 17:55:57,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 17:55:57,846 INFO L87 Difference]: Start difference. First operand 1939 states and 2552 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 6 states have internal predecessors, (91), 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) [2022-07-22 17:55:58,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:55:58,421 INFO L93 Difference]: Finished difference Result 4400 states and 5932 transitions. [2022-07-22 17:55:58,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 17:55:58,421 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 6 states have internal predecessors, (91), 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 114 [2022-07-22 17:55:58,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:55:58,431 INFO L225 Difference]: With dead ends: 4400 [2022-07-22 17:55:58,432 INFO L226 Difference]: Without dead ends: 2810 [2022-07-22 17:55:58,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-07-22 17:55:58,437 INFO L413 NwaCegarLoop]: 578 mSDtfsCounter, 806 mSDsluCounter, 1940 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 2518 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.3s IncrementalHoareTripleChecker+Time [2022-07-22 17:55:58,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 2518 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 17:55:58,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2810 states. [2022-07-22 17:55:58,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2810 to 1958. [2022-07-22 17:55:58,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1958 states, 1520 states have (on average 1.3223684210526316) internal successors, (2010), 1540 states have internal predecessors, (2010), 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) [2022-07-22 17:55:58,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1958 states to 1958 states and 2570 transitions. [2022-07-22 17:55:58,601 INFO L78 Accepts]: Start accepts. Automaton has 1958 states and 2570 transitions. Word has length 114 [2022-07-22 17:55:58,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:55:58,601 INFO L495 AbstractCegarLoop]: Abstraction has 1958 states and 2570 transitions. [2022-07-22 17:55:58,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 6 states have internal predecessors, (91), 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) [2022-07-22 17:55:58,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1958 states and 2570 transitions. [2022-07-22 17:55:58,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-22 17:55:58,602 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:55:58,603 INFO L195 NwaCegarLoop]: 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] [2022-07-22 17:55:58,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-22 17:55:58,603 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:55:58,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:55:58,603 INFO L85 PathProgramCache]: Analyzing trace with hash 985009634, now seen corresponding path program 1 times [2022-07-22 17:55:58,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:55:58,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229696548] [2022-07-22 17:55:58,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:55:58,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:55:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 17:55:58,627 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 17:55:58,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 17:55:58,707 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 17:55:58,707 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-22 17:55:58,708 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 17:55:58,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-22 17:55:58,711 INFO L356 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] [2022-07-22 17:55:58,714 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 17:55:58,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 05:55:58 BoogieIcfgContainer [2022-07-22 17:55:58,800 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 17:55:58,800 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 17:55:58,801 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 17:55:58,801 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 17:55:58,801 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 05:55:51" (3/4) ... [2022-07-22 17:55:58,802 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-22 17:55:58,872 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 17:55:58,872 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 17:55:58,872 INFO L158 Benchmark]: Toolchain (without parser) took 7940.55ms. Allocated memory was 115.3MB in the beginning and 564.1MB in the end (delta: 448.8MB). Free memory was 77.5MB in the beginning and 489.6MB in the end (delta: -412.1MB). Peak memory consumption was 37.3MB. Max. memory is 16.1GB. [2022-07-22 17:55:58,872 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 115.3MB. Free memory is still 95.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 17:55:58,873 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.05ms. Allocated memory is still 115.3MB. Free memory was 77.1MB in the beginning and 60.2MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-22 17:55:58,873 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.17ms. Allocated memory is still 115.3MB. Free memory was 60.2MB in the beginning and 92.9MB in the end (delta: -32.7MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2022-07-22 17:55:58,873 INFO L158 Benchmark]: Boogie Preprocessor took 32.33ms. Allocated memory is still 115.3MB. Free memory was 92.9MB in the beginning and 90.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 17:55:58,873 INFO L158 Benchmark]: RCFGBuilder took 547.31ms. Allocated memory is still 115.3MB. Free memory was 90.5MB in the beginning and 62.2MB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-07-22 17:55:58,874 INFO L158 Benchmark]: TraceAbstraction took 6929.81ms. Allocated memory was 115.3MB in the beginning and 564.1MB in the end (delta: 448.8MB). Free memory was 61.7MB in the beginning and 509.4MB in the end (delta: -447.8MB). Peak memory consumption was 311.5MB. Max. memory is 16.1GB. [2022-07-22 17:55:58,874 INFO L158 Benchmark]: Witness Printer took 71.52ms. Allocated memory is still 564.1MB. Free memory was 509.4MB in the beginning and 489.6MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-07-22 17:55:58,875 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 115.3MB. Free memory is still 95.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 288.05ms. Allocated memory is still 115.3MB. Free memory was 77.1MB in the beginning and 60.2MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.17ms. Allocated memory is still 115.3MB. Free memory was 60.2MB in the beginning and 92.9MB in the end (delta: -32.7MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.33ms. Allocated memory is still 115.3MB. Free memory was 92.9MB in the beginning and 90.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 547.31ms. Allocated memory is still 115.3MB. Free memory was 90.5MB in the beginning and 62.2MB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 6929.81ms. Allocated memory was 115.3MB in the beginning and 564.1MB in the end (delta: 448.8MB). Free memory was 61.7MB in the beginning and 509.4MB in the end (delta: -447.8MB). Peak memory consumption was 311.5MB. Max. memory is 16.1GB. * Witness Printer took 71.52ms. Allocated memory is still 564.1MB. Free memory was 509.4MB in the beginning and 489.6MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 619]: 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] [L542] int c1 ; [L543] int i2 ; [L546] c1 = 0 [L547] side1Failed = __VERIFIER_nondet_bool() [L548] side2Failed = __VERIFIER_nondet_bool() [L549] side1_written = __VERIFIER_nondet_char() [L550] side2_written = __VERIFIER_nondet_char() [L551] side1Failed_History_0 = __VERIFIER_nondet_bool() [L552] side1Failed_History_1 = __VERIFIER_nondet_bool() [L553] side1Failed_History_2 = __VERIFIER_nondet_bool() [L554] side2Failed_History_0 = __VERIFIER_nondet_bool() [L555] side2Failed_History_1 = __VERIFIER_nondet_bool() [L556] side2Failed_History_2 = __VERIFIER_nondet_bool() [L557] active_side_History_0 = __VERIFIER_nondet_char() [L558] active_side_History_1 = __VERIFIER_nondet_char() [L559] active_side_History_2 = __VERIFIER_nondet_char() [L560] manual_selection_History_0 = __VERIFIER_nondet_char() [L561] manual_selection_History_1 = __VERIFIER_nondet_char() [L562] manual_selection_History_2 = __VERIFIER_nondet_char() [L563] 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] [L563] RET, EXPR init() [L563] i2 = init() [L564] 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] [L564] 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] [L565] cs1_old = nomsg [L566] cs1_new = nomsg [L567] cs2_old = nomsg [L568] cs2_new = nomsg [L569] s1s2_old = nomsg [L570] s1s2_new = nomsg [L571] s1s1_old = nomsg [L572] s1s1_new = nomsg [L573] s2s1_old = nomsg [L574] s2s1_new = nomsg [L575] s2s2_old = nomsg [L576] s2s2_new = nomsg [L577] s1p_old = nomsg [L578] s1p_new = nomsg [L579] s2p_old = nomsg [L580] s2p_new = nomsg [L581] 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] [L582] COND TRUE i2 < 10 [L584] 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=-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=-128, 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=-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=-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=-128, manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new=-128, manual_selection_History_0=-128, 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=-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=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-128, manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new=-128, manual_selection_History_0=-128, 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=-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=-2, 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=-1, manual_selection=0, manual_selection_History_0=-128, 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=-128] [L584] RET Console_task_each_pals_period() [L585] 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=-2, 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=-1, manual_selection_History_0=-128, 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=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=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=-2, 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=-1, manual_selection=-1, manual_selection_History_0=-128, 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=0, side1Failed_History_0=0, 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] [L290] COND TRUE (int )side1 == (int )side2 [L291] next_state = (int8_t )1 VAL [active_side_History_0=-2, 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=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, 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=0, side1Failed_History_0=0, 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] [L314] EXPR next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new VAL [active_side_History_0=-2, 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=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new=1, 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=0, side1Failed_History_0=0, 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] [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=-2, 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=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new=1, 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=0, side1Failed_History_0=0, 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] [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=-2, 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=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new=1, 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=0, side1Failed_History_0=0, 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] [L316] s1p_new = next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new [L317] side1_written = next_state VAL [active_side_History_0=-2, 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=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, 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=0, side1Failed_History_0=0, 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] [L585] RET Side1_activestandby_task_each_pals_period() [L586] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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=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, 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, 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=0, side1Failed_History_0=0, 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 )1 VAL [active_side_History_0=-2, 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=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, 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=0, side1Failed_History_0=0, 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new=1, 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=0, side1Failed_History_0=0, 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new=1, 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=0, side1Failed_History_0=0, 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new=1, 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=0, side1Failed_History_0=0, 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, 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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L586] RET Side2_activestandby_task_each_pals_period() [L587] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, index=0, manual_selection_History_0=-128, 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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L400] COND FALSE !((int )side1 == 0) VAL [active_side=-2, active_side_History_0=-2, 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=-1, manual_selection_History_0=-128, 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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L408] COND TRUE (int )side1 == (int )nomsg VAL [active_side=-2, active_side_History_0=-2, 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=-1, manual_selection_History_0=-128, 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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L409] COND FALSE !((int )side2 == 0) [L412] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L417] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L417] RET write_active_side_history(active_side) [L587] RET Pendulum_prism_task_each_pals_period() [L588] cs1_old = cs1_new [L589] cs1_new = nomsg [L590] cs2_old = cs2_new [L591] cs2_new = nomsg [L592] s1s2_old = s1s2_new [L593] s1s2_new = nomsg [L594] s1s1_old = s1s1_new [L595] s1s1_new = nomsg [L596] s2s1_old = s2s1_new [L597] s2s1_new = nomsg [L598] s2s2_old = s2s2_new [L599] s2s2_new = nomsg [L600] s1p_old = s1p_new [L601] s1p_new = nomsg [L602] s2p_old = s2p_new [L603] s2p_new = nomsg [L604] CALL, EXPR check() [L423] int tmp ; [L424] msg_t tmp___0 ; [L425] _Bool tmp___1 ; [L426] _Bool tmp___2 ; [L427] _Bool tmp___3 ; [L428] _Bool tmp___4 ; [L429] int8_t tmp___5 ; [L430] _Bool tmp___6 ; [L431] _Bool tmp___7 ; [L432] _Bool tmp___8 ; [L433] int8_t tmp___9 ; [L434] _Bool tmp___10 ; [L435] _Bool tmp___11 ; [L436] _Bool tmp___12 ; [L437] msg_t tmp___13 ; [L438] _Bool tmp___14 ; [L439] _Bool tmp___15 ; [L440] _Bool tmp___16 ; [L441] _Bool tmp___17 ; [L442] int8_t tmp___18 ; [L443] int8_t tmp___19 ; [L444] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L447] COND TRUE ! side1Failed [L448] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L455] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L455] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L456] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, 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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, 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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L456] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L456] tmp___0 = read_manual_selection_history((unsigned char)1) [L457] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0] [L458] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, 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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, 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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L458] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0] [L458] tmp___1 = read_side1_failed_history((unsigned char)1) [L459] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0] [L460] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, 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=0, active_side_History_0=0, active_side_History_1=-2, 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=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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L460] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)0)=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=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0] [L460] tmp___2 = read_side1_failed_history((unsigned char)0) [L461] COND TRUE ! 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0] [L462] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, 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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, 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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L462] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0] [L462] tmp___3 = read_side2_failed_history((unsigned char)1) [L463] COND TRUE ! tmp___3 VAL [active_side_History_0=0, active_side_History_1=-2, 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=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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0] [L464] CALL, EXPR read_side2_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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L118] COND TRUE (int )index == 0 [L119] return (side2Failed_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=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=0, manual_selection_History_0=-128, 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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L464] RET, EXPR read_side2_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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)0)=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=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0] [L464] tmp___4 = read_side2_failed_history((unsigned char)0) [L465] COND TRUE ! tmp___4 VAL [active_side_History_0=0, active_side_History_1=-2, 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=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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L466] COND FALSE !(! ((int )side1_written == 1)) VAL [active_side_History_0=0, active_side_History_1=-2, 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=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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L471] COND FALSE !(! (! ((int )side1_written == 0))) VAL [active_side_History_0=0, active_side_History_1=-2, 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=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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L476] COND TRUE ! (! ((int )side1_written == 1)) VAL [active_side_History_0=0, active_side_History_1=-2, 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=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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L477] COND TRUE ! ((int )side2_written == 0) [L478] return (0); VAL [\result=0, active_side_History_0=0, active_side_History_1=-2, 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=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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L604] RET, EXPR check() [L604] c1 = check() [L605] CALL assert(c1) VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=-2, 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=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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L617] COND TRUE ! arg VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=-2, 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=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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L619] reach_error() VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=-2, 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=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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 207 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.8s, OverallIterations: 22, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6359 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6240 mSDsluCounter, 26712 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19036 mSDsCounter, 640 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2202 IncrementalHoareTripleChecker+Invalid, 2842 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 640 mSolverCounterUnsat, 7676 mSDtfsCounter, 2202 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 375 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1958occurred in iteration=21, InterpolantAutomatonStates: 120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 4999 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1939 NumberOfCodeBlocks, 1939 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1803 ConstructedInterpolants, 0 QuantifiedInterpolants, 4600 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 147/147 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-22 17:55:58,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE