./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9a8b2e8d 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.3.100.v20150511-1540.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.UNBOUNDED.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 4d736f5fb56dbc98992c0fdc98ee39e0d406f4f5 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 01:53:56,933 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 01:53:56,936 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 01:53:56,978 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 01:53:56,979 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 01:53:56,987 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 01:53:56,990 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 01:53:56,994 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 01:53:57,004 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 01:53:57,007 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 01:53:57,009 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 01:53:57,010 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 01:53:57,010 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 01:53:57,014 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 01:53:57,015 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 01:53:57,017 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 01:53:57,019 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 01:53:57,020 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 01:53:57,022 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 01:53:57,029 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 01:53:57,031 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 01:53:57,032 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 01:53:57,035 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 01:53:57,035 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 01:53:57,037 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 01:53:57,038 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 01:53:57,038 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 01:53:57,038 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 01:53:57,039 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 01:53:57,040 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 01:53:57,040 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 01:53:57,040 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 01:53:57,041 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 01:53:57,042 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 01:53:57,043 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 01:53:57,043 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 01:53:57,043 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 01:53:57,043 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 01:53:57,044 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 01:53:57,044 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 01:53:57,045 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 01:53:57,046 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-20 01:53:57,070 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 01:53:57,070 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 01:53:57,071 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 01:53:57,072 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 01:53:57,072 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 01:53:57,072 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 01:53:57,072 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 01:53:57,072 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 01:53:57,073 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 01:53:57,073 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 01:53:57,073 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 01:53:57,073 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 01:53:57,073 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 01:53:57,074 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 01:53:57,074 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 01:53:57,074 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 01:53:57,074 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 01:53:57,074 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 01:53:57,075 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 01:53:57,075 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 01:53:57,075 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 01:53:57,075 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 01:53:57,075 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 01:53:57,076 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 01:53:57,076 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 01:53:57,076 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 01:53:57,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 01:53:57,076 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 01:53:57,076 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 01:53:57,077 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 4d736f5fb56dbc98992c0fdc98ee39e0d406f4f5 [2020-10-20 01:53:57,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 01:53:57,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 01:53:57,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 01:53:57,299 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 01:53:57,299 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 01:53:57,300 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.UNBOUNDED.pals.c [2020-10-20 01:53:57,365 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b16227c2/a2d10dda520d445cba0c8514b27b1581/FLAG986820746 [2020-10-20 01:53:57,908 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 01:53:57,909 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c [2020-10-20 01:53:57,920 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b16227c2/a2d10dda520d445cba0c8514b27b1581/FLAG986820746 [2020-10-20 01:53:58,202 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b16227c2/a2d10dda520d445cba0c8514b27b1581 [2020-10-20 01:53:58,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 01:53:58,212 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 01:53:58,214 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 01:53:58,214 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 01:53:58,218 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 01:53:58,219 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 01:53:58" (1/1) ... [2020-10-20 01:53:58,224 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d9b3116 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:58, skipping insertion in model container [2020-10-20 01:53:58,225 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 01:53:58" (1/1) ... [2020-10-20 01:53:58,233 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 01:53:58,288 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 01:53:58,661 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 01:53:58,674 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 01:53:58,760 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 01:53:58,784 INFO L208 MainTranslator]: Completed translation [2020-10-20 01:53:58,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:58 WrapperNode [2020-10-20 01:53:58,785 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 01:53:58,786 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 01:53:58,786 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 01:53:58,786 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 01:53:58,795 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:58" (1/1) ... [2020-10-20 01:53:58,811 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:58" (1/1) ... [2020-10-20 01:53:58,882 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 01:53:58,883 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 01:53:58,883 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 01:53:58,883 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 01:53:58,891 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:58" (1/1) ... [2020-10-20 01:53:58,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:58" (1/1) ... [2020-10-20 01:53:58,899 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:58" (1/1) ... [2020-10-20 01:53:58,899 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:58" (1/1) ... [2020-10-20 01:53:58,918 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:58" (1/1) ... [2020-10-20 01:53:58,930 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:58" (1/1) ... [2020-10-20 01:53:58,936 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:58" (1/1) ... [2020-10-20 01:53:58,945 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 01:53:58,946 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 01:53:58,946 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 01:53:58,946 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 01:53:58,947 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 01:53:59,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 01:53:59,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 01:53:59,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 01:53:59,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 01:54:00,256 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 01:54:00,257 INFO L298 CfgBuilder]: Removed 169 assume(true) statements. [2020-10-20 01:54:00,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:54:00 BoogieIcfgContainer [2020-10-20 01:54:00,259 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 01:54:00,261 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 01:54:00,261 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 01:54:00,265 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 01:54:00,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 01:53:58" (1/3) ... [2020-10-20 01:54:00,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c5d3f2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 01:54:00, skipping insertion in model container [2020-10-20 01:54:00,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:58" (2/3) ... [2020-10-20 01:54:00,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c5d3f2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 01:54:00, skipping insertion in model container [2020-10-20 01:54:00,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:54:00" (3/3) ... [2020-10-20 01:54:00,269 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c [2020-10-20 01:54:00,282 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 01:54:00,290 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2020-10-20 01:54:00,304 INFO L253 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2020-10-20 01:54:00,333 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 01:54:00,333 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 01:54:00,333 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 01:54:00,333 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 01:54:00,333 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 01:54:00,334 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 01:54:00,334 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 01:54:00,334 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 01:54:00,363 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states. [2020-10-20 01:54:00,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-10-20 01:54:00,371 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:00,372 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:54:00,373 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:54:00,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:00,379 INFO L82 PathProgramCache]: Analyzing trace with hash 349506240, now seen corresponding path program 1 times [2020-10-20 01:54:00,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:00,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624372421] [2020-10-20 01:54:00,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:00,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:00,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:00,639 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624372421] [2020-10-20 01:54:00,640 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:00,641 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 01:54:00,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354057908] [2020-10-20 01:54:00,646 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-20 01:54:00,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:00,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-20 01:54:00,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-20 01:54:00,663 INFO L87 Difference]: Start difference. First operand 319 states. Second operand 2 states. [2020-10-20 01:54:00,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:00,732 INFO L93 Difference]: Finished difference Result 595 states and 919 transitions. [2020-10-20 01:54:00,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-20 01:54:00,733 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 33 [2020-10-20 01:54:00,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:00,754 INFO L225 Difference]: With dead ends: 595 [2020-10-20 01:54:00,754 INFO L226 Difference]: Without dead ends: 292 [2020-10-20 01:54:00,760 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-20 01:54:00,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2020-10-20 01:54:00,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2020-10-20 01:54:00,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2020-10-20 01:54:00,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 428 transitions. [2020-10-20 01:54:00,820 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 428 transitions. Word has length 33 [2020-10-20 01:54:00,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:00,821 INFO L481 AbstractCegarLoop]: Abstraction has 292 states and 428 transitions. [2020-10-20 01:54:00,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-20 01:54:00,821 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 428 transitions. [2020-10-20 01:54:00,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-10-20 01:54:00,823 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:00,823 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:54:00,823 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 01:54:00,824 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:54:00,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:00,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1047215368, now seen corresponding path program 1 times [2020-10-20 01:54:00,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:00,825 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730217424] [2020-10-20 01:54:00,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:00,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:00,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:00,946 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730217424] [2020-10-20 01:54:00,946 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:00,946 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:54:00,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592369706] [2020-10-20 01:54:00,949 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:54:00,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:00,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:54:00,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:54:00,950 INFO L87 Difference]: Start difference. First operand 292 states and 428 transitions. Second operand 4 states. [2020-10-20 01:54:01,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:01,055 INFO L93 Difference]: Finished difference Result 570 states and 830 transitions. [2020-10-20 01:54:01,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 01:54:01,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2020-10-20 01:54:01,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:01,061 INFO L225 Difference]: With dead ends: 570 [2020-10-20 01:54:01,063 INFO L226 Difference]: Without dead ends: 292 [2020-10-20 01:54:01,068 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:54:01,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2020-10-20 01:54:01,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2020-10-20 01:54:01,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2020-10-20 01:54:01,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 416 transitions. [2020-10-20 01:54:01,108 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 416 transitions. Word has length 33 [2020-10-20 01:54:01,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:01,109 INFO L481 AbstractCegarLoop]: Abstraction has 292 states and 416 transitions. [2020-10-20 01:54:01,109 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:54:01,110 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 416 transitions. [2020-10-20 01:54:01,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-10-20 01:54:01,113 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:01,114 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:54:01,114 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 01:54:01,115 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:54:01,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:01,116 INFO L82 PathProgramCache]: Analyzing trace with hash -600938825, now seen corresponding path program 1 times [2020-10-20 01:54:01,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:01,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885979004] [2020-10-20 01:54:01,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:01,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:01,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:01,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885979004] [2020-10-20 01:54:01,282 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:01,282 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:54:01,282 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563799036] [2020-10-20 01:54:01,283 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:54:01,283 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:01,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:54:01,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:54:01,284 INFO L87 Difference]: Start difference. First operand 292 states and 416 transitions. Second operand 3 states. [2020-10-20 01:54:01,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:01,553 INFO L93 Difference]: Finished difference Result 600 states and 864 transitions. [2020-10-20 01:54:01,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:54:01,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2020-10-20 01:54:01,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:01,557 INFO L225 Difference]: With dead ends: 600 [2020-10-20 01:54:01,557 INFO L226 Difference]: Without dead ends: 325 [2020-10-20 01:54:01,558 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:54:01,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2020-10-20 01:54:01,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 268. [2020-10-20 01:54:01,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2020-10-20 01:54:01,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 380 transitions. [2020-10-20 01:54:01,573 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 380 transitions. Word has length 44 [2020-10-20 01:54:01,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:01,574 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 380 transitions. [2020-10-20 01:54:01,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:54:01,574 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 380 transitions. [2020-10-20 01:54:01,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-10-20 01:54:01,575 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:01,576 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:54:01,576 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 01:54:01,576 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:54:01,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:01,577 INFO L82 PathProgramCache]: Analyzing trace with hash 99262784, now seen corresponding path program 1 times [2020-10-20 01:54:01,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:01,577 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854520036] [2020-10-20 01:54:01,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:01,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:01,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:01,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854520036] [2020-10-20 01:54:01,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:01,713 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:54:01,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507424868] [2020-10-20 01:54:01,713 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:54:01,714 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:01,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:54:01,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:54:01,715 INFO L87 Difference]: Start difference. First operand 268 states and 380 transitions. Second operand 3 states. [2020-10-20 01:54:01,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:01,767 INFO L93 Difference]: Finished difference Result 747 states and 1071 transitions. [2020-10-20 01:54:01,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:54:01,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-10-20 01:54:01,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:01,771 INFO L225 Difference]: With dead ends: 747 [2020-10-20 01:54:01,771 INFO L226 Difference]: Without dead ends: 496 [2020-10-20 01:54:01,772 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:54:01,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2020-10-20 01:54:01,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 303. [2020-10-20 01:54:01,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2020-10-20 01:54:01,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 432 transitions. [2020-10-20 01:54:01,788 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 432 transitions. Word has length 53 [2020-10-20 01:54:01,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:01,789 INFO L481 AbstractCegarLoop]: Abstraction has 303 states and 432 transitions. [2020-10-20 01:54:01,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:54:01,790 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 432 transitions. [2020-10-20 01:54:01,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-10-20 01:54:01,791 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:01,792 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:54:01,792 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 01:54:01,792 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:54:01,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:01,793 INFO L82 PathProgramCache]: Analyzing trace with hash -723036760, now seen corresponding path program 1 times [2020-10-20 01:54:01,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:01,794 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533697915] [2020-10-20 01:54:01,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:01,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:01,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533697915] [2020-10-20 01:54:01,865 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:01,865 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:54:01,865 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276401471] [2020-10-20 01:54:01,866 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:54:01,866 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:01,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:54:01,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:54:01,867 INFO L87 Difference]: Start difference. First operand 303 states and 432 transitions. Second operand 3 states. [2020-10-20 01:54:01,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:01,907 INFO L93 Difference]: Finished difference Result 831 states and 1196 transitions. [2020-10-20 01:54:01,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:54:01,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-10-20 01:54:01,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:01,912 INFO L225 Difference]: With dead ends: 831 [2020-10-20 01:54:01,912 INFO L226 Difference]: Without dead ends: 545 [2020-10-20 01:54:01,913 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:54:01,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-10-20 01:54:01,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 328. [2020-10-20 01:54:01,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2020-10-20 01:54:01,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 470 transitions. [2020-10-20 01:54:01,929 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 470 transitions. Word has length 54 [2020-10-20 01:54:01,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:01,930 INFO L481 AbstractCegarLoop]: Abstraction has 328 states and 470 transitions. [2020-10-20 01:54:01,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:54:01,940 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 470 transitions. [2020-10-20 01:54:01,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-10-20 01:54:01,942 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:01,943 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:54:01,943 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 01:54:01,943 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:54:01,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:01,943 INFO L82 PathProgramCache]: Analyzing trace with hash -42978390, now seen corresponding path program 1 times [2020-10-20 01:54:01,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:01,944 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976656081] [2020-10-20 01:54:01,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:01,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:02,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:02,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976656081] [2020-10-20 01:54:02,031 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:02,031 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:54:02,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671436837] [2020-10-20 01:54:02,032 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:54:02,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:02,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:54:02,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:54:02,032 INFO L87 Difference]: Start difference. First operand 328 states and 470 transitions. Second operand 5 states. [2020-10-20 01:54:02,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:02,294 INFO L93 Difference]: Finished difference Result 1020 states and 1473 transitions. [2020-10-20 01:54:02,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 01:54:02,294 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2020-10-20 01:54:02,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:02,299 INFO L225 Difference]: With dead ends: 1020 [2020-10-20 01:54:02,299 INFO L226 Difference]: Without dead ends: 709 [2020-10-20 01:54:02,301 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-20 01:54:02,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2020-10-20 01:54:02,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 426. [2020-10-20 01:54:02,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2020-10-20 01:54:02,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 607 transitions. [2020-10-20 01:54:02,324 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 607 transitions. Word has length 54 [2020-10-20 01:54:02,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:02,325 INFO L481 AbstractCegarLoop]: Abstraction has 426 states and 607 transitions. [2020-10-20 01:54:02,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:54:02,325 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 607 transitions. [2020-10-20 01:54:02,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-10-20 01:54:02,326 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:02,326 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:54:02,326 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-20 01:54:02,327 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:54:02,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:02,327 INFO L82 PathProgramCache]: Analyzing trace with hash -453489560, now seen corresponding path program 1 times [2020-10-20 01:54:02,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:02,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644544228] [2020-10-20 01:54:02,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:02,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:02,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:02,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644544228] [2020-10-20 01:54:02,418 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:02,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:54:02,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396420859] [2020-10-20 01:54:02,418 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:54:02,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:02,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:54:02,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:54:02,419 INFO L87 Difference]: Start difference. First operand 426 states and 607 transitions. Second operand 5 states. [2020-10-20 01:54:02,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:02,697 INFO L93 Difference]: Finished difference Result 1024 states and 1473 transitions. [2020-10-20 01:54:02,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 01:54:02,697 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2020-10-20 01:54:02,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:02,701 INFO L225 Difference]: With dead ends: 1024 [2020-10-20 01:54:02,701 INFO L226 Difference]: Without dead ends: 713 [2020-10-20 01:54:02,703 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-20 01:54:02,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2020-10-20 01:54:02,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 434. [2020-10-20 01:54:02,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2020-10-20 01:54:02,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 615 transitions. [2020-10-20 01:54:02,727 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 615 transitions. Word has length 55 [2020-10-20 01:54:02,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:02,728 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 615 transitions. [2020-10-20 01:54:02,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:54:02,728 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 615 transitions. [2020-10-20 01:54:02,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-10-20 01:54:02,729 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:02,729 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:54:02,730 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-20 01:54:02,730 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:54:02,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:02,730 INFO L82 PathProgramCache]: Analyzing trace with hash 330004758, now seen corresponding path program 1 times [2020-10-20 01:54:02,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:02,731 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516726455] [2020-10-20 01:54:02,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:02,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:02,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:02,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516726455] [2020-10-20 01:54:02,869 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:02,869 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:54:02,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512665948] [2020-10-20 01:54:02,869 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:54:02,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:02,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:54:02,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:54:02,870 INFO L87 Difference]: Start difference. First operand 434 states and 615 transitions. Second operand 4 states. [2020-10-20 01:54:03,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:03,095 INFO L93 Difference]: Finished difference Result 1024 states and 1465 transitions. [2020-10-20 01:54:03,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:54:03,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2020-10-20 01:54:03,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:03,101 INFO L225 Difference]: With dead ends: 1024 [2020-10-20 01:54:03,101 INFO L226 Difference]: Without dead ends: 713 [2020-10-20 01:54:03,102 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:54:03,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2020-10-20 01:54:03,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 434. [2020-10-20 01:54:03,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2020-10-20 01:54:03,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 611 transitions. [2020-10-20 01:54:03,127 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 611 transitions. Word has length 57 [2020-10-20 01:54:03,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:03,129 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 611 transitions. [2020-10-20 01:54:03,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:54:03,129 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 611 transitions. [2020-10-20 01:54:03,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-10-20 01:54:03,131 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:03,132 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:54:03,132 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-20 01:54:03,132 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:54:03,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:03,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1119773532, now seen corresponding path program 1 times [2020-10-20 01:54:03,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:03,134 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781307603] [2020-10-20 01:54:03,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:03,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:03,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781307603] [2020-10-20 01:54:03,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:03,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:54:03,250 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912548105] [2020-10-20 01:54:03,251 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:54:03,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:03,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:54:03,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:54:03,252 INFO L87 Difference]: Start difference. First operand 434 states and 611 transitions. Second operand 3 states. [2020-10-20 01:54:03,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:03,300 INFO L93 Difference]: Finished difference Result 872 states and 1252 transitions. [2020-10-20 01:54:03,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:54:03,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2020-10-20 01:54:03,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:03,304 INFO L225 Difference]: With dead ends: 872 [2020-10-20 01:54:03,304 INFO L226 Difference]: Without dead ends: 561 [2020-10-20 01:54:03,305 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:54:03,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-10-20 01:54:03,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 429. [2020-10-20 01:54:03,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2020-10-20 01:54:03,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 603 transitions. [2020-10-20 01:54:03,327 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 603 transitions. Word has length 58 [2020-10-20 01:54:03,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:03,328 INFO L481 AbstractCegarLoop]: Abstraction has 429 states and 603 transitions. [2020-10-20 01:54:03,328 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:54:03,328 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 603 transitions. [2020-10-20 01:54:03,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-10-20 01:54:03,329 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:03,329 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:54:03,329 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-20 01:54:03,330 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:54:03,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:03,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1515172982, now seen corresponding path program 1 times [2020-10-20 01:54:03,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:03,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639801206] [2020-10-20 01:54:03,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:03,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:03,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:03,409 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639801206] [2020-10-20 01:54:03,409 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:03,409 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:54:03,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833224219] [2020-10-20 01:54:03,410 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:54:03,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:03,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:54:03,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:54:03,410 INFO L87 Difference]: Start difference. First operand 429 states and 603 transitions. Second operand 3 states. [2020-10-20 01:54:03,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:03,492 INFO L93 Difference]: Finished difference Result 871 states and 1251 transitions. [2020-10-20 01:54:03,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:54:03,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2020-10-20 01:54:03,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:03,499 INFO L225 Difference]: With dead ends: 871 [2020-10-20 01:54:03,500 INFO L226 Difference]: Without dead ends: 565 [2020-10-20 01:54:03,501 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:54:03,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-10-20 01:54:03,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 409. [2020-10-20 01:54:03,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2020-10-20 01:54:03,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 571 transitions. [2020-10-20 01:54:03,524 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 571 transitions. Word has length 62 [2020-10-20 01:54:03,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:03,525 INFO L481 AbstractCegarLoop]: Abstraction has 409 states and 571 transitions. [2020-10-20 01:54:03,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:54:03,525 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 571 transitions. [2020-10-20 01:54:03,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-10-20 01:54:03,526 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:03,526 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:54:03,527 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-20 01:54:03,527 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:54:03,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:03,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1202851696, now seen corresponding path program 1 times [2020-10-20 01:54:03,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:03,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892851904] [2020-10-20 01:54:03,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:03,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:03,608 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892851904] [2020-10-20 01:54:03,608 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:03,608 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:54:03,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066998463] [2020-10-20 01:54:03,609 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:54:03,609 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:03,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:54:03,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:54:03,610 INFO L87 Difference]: Start difference. First operand 409 states and 571 transitions. Second operand 3 states. [2020-10-20 01:54:03,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:03,673 INFO L93 Difference]: Finished difference Result 839 states and 1195 transitions. [2020-10-20 01:54:03,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:54:03,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-10-20 01:54:03,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:03,677 INFO L225 Difference]: With dead ends: 839 [2020-10-20 01:54:03,677 INFO L226 Difference]: Without dead ends: 553 [2020-10-20 01:54:03,678 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:54:03,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-10-20 01:54:03,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 397. [2020-10-20 01:54:03,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-10-20 01:54:03,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 553 transitions. [2020-10-20 01:54:03,699 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 553 transitions. Word has length 66 [2020-10-20 01:54:03,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:03,699 INFO L481 AbstractCegarLoop]: Abstraction has 397 states and 553 transitions. [2020-10-20 01:54:03,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:54:03,700 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 553 transitions. [2020-10-20 01:54:03,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-10-20 01:54:03,700 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:03,700 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:54:03,701 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-20 01:54:03,701 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:54:03,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:03,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1923059486, now seen corresponding path program 1 times [2020-10-20 01:54:03,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:03,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829728548] [2020-10-20 01:54:03,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:03,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:03,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:03,780 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829728548] [2020-10-20 01:54:03,780 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:03,780 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 01:54:03,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43419388] [2020-10-20 01:54:03,781 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 01:54:03,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:03,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 01:54:03,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:54:03,782 INFO L87 Difference]: Start difference. First operand 397 states and 553 transitions. Second operand 6 states. [2020-10-20 01:54:03,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:03,986 INFO L93 Difference]: Finished difference Result 1453 states and 2062 transitions. [2020-10-20 01:54:03,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 01:54:03,987 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2020-10-20 01:54:03,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:03,995 INFO L225 Difference]: With dead ends: 1453 [2020-10-20 01:54:03,995 INFO L226 Difference]: Without dead ends: 1179 [2020-10-20 01:54:03,997 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-10-20 01:54:03,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2020-10-20 01:54:04,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 418. [2020-10-20 01:54:04,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2020-10-20 01:54:04,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 577 transitions. [2020-10-20 01:54:04,060 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 577 transitions. Word has length 67 [2020-10-20 01:54:04,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:04,060 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 577 transitions. [2020-10-20 01:54:04,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 01:54:04,060 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 577 transitions. [2020-10-20 01:54:04,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-10-20 01:54:04,061 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:04,061 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:54:04,061 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-20 01:54:04,061 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:54:04,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:04,062 INFO L82 PathProgramCache]: Analyzing trace with hash -245301035, now seen corresponding path program 1 times [2020-10-20 01:54:04,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:04,062 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54617153] [2020-10-20 01:54:04,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:04,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:04,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:04,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54617153] [2020-10-20 01:54:04,135 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:04,135 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:54:04,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875711014] [2020-10-20 01:54:04,136 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:54:04,136 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:04,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:54:04,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:54:04,137 INFO L87 Difference]: Start difference. First operand 418 states and 577 transitions. Second operand 3 states. [2020-10-20 01:54:04,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:04,251 INFO L93 Difference]: Finished difference Result 856 states and 1211 transitions. [2020-10-20 01:54:04,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:54:04,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2020-10-20 01:54:04,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:04,255 INFO L225 Difference]: With dead ends: 856 [2020-10-20 01:54:04,255 INFO L226 Difference]: Without dead ends: 582 [2020-10-20 01:54:04,256 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:54:04,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-10-20 01:54:04,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 398. [2020-10-20 01:54:04,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-10-20 01:54:04,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 545 transitions. [2020-10-20 01:54:04,286 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 545 transitions. Word has length 69 [2020-10-20 01:54:04,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:04,287 INFO L481 AbstractCegarLoop]: Abstraction has 398 states and 545 transitions. [2020-10-20 01:54:04,287 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:54:04,287 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 545 transitions. [2020-10-20 01:54:04,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-10-20 01:54:04,288 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:04,288 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:54:04,288 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-20 01:54:04,289 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:54:04,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:04,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1825438353, now seen corresponding path program 1 times [2020-10-20 01:54:04,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:04,290 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290459752] [2020-10-20 01:54:04,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:04,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:04,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:04,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290459752] [2020-10-20 01:54:04,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:04,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:54:04,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892014555] [2020-10-20 01:54:04,354 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:54:04,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:04,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:54:04,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:54:04,355 INFO L87 Difference]: Start difference. First operand 398 states and 545 transitions. Second operand 3 states. [2020-10-20 01:54:04,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:04,433 INFO L93 Difference]: Finished difference Result 824 states and 1155 transitions. [2020-10-20 01:54:04,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:54:04,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2020-10-20 01:54:04,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:04,437 INFO L225 Difference]: With dead ends: 824 [2020-10-20 01:54:04,437 INFO L226 Difference]: Without dead ends: 570 [2020-10-20 01:54:04,439 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:54:04,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-10-20 01:54:04,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 386. [2020-10-20 01:54:04,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-10-20 01:54:04,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 527 transitions. [2020-10-20 01:54:04,474 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 527 transitions. Word has length 73 [2020-10-20 01:54:04,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:04,475 INFO L481 AbstractCegarLoop]: Abstraction has 386 states and 527 transitions. [2020-10-20 01:54:04,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:54:04,475 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 527 transitions. [2020-10-20 01:54:04,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-10-20 01:54:04,476 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:04,476 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:54:04,476 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-20 01:54:04,476 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:54:04,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:04,477 INFO L82 PathProgramCache]: Analyzing trace with hash -2056934364, now seen corresponding path program 1 times [2020-10-20 01:54:04,479 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:04,479 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656061589] [2020-10-20 01:54:04,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:04,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:04,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:04,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656061589] [2020-10-20 01:54:04,652 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:04,652 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 01:54:04,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480245241] [2020-10-20 01:54:04,653 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 01:54:04,653 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:04,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 01:54:04,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:54:04,654 INFO L87 Difference]: Start difference. First operand 386 states and 527 transitions. Second operand 6 states. [2020-10-20 01:54:05,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:05,012 INFO L93 Difference]: Finished difference Result 1360 states and 1899 transitions. [2020-10-20 01:54:05,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 01:54:05,013 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2020-10-20 01:54:05,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:05,018 INFO L225 Difference]: With dead ends: 1360 [2020-10-20 01:54:05,018 INFO L226 Difference]: Without dead ends: 1118 [2020-10-20 01:54:05,019 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-10-20 01:54:05,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2020-10-20 01:54:05,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 407. [2020-10-20 01:54:05,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2020-10-20 01:54:05,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 550 transitions. [2020-10-20 01:54:05,056 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 550 transitions. Word has length 76 [2020-10-20 01:54:05,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:05,057 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 550 transitions. [2020-10-20 01:54:05,057 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 01:54:05,057 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 550 transitions. [2020-10-20 01:54:05,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-10-20 01:54:05,058 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:05,058 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:54:05,058 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-20 01:54:05,058 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:54:05,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:05,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1147880773, now seen corresponding path program 1 times [2020-10-20 01:54:05,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:05,059 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617419668] [2020-10-20 01:54:05,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:05,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:05,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:05,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617419668] [2020-10-20 01:54:05,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:05,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 01:54:05,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797837034] [2020-10-20 01:54:05,201 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 01:54:05,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:05,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 01:54:05,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:54:05,202 INFO L87 Difference]: Start difference. First operand 407 states and 550 transitions. Second operand 6 states. [2020-10-20 01:54:05,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:05,450 INFO L93 Difference]: Finished difference Result 1146 states and 1591 transitions. [2020-10-20 01:54:05,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 01:54:05,450 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2020-10-20 01:54:05,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:05,456 INFO L225 Difference]: With dead ends: 1146 [2020-10-20 01:54:05,456 INFO L226 Difference]: Without dead ends: 890 [2020-10-20 01:54:05,457 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-10-20 01:54:05,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2020-10-20 01:54:05,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 439. [2020-10-20 01:54:05,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2020-10-20 01:54:05,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 593 transitions. [2020-10-20 01:54:05,506 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 593 transitions. Word has length 76 [2020-10-20 01:54:05,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:05,506 INFO L481 AbstractCegarLoop]: Abstraction has 439 states and 593 transitions. [2020-10-20 01:54:05,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 01:54:05,506 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 593 transitions. [2020-10-20 01:54:05,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-10-20 01:54:05,507 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:05,507 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:54:05,508 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-20 01:54:05,508 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:54:05,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:05,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1062360642, now seen corresponding path program 1 times [2020-10-20 01:54:05,508 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:05,509 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008456100] [2020-10-20 01:54:05,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:05,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:05,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:05,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008456100] [2020-10-20 01:54:05,569 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:05,569 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:54:05,570 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530424474] [2020-10-20 01:54:05,570 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:54:05,570 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:05,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:54:05,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:54:05,571 INFO L87 Difference]: Start difference. First operand 439 states and 593 transitions. Second operand 4 states. [2020-10-20 01:54:05,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:05,742 INFO L93 Difference]: Finished difference Result 1127 states and 1539 transitions. [2020-10-20 01:54:05,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:54:05,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2020-10-20 01:54:05,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:05,747 INFO L225 Difference]: With dead ends: 1127 [2020-10-20 01:54:05,747 INFO L226 Difference]: Without dead ends: 861 [2020-10-20 01:54:05,748 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:54:05,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2020-10-20 01:54:05,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 660. [2020-10-20 01:54:05,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2020-10-20 01:54:05,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 881 transitions. [2020-10-20 01:54:05,804 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 881 transitions. Word has length 76 [2020-10-20 01:54:05,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:05,804 INFO L481 AbstractCegarLoop]: Abstraction has 660 states and 881 transitions. [2020-10-20 01:54:05,804 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:54:05,805 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 881 transitions. [2020-10-20 01:54:05,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-10-20 01:54:05,808 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:05,808 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:54:05,808 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-20 01:54:05,808 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:54:05,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:05,809 INFO L82 PathProgramCache]: Analyzing trace with hash -975872680, now seen corresponding path program 1 times [2020-10-20 01:54:05,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:05,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264233557] [2020-10-20 01:54:05,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:05,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:05,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:05,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264233557] [2020-10-20 01:54:05,882 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:05,882 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:54:05,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13428251] [2020-10-20 01:54:05,883 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:54:05,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:05,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:54:05,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:54:05,889 INFO L87 Difference]: Start difference. First operand 660 states and 881 transitions. Second operand 3 states. [2020-10-20 01:54:05,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:05,983 INFO L93 Difference]: Finished difference Result 1151 states and 1571 transitions. [2020-10-20 01:54:05,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:54:05,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2020-10-20 01:54:05,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:05,988 INFO L225 Difference]: With dead ends: 1151 [2020-10-20 01:54:05,988 INFO L226 Difference]: Without dead ends: 770 [2020-10-20 01:54:05,989 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:54:05,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2020-10-20 01:54:06,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 656. [2020-10-20 01:54:06,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2020-10-20 01:54:06,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 874 transitions. [2020-10-20 01:54:06,041 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 874 transitions. Word has length 77 [2020-10-20 01:54:06,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:06,042 INFO L481 AbstractCegarLoop]: Abstraction has 656 states and 874 transitions. [2020-10-20 01:54:06,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:54:06,042 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 874 transitions. [2020-10-20 01:54:06,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-10-20 01:54:06,043 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:06,044 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:54:06,044 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-20 01:54:06,044 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:54:06,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:06,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1638535975, now seen corresponding path program 1 times [2020-10-20 01:54:06,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:06,047 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353720147] [2020-10-20 01:54:06,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:06,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:06,127 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353720147] [2020-10-20 01:54:06,128 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:06,128 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:54:06,128 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466064883] [2020-10-20 01:54:06,130 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:54:06,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:06,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:54:06,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:54:06,131 INFO L87 Difference]: Start difference. First operand 656 states and 874 transitions. Second operand 4 states. [2020-10-20 01:54:06,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:06,332 INFO L93 Difference]: Finished difference Result 1465 states and 1975 transitions. [2020-10-20 01:54:06,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:54:06,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2020-10-20 01:54:06,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:06,338 INFO L225 Difference]: With dead ends: 1465 [2020-10-20 01:54:06,338 INFO L226 Difference]: Without dead ends: 1074 [2020-10-20 01:54:06,339 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:54:06,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2020-10-20 01:54:06,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 875. [2020-10-20 01:54:06,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2020-10-20 01:54:06,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1156 transitions. [2020-10-20 01:54:06,420 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1156 transitions. Word has length 78 [2020-10-20 01:54:06,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:06,421 INFO L481 AbstractCegarLoop]: Abstraction has 875 states and 1156 transitions. [2020-10-20 01:54:06,421 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:54:06,421 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1156 transitions. [2020-10-20 01:54:06,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-10-20 01:54:06,423 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:06,423 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:54:06,423 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-20 01:54:06,424 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:54:06,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:06,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1225314829, now seen corresponding path program 1 times [2020-10-20 01:54:06,424 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:06,425 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971389150] [2020-10-20 01:54:06,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:06,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:06,611 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971389150] [2020-10-20 01:54:06,611 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:06,612 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 01:54:06,612 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277744965] [2020-10-20 01:54:06,612 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 01:54:06,613 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:06,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 01:54:06,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:54:06,614 INFO L87 Difference]: Start difference. First operand 875 states and 1156 transitions. Second operand 6 states. [2020-10-20 01:54:07,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:07,199 INFO L93 Difference]: Finished difference Result 3252 states and 4369 transitions. [2020-10-20 01:54:07,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 01:54:07,200 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2020-10-20 01:54:07,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:07,213 INFO L225 Difference]: With dead ends: 3252 [2020-10-20 01:54:07,213 INFO L226 Difference]: Without dead ends: 2730 [2020-10-20 01:54:07,216 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-10-20 01:54:07,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2730 states. [2020-10-20 01:54:07,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2730 to 1001. [2020-10-20 01:54:07,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states. [2020-10-20 01:54:07,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1303 transitions. [2020-10-20 01:54:07,333 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1303 transitions. Word has length 78 [2020-10-20 01:54:07,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:07,333 INFO L481 AbstractCegarLoop]: Abstraction has 1001 states and 1303 transitions. [2020-10-20 01:54:07,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 01:54:07,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1303 transitions. [2020-10-20 01:54:07,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-10-20 01:54:07,335 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:07,335 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:54:07,335 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-20 01:54:07,335 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:54:07,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:07,335 INFO L82 PathProgramCache]: Analyzing trace with hash -369973759, now seen corresponding path program 1 times [2020-10-20 01:54:07,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:07,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194862319] [2020-10-20 01:54:07,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:07,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 01:54:07,385 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 01:54:07,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 01:54:07,424 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 01:54:07,518 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 01:54:07,520 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-20 01:54:07,520 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-20 01:54:07,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 01:54:07 BoogieIcfgContainer [2020-10-20 01:54:07,709 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 01:54:07,709 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 01:54:07,709 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 01:54:07,710 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 01:54:07,710 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:54:00" (3/4) ... [2020-10-20 01:54:07,712 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-20 01:54:07,871 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 01:54:07,871 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 01:54:07,874 INFO L168 Benchmark]: Toolchain (without parser) took 9666.77 ms. Allocated memory was 35.1 MB in the beginning and 132.1 MB in the end (delta: 97.0 MB). Free memory was 11.5 MB in the beginning and 96.2 MB in the end (delta: -84.7 MB). Peak memory consumption was 91.6 MB. Max. memory is 14.3 GB. [2020-10-20 01:54:07,875 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 33.6 MB. Free memory was 18.6 MB in the beginning and 18.5 MB in the end (delta: 41.5 kB). Peak memory consumption was 41.5 kB. Max. memory is 14.3 GB. [2020-10-20 01:54:07,875 INFO L168 Benchmark]: CACSL2BoogieTranslator took 571.75 ms. Allocated memory was 35.1 MB in the beginning and 43.5 MB in the end (delta: 8.4 MB). Free memory was 10.6 MB in the beginning and 18.0 MB in the end (delta: -7.3 MB). Peak memory consumption was 7.8 MB. Max. memory is 14.3 GB. [2020-10-20 01:54:07,876 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.95 ms. Allocated memory is still 43.5 MB. Free memory was 18.0 MB in the beginning and 24.2 MB in the end (delta: -6.2 MB). Peak memory consumption was 5.5 MB. Max. memory is 14.3 GB. [2020-10-20 01:54:07,876 INFO L168 Benchmark]: Boogie Preprocessor took 62.35 ms. Allocated memory is still 43.5 MB. Free memory was 24.0 MB in the beginning and 20.1 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 14.3 GB. [2020-10-20 01:54:07,876 INFO L168 Benchmark]: RCFGBuilder took 1313.93 ms. Allocated memory was 43.5 MB in the beginning and 53.5 MB in the end (delta: 10.0 MB). Free memory was 20.1 MB in the beginning and 23.0 MB in the end (delta: -2.9 MB). Peak memory consumption was 15.2 MB. Max. memory is 14.3 GB. [2020-10-20 01:54:07,877 INFO L168 Benchmark]: TraceAbstraction took 7447.89 ms. Allocated memory was 53.5 MB in the beginning and 123.7 MB in the end (delta: 70.3 MB). Free memory was 22.6 MB in the beginning and 31.0 MB in the end (delta: -8.4 MB). Peak memory consumption was 61.8 MB. Max. memory is 14.3 GB. [2020-10-20 01:54:07,877 INFO L168 Benchmark]: Witness Printer took 162.33 ms. Allocated memory was 123.7 MB in the beginning and 132.1 MB in the end (delta: 8.4 MB). Free memory was 31.0 MB in the beginning and 96.2 MB in the end (delta: -65.2 MB). Peak memory consumption was 22.5 MB. Max. memory is 14.3 GB. [2020-10-20 01:54:07,880 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.29 ms. Allocated memory is still 33.6 MB. Free memory was 18.6 MB in the beginning and 18.5 MB in the end (delta: 41.5 kB). Peak memory consumption was 41.5 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 571.75 ms. Allocated memory was 35.1 MB in the beginning and 43.5 MB in the end (delta: 8.4 MB). Free memory was 10.6 MB in the beginning and 18.0 MB in the end (delta: -7.3 MB). Peak memory consumption was 7.8 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 96.95 ms. Allocated memory is still 43.5 MB. Free memory was 18.0 MB in the beginning and 24.2 MB in the end (delta: -6.2 MB). Peak memory consumption was 5.5 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 62.35 ms. Allocated memory is still 43.5 MB. Free memory was 24.0 MB in the beginning and 20.1 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 14.3 GB. * RCFGBuilder took 1313.93 ms. Allocated memory was 43.5 MB in the beginning and 53.5 MB in the end (delta: 10.0 MB). Free memory was 20.1 MB in the beginning and 23.0 MB in the end (delta: -2.9 MB). Peak memory consumption was 15.2 MB. Max. memory is 14.3 GB. * TraceAbstraction took 7447.89 ms. Allocated memory was 53.5 MB in the beginning and 123.7 MB in the end (delta: 70.3 MB). Free memory was 22.6 MB in the beginning and 31.0 MB in the end (delta: -8.4 MB). Peak memory consumption was 61.8 MB. Max. memory is 14.3 GB. * Witness Printer took 162.33 ms. Allocated memory was 123.7 MB in the beginning and 132.1 MB in the end (delta: 8.4 MB). Free memory was 31.0 MB in the beginning and 96.2 MB in the end (delta: -65.2 MB). Peak memory consumption was 22.5 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L71] msg_t nomsg = (msg_t )-1; [L72] port_t cs1 ; [L73] int8_t cs1_old ; [L74] int8_t cs1_new ; [L75] port_t cs2 ; [L76] int8_t cs2_old ; [L77] int8_t cs2_new ; [L78] port_t s1s2 ; [L79] int8_t s1s2_old ; [L80] int8_t s1s2_new ; [L81] port_t s1s1 ; [L82] int8_t s1s1_old ; [L83] int8_t s1s1_new ; [L84] port_t s2s1 ; [L85] int8_t s2s1_old ; [L86] int8_t s2s1_new ; [L87] port_t s2s2 ; [L88] int8_t s2s2_old ; [L89] int8_t s2s2_new ; [L90] port_t s1p ; [L91] int8_t s1p_old ; [L92] int8_t s1p_new ; [L93] port_t s2p ; [L94] int8_t s2p_old ; [L95] int8_t s2p_new ; [L98] _Bool side1Failed ; [L99] _Bool side2Failed ; [L100] msg_t side1_written ; [L101] msg_t side2_written ; [L107] static _Bool side1Failed_History_0 ; [L108] static _Bool side1Failed_History_1 ; [L109] static _Bool side1Failed_History_2 ; [L110] static _Bool side2Failed_History_0 ; [L111] static _Bool side2Failed_History_1 ; [L112] static _Bool side2Failed_History_2 ; [L113] static int8_t active_side_History_0 ; [L114] static int8_t active_side_History_1 ; [L115] static int8_t active_side_History_2 ; [L116] static msg_t manual_selection_History_0 ; [L117] static msg_t manual_selection_History_1 ; [L118] static msg_t manual_selection_History_2 ; [L468] void (*nodes[4])(void) = { & Console_task_each_pals_period, & Side1_activestandby_task_each_pals_period, & Side2_activestandby_task_each_pals_period, & Pendulum_prism_task_each_pals_period}; 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] [L590] int c1 ; [L591] int i2 ; [L594] c1 = 0 [L595] side1Failed = __VERIFIER_nondet_bool() [L596] side2Failed = __VERIFIER_nondet_bool() [L597] side1_written = __VERIFIER_nondet_char() [L598] side2_written = __VERIFIER_nondet_char() [L599] side1Failed_History_0 = __VERIFIER_nondet_bool() [L600] side1Failed_History_1 = __VERIFIER_nondet_bool() [L601] side1Failed_History_2 = __VERIFIER_nondet_bool() [L602] side2Failed_History_0 = __VERIFIER_nondet_bool() [L603] side2Failed_History_1 = __VERIFIER_nondet_bool() [L604] side2Failed_History_2 = __VERIFIER_nondet_bool() [L605] active_side_History_0 = __VERIFIER_nondet_char() [L606] active_side_History_1 = __VERIFIER_nondet_char() [L607] active_side_History_2 = __VERIFIER_nondet_char() [L608] manual_selection_History_0 = __VERIFIER_nondet_char() [L609] manual_selection_History_1 = __VERIFIER_nondet_char() [L610] manual_selection_History_2 = __VERIFIER_nondet_char() [L244] 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=54, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=53, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L247] 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=54, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=53, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L250] 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=54, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=53, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L253] 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=54, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=53, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L256] 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=54, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=53, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L259] 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=54, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=53, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L262] 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=54, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=53, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L265] 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=54, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=53, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L268] 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=54, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=53, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L271] 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=54, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=53, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L274] 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=54, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=53, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L277] COND FALSE !((int )manual_selection_History_2 != 0) [L280] return (1); 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=54, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=53, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L611] i2 = init() [L105] COND FALSE !(!cond) 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=54, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=53, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L613] cs1_old = nomsg [L614] cs1_new = nomsg [L615] cs2_old = nomsg [L616] cs2_new = nomsg [L617] s1s2_old = nomsg [L618] s1s2_new = nomsg [L619] s1s1_old = nomsg [L620] s1s1_new = nomsg [L621] s2s1_old = nomsg [L622] s2s1_new = nomsg [L623] s2s2_old = nomsg [L624] s2s2_new = nomsg [L625] s1p_old = nomsg [L626] s1p_new = nomsg [L627] s2p_old = nomsg [L628] s2p_new = nomsg [L629] i2 = 0 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_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=54, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=53, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L630] COND TRUE 1 [L298] msg_t manual_selection ; [L299] char tmp ; [L302] tmp = __VERIFIER_nondet_char() [L303] manual_selection = tmp [L214] manual_selection_History_2 = manual_selection_History_1 [L215] manual_selection_History_1 = manual_selection_History_0 [L216] manual_selection_History_0 = val 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_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=54, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=53, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L305] 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_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=54, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=53, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L305] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L306] 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_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=54, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=53, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L306] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L307] 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_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=54, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=53, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L313] int8_t side1 ; [L314] int8_t side2 ; [L315] msg_t manual_selection ; [L316] int8_t next_state ; [L319] side1 = nomsg [L320] side2 = nomsg [L321] manual_selection = (msg_t )0 [L322] side1Failed = __VERIFIER_nondet_bool() [L124] side1Failed_History_2 = side1Failed_History_1 [L125] side1Failed_History_1 = side1Failed_History_0 [L126] side1Failed_History_0 = val 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=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=53, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L324] COND FALSE !(\read(side1Failed)) [L331] side1 = s1s1_old [L332] s1s1_old = nomsg [L333] side2 = s2s1_old [L334] s2s1_old = nomsg [L335] manual_selection = cs1_old [L336] 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_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=-3, side2Failed=53, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L337] COND TRUE (int )side1 == (int )side2 [L338] 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_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=-3, side2Failed=53, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L361] 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_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=-3, side2Failed=53, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L361] s1s1_new = next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L362] 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_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=-3, side2Failed=53, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L362] s1s2_new = next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L363] 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_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=-3, side2Failed=53, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L363] s1p_new = next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new [L364] 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_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=-3, side2Failed=53, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L370] int8_t side1 ; [L371] int8_t side2 ; [L372] msg_t manual_selection ; [L373] int8_t next_state ; [L376] side1 = nomsg [L377] side2 = nomsg [L378] manual_selection = (msg_t )0 [L379] side2Failed = __VERIFIER_nondet_bool() [L154] side2Failed_History_2 = side2Failed_History_1 [L155] side2Failed_History_1 = side2Failed_History_0 [L156] side2Failed_History_0 = val 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=-3, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L381] COND FALSE !(\read(side2Failed)) [L388] side1 = s1s2_old [L389] s1s2_old = nomsg [L390] side2 = s2s2_old [L391] s2s2_old = nomsg [L392] manual_selection = cs2_old [L393] 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_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=-3, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L394] COND TRUE (int )side1 == (int )side2 [L395] 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_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=-3, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L418] 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_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=-3, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L418] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L419] 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_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=-3, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L419] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L420] 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_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=-3, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L420] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L421] 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_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] [L427] int8_t active_side ; [L428] int8_t tmp ; [L429] int8_t side1 ; [L430] int8_t side2 ; [L195] COND TRUE (int )index == 0 [L196] return (active_side_History_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, 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] [L433] tmp = read_active_side_history((unsigned char)0) [L434] active_side = tmp [L435] side1 = nomsg [L436] side2 = nomsg [L437] side1 = s1p_old [L438] s1p_old = nomsg [L439] side2 = s2p_old [L440] s2p_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_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] [L441] COND FALSE !((int )side1 == 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_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] [L444] COND FALSE !((int )side2 == 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_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 FALSE !((int )side1 == 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, 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] COND TRUE (int )side1 == (int )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_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] COND FALSE !((int )side2 == 0) [L459] active_side = (int8_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_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] [L184] active_side_History_2 = active_side_History_1 [L185] active_side_History_1 = active_side_History_0 [L186] active_side_History_0 = val VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-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] [L636] cs1_old = cs1_new [L637] cs1_new = nomsg [L638] cs2_old = cs2_new [L639] cs2_new = nomsg [L640] s1s2_old = s1s2_new [L641] s1s2_new = nomsg [L642] s1s1_old = s1s1_new [L643] s1s1_new = nomsg [L644] s2s1_old = s2s1_new [L645] s2s1_new = nomsg [L646] s2s2_old = s2s2_new [L647] s2s2_new = nomsg [L648] s1p_old = s1p_new [L649] s1p_new = nomsg [L650] s2p_old = s2p_new [L651] s2p_new = nomsg [L471] int tmp ; [L472] msg_t tmp___0 ; [L473] _Bool tmp___1 ; [L474] _Bool tmp___2 ; [L475] _Bool tmp___3 ; [L476] _Bool tmp___4 ; [L477] int8_t tmp___5 ; [L478] _Bool tmp___6 ; [L479] _Bool tmp___7 ; [L480] _Bool tmp___8 ; [L481] int8_t tmp___9 ; [L482] _Bool tmp___10 ; [L483] _Bool tmp___11 ; [L484] _Bool tmp___12 ; [L485] msg_t tmp___13 ; [L486] _Bool tmp___14 ; [L487] _Bool tmp___15 ; [L488] _Bool tmp___16 ; [L489] _Bool tmp___17 ; [L490] int8_t tmp___18 ; [L491] int8_t tmp___19 ; [L492] 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] [L495] COND TRUE ! side1Failed [L496] 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] [L105] COND FALSE !(!cond) 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] [L225] COND FALSE !((int )index == 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] [L228] COND TRUE (int )index == 1 [L229] return (manual_selection_History_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] [L504] tmp___0 = read_manual_selection_history((unsigned char)1) [L505] COND TRUE ! tmp___0 [L135] COND FALSE !((int )index == 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] [L138] COND TRUE (int )index == 1 [L139] return (side1Failed_History_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] [L506] tmp___1 = read_side1_failed_history((unsigned char)1) [L507] COND TRUE ! tmp___1 [L135] COND TRUE (int )index == 0 [L136] return (side1Failed_History_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] [L508] tmp___2 = read_side1_failed_history((unsigned char)0) [L509] COND TRUE ! tmp___2 [L165] COND FALSE !((int )index == 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] [L168] COND TRUE (int )index == 1 [L169] return (side2Failed_History_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] [L510] tmp___3 = read_side2_failed_history((unsigned char)1) [L511] COND TRUE ! tmp___3 [L165] COND TRUE (int )index == 0 [L166] return (side2Failed_History_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] [L512] tmp___4 = read_side2_failed_history((unsigned char)0) [L513] 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] [L514] 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] [L519] 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] [L524] 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] [L525] COND TRUE ! ((int )side2_written == 0) [L526] return (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] [L652] c1 = check() [L664] COND TRUE ! arg 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] [L3] __assert_fail("0", "pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c", 3, "reach_error") 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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 319 locations, 23 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 7.1s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8909 SDtfs, 10961 SDslu, 12746 SDs, 0 SdLazy, 1174 SolverSat, 134 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1001occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 20 MinimizatonAttempts, 6286 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1318 NumberOfCodeBlocks, 1318 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1219 ConstructedInterpolants, 0 QuantifiedInterpolants, 229069 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 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! Received shutdown request...