./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/transmitter.02.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/transmitter.02.cil.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 2cbfaf31aa56f767af01fea9a12ccb47d60ab19076d72b85e8ca46d6ff778e4c --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 15:42:15,184 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 15:42:15,187 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 15:42:15,241 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 15:42:15,242 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 15:42:15,245 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 15:42:15,247 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 15:42:15,253 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 15:42:15,255 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 15:42:15,259 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 15:42:15,260 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 15:42:15,261 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 15:42:15,262 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 15:42:15,264 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 15:42:15,266 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 15:42:15,271 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 15:42:15,272 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 15:42:15,273 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 15:42:15,275 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 15:42:15,280 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 15:42:15,281 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 15:42:15,282 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 15:42:15,284 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 15:42:15,284 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 15:42:15,290 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 15:42:15,291 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 15:42:15,291 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 15:42:15,293 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 15:42:15,293 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 15:42:15,294 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 15:42:15,294 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 15:42:15,295 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 15:42:15,297 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 15:42:15,298 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 15:42:15,299 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 15:42:15,299 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 15:42:15,300 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 15:42:15,301 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 15:42:15,301 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 15:42:15,301 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 15:42:15,302 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 15:42:15,303 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 15:42:15,336 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 15:42:15,336 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 15:42:15,337 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 15:42:15,337 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 15:42:15,338 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 15:42:15,338 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 15:42:15,339 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 15:42:15,339 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 15:42:15,339 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 15:42:15,339 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 15:42:15,340 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 15:42:15,340 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 15:42:15,340 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 15:42:15,341 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 15:42:15,341 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 15:42:15,341 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 15:42:15,341 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 15:42:15,341 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 15:42:15,341 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 15:42:15,342 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 15:42:15,342 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 15:42:15,342 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 15:42:15,342 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 15:42:15,342 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 15:42:15,343 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 15:42:15,343 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 15:42:15,343 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 15:42:15,344 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 15:42:15,344 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 15:42:15,344 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 15:42:15,345 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 15:42:15,345 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 15:42:15,345 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 15:42:15,345 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 15:42:15,345 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2cbfaf31aa56f767af01fea9a12ccb47d60ab19076d72b85e8ca46d6ff778e4c [2021-12-17 15:42:15,613 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 15:42:15,636 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 15:42:15,638 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 15:42:15,639 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 15:42:15,640 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 15:42:15,641 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.02.cil.c [2021-12-17 15:42:15,698 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba18f1121/553c2c8ffbfe43cfb9c58e373fafb78f/FLAGec63cb081 [2021-12-17 15:42:16,113 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 15:42:16,114 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.02.cil.c [2021-12-17 15:42:16,124 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba18f1121/553c2c8ffbfe43cfb9c58e373fafb78f/FLAGec63cb081 [2021-12-17 15:42:16,510 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba18f1121/553c2c8ffbfe43cfb9c58e373fafb78f [2021-12-17 15:42:16,512 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 15:42:16,514 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 15:42:16,515 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 15:42:16,515 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 15:42:16,521 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 15:42:16,522 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 03:42:16" (1/1) ... [2021-12-17 15:42:16,524 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45cf94c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:42:16, skipping insertion in model container [2021-12-17 15:42:16,524 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 03:42:16" (1/1) ... [2021-12-17 15:42:16,530 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 15:42:16,563 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 15:42:16,704 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.02.cil.c[706,719] [2021-12-17 15:42:16,759 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 15:42:16,767 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 15:42:16,777 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.02.cil.c[706,719] [2021-12-17 15:42:16,797 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 15:42:16,810 INFO L208 MainTranslator]: Completed translation [2021-12-17 15:42:16,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:42:16 WrapperNode [2021-12-17 15:42:16,811 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 15:42:16,812 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 15:42:16,812 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 15:42:16,812 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 15:42:16,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:42:16" (1/1) ... [2021-12-17 15:42:16,826 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:42:16" (1/1) ... [2021-12-17 15:42:16,847 INFO L137 Inliner]: procedures = 32, calls = 36, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 264 [2021-12-17 15:42:16,848 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 15:42:16,849 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 15:42:16,849 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 15:42:16,849 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 15:42:16,858 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:42:16" (1/1) ... [2021-12-17 15:42:16,862 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:42:16" (1/1) ... [2021-12-17 15:42:16,865 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:42:16" (1/1) ... [2021-12-17 15:42:16,874 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:42:16" (1/1) ... [2021-12-17 15:42:16,880 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:42:16" (1/1) ... [2021-12-17 15:42:16,885 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:42:16" (1/1) ... [2021-12-17 15:42:16,887 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:42:16" (1/1) ... [2021-12-17 15:42:16,889 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 15:42:16,890 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 15:42:16,890 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 15:42:16,890 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 15:42:16,891 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:42:16" (1/1) ... [2021-12-17 15:42:16,903 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 15:42:16,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:42:16,926 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-17 15:42:16,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-17 15:42:16,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 15:42:16,963 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2021-12-17 15:42:16,964 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2021-12-17 15:42:16,964 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2021-12-17 15:42:16,964 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2021-12-17 15:42:16,964 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-12-17 15:42:16,964 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-12-17 15:42:16,967 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2021-12-17 15:42:16,968 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2021-12-17 15:42:16,968 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2021-12-17 15:42:16,968 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2021-12-17 15:42:16,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 15:42:16,968 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2021-12-17 15:42:16,968 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2021-12-17 15:42:16,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 15:42:16,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 15:42:17,031 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 15:42:17,033 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 15:42:17,340 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 15:42:17,347 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 15:42:17,348 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-17 15:42:17,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 03:42:17 BoogieIcfgContainer [2021-12-17 15:42:17,350 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 15:42:17,351 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 15:42:17,351 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 15:42:17,361 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 15:42:17,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 03:42:16" (1/3) ... [2021-12-17 15:42:17,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d13e1b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 03:42:17, skipping insertion in model container [2021-12-17 15:42:17,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:42:16" (2/3) ... [2021-12-17 15:42:17,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d13e1b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 03:42:17, skipping insertion in model container [2021-12-17 15:42:17,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 03:42:17" (3/3) ... [2021-12-17 15:42:17,364 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c [2021-12-17 15:42:17,368 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 15:42:17,368 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 15:42:17,414 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 15:42:17,421 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 15:42:17,422 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 15:42:17,458 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 105 states have (on average 1.561904761904762) internal successors, (164), 107 states have internal predecessors, (164), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-17 15:42:17,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-17 15:42:17,465 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:42:17,466 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:42:17,467 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:42:17,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:42:17,480 INFO L85 PathProgramCache]: Analyzing trace with hash 2055872345, now seen corresponding path program 1 times [2021-12-17 15:42:17,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:42:17,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74781552] [2021-12-17 15:42:17,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:42:17,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:42:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:17,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:42:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:17,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:42:17,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:17,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-17 15:42:17,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:17,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-17 15:42:17,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:17,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-17 15:42:17,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:17,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 15:42:17,747 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:42:17,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74781552] [2021-12-17 15:42:17,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74781552] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:42:17,748 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:42:17,749 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 15:42:17,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058240744] [2021-12-17 15:42:17,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:42:17,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 15:42:17,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:42:17,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 15:42:17,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:42:17,782 INFO L87 Difference]: Start difference. First operand has 128 states, 105 states have (on average 1.561904761904762) internal successors, (164), 107 states have internal predecessors, (164), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:42:18,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:42:18,234 INFO L93 Difference]: Finished difference Result 277 states and 425 transitions. [2021-12-17 15:42:18,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 15:42:18,237 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2021-12-17 15:42:18,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:42:18,252 INFO L225 Difference]: With dead ends: 277 [2021-12-17 15:42:18,253 INFO L226 Difference]: Without dead ends: 153 [2021-12-17 15:42:18,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-17 15:42:18,259 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 268 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 15:42:18,260 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [281 Valid, 334 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 15:42:18,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-12-17 15:42:18,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 123. [2021-12-17 15:42:18,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 101 states have (on average 1.4356435643564356) internal successors, (145), 102 states have internal predecessors, (145), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-17 15:42:18,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 175 transitions. [2021-12-17 15:42:18,307 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 175 transitions. Word has length 67 [2021-12-17 15:42:18,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:42:18,308 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 175 transitions. [2021-12-17 15:42:18,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:42:18,309 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 175 transitions. [2021-12-17 15:42:18,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-17 15:42:18,312 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:42:18,312 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:42:18,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 15:42:18,313 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:42:18,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:42:18,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1622143259, now seen corresponding path program 1 times [2021-12-17 15:42:18,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:42:18,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181914175] [2021-12-17 15:42:18,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:42:18,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:42:18,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:18,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:42:18,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:18,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:42:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:18,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-17 15:42:18,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:18,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-17 15:42:18,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:18,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-17 15:42:18,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:18,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 15:42:18,497 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:42:18,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181914175] [2021-12-17 15:42:18,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181914175] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:42:18,498 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:42:18,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 15:42:18,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188845497] [2021-12-17 15:42:18,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:42:18,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 15:42:18,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:42:18,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 15:42:18,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 15:42:18,505 INFO L87 Difference]: Start difference. First operand 123 states and 175 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:42:18,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:42:18,880 INFO L93 Difference]: Finished difference Result 265 states and 386 transitions. [2021-12-17 15:42:18,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 15:42:18,881 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2021-12-17 15:42:18,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:42:18,883 INFO L225 Difference]: With dead ends: 265 [2021-12-17 15:42:18,883 INFO L226 Difference]: Without dead ends: 152 [2021-12-17 15:42:18,884 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-12-17 15:42:18,886 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 258 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 15:42:18,886 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 373 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 15:42:18,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-12-17 15:42:18,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 123. [2021-12-17 15:42:18,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 101 states have (on average 1.4257425742574257) internal successors, (144), 102 states have internal predecessors, (144), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-17 15:42:18,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 174 transitions. [2021-12-17 15:42:18,902 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 174 transitions. Word has length 67 [2021-12-17 15:42:18,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:42:18,903 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 174 transitions. [2021-12-17 15:42:18,903 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:42:18,903 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 174 transitions. [2021-12-17 15:42:18,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-17 15:42:18,905 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:42:18,905 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:42:18,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 15:42:18,905 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:42:18,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:42:18,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1286038627, now seen corresponding path program 1 times [2021-12-17 15:42:18,906 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:42:18,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365476940] [2021-12-17 15:42:18,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:42:18,907 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:42:18,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:18,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:42:18,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:18,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:42:18,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:18,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-17 15:42:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:18,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-17 15:42:18,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:18,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-17 15:42:18,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:19,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 15:42:19,001 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:42:19,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365476940] [2021-12-17 15:42:19,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365476940] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:42:19,001 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:42:19,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 15:42:19,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852997371] [2021-12-17 15:42:19,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:42:19,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 15:42:19,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:42:19,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 15:42:19,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-17 15:42:19,004 INFO L87 Difference]: Start difference. First operand 123 states and 174 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:42:19,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:42:19,348 INFO L93 Difference]: Finished difference Result 269 states and 391 transitions. [2021-12-17 15:42:19,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 15:42:19,349 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2021-12-17 15:42:19,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:42:19,350 INFO L225 Difference]: With dead ends: 269 [2021-12-17 15:42:19,351 INFO L226 Difference]: Without dead ends: 156 [2021-12-17 15:42:19,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-12-17 15:42:19,353 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 313 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 15:42:19,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [322 Valid, 385 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 15:42:19,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-12-17 15:42:19,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 123. [2021-12-17 15:42:19,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 102 states have internal predecessors, (143), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-17 15:42:19,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 173 transitions. [2021-12-17 15:42:19,368 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 173 transitions. Word has length 67 [2021-12-17 15:42:19,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:42:19,368 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 173 transitions. [2021-12-17 15:42:19,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:42:19,369 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 173 transitions. [2021-12-17 15:42:19,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-17 15:42:19,371 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:42:19,371 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:42:19,372 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-17 15:42:19,372 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:42:19,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:42:19,373 INFO L85 PathProgramCache]: Analyzing trace with hash -410019621, now seen corresponding path program 1 times [2021-12-17 15:42:19,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:42:19,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688534132] [2021-12-17 15:42:19,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:42:19,374 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:42:19,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:19,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:42:19,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:19,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:42:19,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:19,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-17 15:42:19,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:19,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-17 15:42:19,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:19,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-17 15:42:19,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:19,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 15:42:19,450 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:42:19,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688534132] [2021-12-17 15:42:19,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688534132] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:42:19,450 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:42:19,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 15:42:19,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899608220] [2021-12-17 15:42:19,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:42:19,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 15:42:19,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:42:19,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 15:42:19,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-17 15:42:19,458 INFO L87 Difference]: Start difference. First operand 123 states and 173 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:42:19,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:42:19,813 INFO L93 Difference]: Finished difference Result 267 states and 385 transitions. [2021-12-17 15:42:19,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 15:42:19,813 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2021-12-17 15:42:19,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:42:19,815 INFO L225 Difference]: With dead ends: 267 [2021-12-17 15:42:19,815 INFO L226 Difference]: Without dead ends: 154 [2021-12-17 15:42:19,816 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-12-17 15:42:19,818 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 266 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 15:42:19,818 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [275 Valid, 444 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 15:42:19,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-12-17 15:42:19,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 123. [2021-12-17 15:42:19,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 101 states have (on average 1.4059405940594059) internal successors, (142), 102 states have internal predecessors, (142), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-17 15:42:19,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 172 transitions. [2021-12-17 15:42:19,832 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 172 transitions. Word has length 67 [2021-12-17 15:42:19,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:42:19,833 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 172 transitions. [2021-12-17 15:42:19,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:42:19,833 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 172 transitions. [2021-12-17 15:42:19,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-17 15:42:19,835 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:42:19,835 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:42:19,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-17 15:42:19,835 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:42:19,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:42:19,836 INFO L85 PathProgramCache]: Analyzing trace with hash 33881053, now seen corresponding path program 1 times [2021-12-17 15:42:19,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:42:19,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830706765] [2021-12-17 15:42:19,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:42:19,837 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:42:19,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:19,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:42:19,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:19,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:42:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:19,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-17 15:42:19,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:19,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-17 15:42:19,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:19,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-17 15:42:19,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:19,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 15:42:19,917 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:42:19,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830706765] [2021-12-17 15:42:19,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830706765] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:42:19,917 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:42:19,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 15:42:19,917 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74501870] [2021-12-17 15:42:19,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:42:19,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 15:42:19,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:42:19,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 15:42:19,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-17 15:42:19,919 INFO L87 Difference]: Start difference. First operand 123 states and 172 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:42:20,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:42:20,221 INFO L93 Difference]: Finished difference Result 265 states and 379 transitions. [2021-12-17 15:42:20,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 15:42:20,221 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2021-12-17 15:42:20,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:42:20,223 INFO L225 Difference]: With dead ends: 265 [2021-12-17 15:42:20,223 INFO L226 Difference]: Without dead ends: 152 [2021-12-17 15:42:20,224 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-12-17 15:42:20,225 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 308 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 15:42:20,225 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [317 Valid, 372 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 15:42:20,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-12-17 15:42:20,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 123. [2021-12-17 15:42:20,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 101 states have (on average 1.396039603960396) internal successors, (141), 102 states have internal predecessors, (141), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-17 15:42:20,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 171 transitions. [2021-12-17 15:42:20,238 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 171 transitions. Word has length 67 [2021-12-17 15:42:20,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:42:20,238 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 171 transitions. [2021-12-17 15:42:20,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:42:20,239 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 171 transitions. [2021-12-17 15:42:20,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-17 15:42:20,240 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:42:20,240 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:42:20,240 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-17 15:42:20,240 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:42:20,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:42:20,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1994705057, now seen corresponding path program 1 times [2021-12-17 15:42:20,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:42:20,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162118742] [2021-12-17 15:42:20,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:42:20,242 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:42:20,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:20,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:42:20,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:20,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:42:20,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:20,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-17 15:42:20,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:20,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-17 15:42:20,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:20,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-17 15:42:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:20,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 15:42:20,307 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:42:20,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162118742] [2021-12-17 15:42:20,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162118742] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:42:20,307 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:42:20,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 15:42:20,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689481010] [2021-12-17 15:42:20,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:42:20,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 15:42:20,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:42:20,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 15:42:20,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 15:42:20,310 INFO L87 Difference]: Start difference. First operand 123 states and 171 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:42:20,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:42:20,839 INFO L93 Difference]: Finished difference Result 397 states and 563 transitions. [2021-12-17 15:42:20,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 15:42:20,840 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2021-12-17 15:42:20,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:42:20,842 INFO L225 Difference]: With dead ends: 397 [2021-12-17 15:42:20,842 INFO L226 Difference]: Without dead ends: 285 [2021-12-17 15:42:20,843 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-12-17 15:42:20,848 INFO L933 BasicCegarLoop]: 319 mSDtfsCounter, 476 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 15:42:20,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [500 Valid, 696 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-17 15:42:20,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2021-12-17 15:42:20,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 225. [2021-12-17 15:42:20,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 186 states have (on average 1.39247311827957) internal successors, (259), 188 states have internal predecessors, (259), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2021-12-17 15:42:20,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 311 transitions. [2021-12-17 15:42:20,879 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 311 transitions. Word has length 67 [2021-12-17 15:42:20,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:42:20,880 INFO L470 AbstractCegarLoop]: Abstraction has 225 states and 311 transitions. [2021-12-17 15:42:20,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:42:20,880 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 311 transitions. [2021-12-17 15:42:20,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-17 15:42:20,882 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:42:20,882 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:42:20,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-17 15:42:20,882 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:42:20,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:42:20,883 INFO L85 PathProgramCache]: Analyzing trace with hash 992257470, now seen corresponding path program 1 times [2021-12-17 15:42:20,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:42:20,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074691628] [2021-12-17 15:42:20,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:42:20,884 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:42:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:20,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:42:20,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:20,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:42:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:20,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-17 15:42:20,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:20,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-17 15:42:20,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:20,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-17 15:42:20,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:20,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 15:42:20,994 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:42:20,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074691628] [2021-12-17 15:42:20,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074691628] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:42:20,994 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:42:20,994 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 15:42:20,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906959820] [2021-12-17 15:42:20,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:42:20,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 15:42:20,996 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:42:20,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 15:42:20,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 15:42:20,997 INFO L87 Difference]: Start difference. First operand 225 states and 311 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:42:21,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:42:21,459 INFO L93 Difference]: Finished difference Result 523 states and 746 transitions. [2021-12-17 15:42:21,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 15:42:21,460 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2021-12-17 15:42:21,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:42:21,464 INFO L225 Difference]: With dead ends: 523 [2021-12-17 15:42:21,464 INFO L226 Difference]: Without dead ends: 309 [2021-12-17 15:42:21,465 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-12-17 15:42:21,469 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 247 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 15:42:21,470 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 651 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 15:42:21,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2021-12-17 15:42:21,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 228. [2021-12-17 15:42:21,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 189 states have (on average 1.380952380952381) internal successors, (261), 191 states have internal predecessors, (261), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2021-12-17 15:42:21,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 313 transitions. [2021-12-17 15:42:21,501 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 313 transitions. Word has length 67 [2021-12-17 15:42:21,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:42:21,501 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 313 transitions. [2021-12-17 15:42:21,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:42:21,502 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 313 transitions. [2021-12-17 15:42:21,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-17 15:42:21,503 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:42:21,504 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:42:21,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-17 15:42:21,504 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:42:21,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:42:21,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1240403964, now seen corresponding path program 1 times [2021-12-17 15:42:21,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:42:21,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001133208] [2021-12-17 15:42:21,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:42:21,506 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:42:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:21,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:42:21,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:21,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:42:21,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:21,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-17 15:42:21,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:21,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-17 15:42:21,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:21,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-17 15:42:21,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:21,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 15:42:21,616 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:42:21,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001133208] [2021-12-17 15:42:21,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001133208] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:42:21,616 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:42:21,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 15:42:21,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966684387] [2021-12-17 15:42:21,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:42:21,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 15:42:21,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:42:21,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 15:42:21,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 15:42:21,619 INFO L87 Difference]: Start difference. First operand 228 states and 313 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:42:22,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:42:22,076 INFO L93 Difference]: Finished difference Result 541 states and 773 transitions. [2021-12-17 15:42:22,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 15:42:22,076 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2021-12-17 15:42:22,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:42:22,078 INFO L225 Difference]: With dead ends: 541 [2021-12-17 15:42:22,078 INFO L226 Difference]: Without dead ends: 324 [2021-12-17 15:42:22,079 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2021-12-17 15:42:22,080 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 247 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 15:42:22,080 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 643 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 15:42:22,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2021-12-17 15:42:22,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 234. [2021-12-17 15:42:22,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 195 states have (on average 1.3692307692307693) internal successors, (267), 197 states have internal predecessors, (267), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2021-12-17 15:42:22,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 319 transitions. [2021-12-17 15:42:22,099 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 319 transitions. Word has length 67 [2021-12-17 15:42:22,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:42:22,104 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 319 transitions. [2021-12-17 15:42:22,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:42:22,105 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 319 transitions. [2021-12-17 15:42:22,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-17 15:42:22,105 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:42:22,106 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:42:22,106 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-17 15:42:22,106 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:42:22,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:42:22,106 INFO L85 PathProgramCache]: Analyzing trace with hash 846037178, now seen corresponding path program 1 times [2021-12-17 15:42:22,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:42:22,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813844705] [2021-12-17 15:42:22,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:42:22,107 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:42:22,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:22,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:42:22,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:22,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:42:22,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:22,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-17 15:42:22,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:22,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-17 15:42:22,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:22,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-17 15:42:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:22,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 15:42:22,217 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:42:22,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813844705] [2021-12-17 15:42:22,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813844705] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:42:22,217 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:42:22,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 15:42:22,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670245909] [2021-12-17 15:42:22,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:42:22,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 15:42:22,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:42:22,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 15:42:22,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-17 15:42:22,223 INFO L87 Difference]: Start difference. First operand 234 states and 319 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:42:23,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:42:23,136 INFO L93 Difference]: Finished difference Result 886 states and 1260 transitions. [2021-12-17 15:42:23,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-17 15:42:23,137 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2021-12-17 15:42:23,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:42:23,150 INFO L225 Difference]: With dead ends: 886 [2021-12-17 15:42:23,150 INFO L226 Difference]: Without dead ends: 663 [2021-12-17 15:42:23,153 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2021-12-17 15:42:23,154 INFO L933 BasicCegarLoop]: 309 mSDtfsCounter, 919 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 945 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-17 15:42:23,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [945 Valid, 793 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-17 15:42:23,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2021-12-17 15:42:23,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 438. [2021-12-17 15:42:23,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 366 states have (on average 1.3688524590163935) internal successors, (501), 369 states have internal predecessors, (501), 47 states have call successors, (47), 24 states have call predecessors, (47), 24 states have return successors, (51), 45 states have call predecessors, (51), 47 states have call successors, (51) [2021-12-17 15:42:23,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 599 transitions. [2021-12-17 15:42:23,198 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 599 transitions. Word has length 67 [2021-12-17 15:42:23,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:42:23,198 INFO L470 AbstractCegarLoop]: Abstraction has 438 states and 599 transitions. [2021-12-17 15:42:23,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:42:23,199 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 599 transitions. [2021-12-17 15:42:23,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-12-17 15:42:23,200 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:42:23,200 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:42:23,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-17 15:42:23,200 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:42:23,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:42:23,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1815470317, now seen corresponding path program 1 times [2021-12-17 15:42:23,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:42:23,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036073380] [2021-12-17 15:42:23,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:42:23,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:42:23,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:23,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:42:23,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:23,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:42:23,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:23,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-17 15:42:23,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:23,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-17 15:42:23,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:23,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-17 15:42:23,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:23,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-17 15:42:23,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:23,303 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-17 15:42:23,303 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:42:23,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036073380] [2021-12-17 15:42:23,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036073380] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:42:23,304 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:42:23,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 15:42:23,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726968463] [2021-12-17 15:42:23,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:42:23,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 15:42:23,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:42:23,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 15:42:23,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 15:42:23,305 INFO L87 Difference]: Start difference. First operand 438 states and 599 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:42:23,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:42:23,740 INFO L93 Difference]: Finished difference Result 990 states and 1411 transitions. [2021-12-17 15:42:23,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 15:42:23,741 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 84 [2021-12-17 15:42:23,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:42:23,744 INFO L225 Difference]: With dead ends: 990 [2021-12-17 15:42:23,744 INFO L226 Difference]: Without dead ends: 563 [2021-12-17 15:42:23,746 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2021-12-17 15:42:23,747 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 163 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 15:42:23,747 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 645 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 15:42:23,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2021-12-17 15:42:23,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 447. [2021-12-17 15:42:23,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 375 states have (on average 1.3573333333333333) internal successors, (509), 378 states have internal predecessors, (509), 47 states have call successors, (47), 24 states have call predecessors, (47), 24 states have return successors, (51), 45 states have call predecessors, (51), 47 states have call successors, (51) [2021-12-17 15:42:23,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 607 transitions. [2021-12-17 15:42:23,791 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 607 transitions. Word has length 84 [2021-12-17 15:42:23,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:42:23,792 INFO L470 AbstractCegarLoop]: Abstraction has 447 states and 607 transitions. [2021-12-17 15:42:23,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:42:23,792 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 607 transitions. [2021-12-17 15:42:23,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-12-17 15:42:23,793 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:42:23,794 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:42:23,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-17 15:42:23,794 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:42:23,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:42:23,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1462381935, now seen corresponding path program 1 times [2021-12-17 15:42:23,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:42:23,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133526134] [2021-12-17 15:42:23,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:42:23,795 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:42:23,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:23,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:42:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:23,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:42:23,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:23,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-17 15:42:23,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:23,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-17 15:42:23,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:23,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-17 15:42:23,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:23,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-17 15:42:23,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:23,864 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-17 15:42:23,865 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:42:23,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133526134] [2021-12-17 15:42:23,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133526134] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:42:23,865 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:42:23,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 15:42:23,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538056733] [2021-12-17 15:42:23,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:42:23,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 15:42:23,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:42:23,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 15:42:23,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-17 15:42:23,867 INFO L87 Difference]: Start difference. First operand 447 states and 607 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:42:24,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:42:24,252 INFO L93 Difference]: Finished difference Result 1127 states and 1518 transitions. [2021-12-17 15:42:24,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 15:42:24,253 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 84 [2021-12-17 15:42:24,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:42:24,257 INFO L225 Difference]: With dead ends: 1127 [2021-12-17 15:42:24,257 INFO L226 Difference]: Without dead ends: 692 [2021-12-17 15:42:24,259 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-12-17 15:42:24,260 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 483 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 15:42:24,260 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [490 Valid, 416 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 15:42:24,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2021-12-17 15:42:24,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 554. [2021-12-17 15:42:24,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 478 states have (on average 1.3179916317991631) internal successors, (630), 480 states have internal predecessors, (630), 47 states have call successors, (47), 28 states have call predecessors, (47), 28 states have return successors, (52), 46 states have call predecessors, (52), 47 states have call successors, (52) [2021-12-17 15:42:24,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 729 transitions. [2021-12-17 15:42:24,323 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 729 transitions. Word has length 84 [2021-12-17 15:42:24,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:42:24,323 INFO L470 AbstractCegarLoop]: Abstraction has 554 states and 729 transitions. [2021-12-17 15:42:24,324 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:42:24,324 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 729 transitions. [2021-12-17 15:42:24,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-12-17 15:42:24,325 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:42:24,325 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:42:24,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-17 15:42:24,325 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:42:24,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:42:24,326 INFO L85 PathProgramCache]: Analyzing trace with hash 564988657, now seen corresponding path program 1 times [2021-12-17 15:42:24,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:42:24,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954296534] [2021-12-17 15:42:24,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:42:24,326 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:42:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:24,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:42:24,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:24,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:42:24,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:24,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-17 15:42:24,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:24,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-17 15:42:24,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:24,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-17 15:42:24,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:24,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-17 15:42:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:24,401 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-17 15:42:24,401 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:42:24,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954296534] [2021-12-17 15:42:24,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954296534] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:42:24,402 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:42:24,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 15:42:24,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501237334] [2021-12-17 15:42:24,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:42:24,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 15:42:24,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:42:24,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 15:42:24,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-17 15:42:24,404 INFO L87 Difference]: Start difference. First operand 554 states and 729 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:42:24,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:42:24,686 INFO L93 Difference]: Finished difference Result 1230 states and 1623 transitions. [2021-12-17 15:42:24,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 15:42:24,686 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 84 [2021-12-17 15:42:24,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:42:24,690 INFO L225 Difference]: With dead ends: 1230 [2021-12-17 15:42:24,691 INFO L226 Difference]: Without dead ends: 688 [2021-12-17 15:42:24,692 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-17 15:42:24,693 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 300 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 15:42:24,693 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [308 Valid, 415 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 15:42:24,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2021-12-17 15:42:24,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 554. [2021-12-17 15:42:24,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 478 states have (on average 1.301255230125523) internal successors, (622), 480 states have internal predecessors, (622), 47 states have call successors, (47), 28 states have call predecessors, (47), 28 states have return successors, (52), 46 states have call predecessors, (52), 47 states have call successors, (52) [2021-12-17 15:42:24,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 721 transitions. [2021-12-17 15:42:24,736 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 721 transitions. Word has length 84 [2021-12-17 15:42:24,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:42:24,736 INFO L470 AbstractCegarLoop]: Abstraction has 554 states and 721 transitions. [2021-12-17 15:42:24,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:42:24,737 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 721 transitions. [2021-12-17 15:42:24,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-12-17 15:42:24,738 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:42:24,738 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:42:24,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-17 15:42:24,738 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:42:24,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:42:24,739 INFO L85 PathProgramCache]: Analyzing trace with hash 813135151, now seen corresponding path program 1 times [2021-12-17 15:42:24,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:42:24,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359443666] [2021-12-17 15:42:24,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:42:24,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:42:24,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:24,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:42:24,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:24,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:42:24,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:24,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-17 15:42:24,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:24,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-17 15:42:24,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:24,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-17 15:42:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:24,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-17 15:42:24,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:24,816 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-17 15:42:24,816 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:42:24,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359443666] [2021-12-17 15:42:24,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359443666] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:42:24,816 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:42:24,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 15:42:24,817 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307380592] [2021-12-17 15:42:24,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:42:24,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 15:42:24,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:42:24,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 15:42:24,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-17 15:42:24,818 INFO L87 Difference]: Start difference. First operand 554 states and 721 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:42:25,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:42:25,125 INFO L93 Difference]: Finished difference Result 1226 states and 1599 transitions. [2021-12-17 15:42:25,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 15:42:25,126 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 84 [2021-12-17 15:42:25,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:42:25,129 INFO L225 Difference]: With dead ends: 1226 [2021-12-17 15:42:25,130 INFO L226 Difference]: Without dead ends: 684 [2021-12-17 15:42:25,132 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-17 15:42:25,132 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 297 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 15:42:25,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [305 Valid, 407 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 15:42:25,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2021-12-17 15:42:25,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 554. [2021-12-17 15:42:25,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 478 states have (on average 1.284518828451883) internal successors, (614), 480 states have internal predecessors, (614), 47 states have call successors, (47), 28 states have call predecessors, (47), 28 states have return successors, (52), 46 states have call predecessors, (52), 47 states have call successors, (52) [2021-12-17 15:42:25,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 713 transitions. [2021-12-17 15:42:25,175 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 713 transitions. Word has length 84 [2021-12-17 15:42:25,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:42:25,176 INFO L470 AbstractCegarLoop]: Abstraction has 554 states and 713 transitions. [2021-12-17 15:42:25,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:42:25,176 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 713 transitions. [2021-12-17 15:42:25,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-12-17 15:42:25,177 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:42:25,177 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:42:25,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-17 15:42:25,178 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:42:25,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:42:25,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1236781873, now seen corresponding path program 1 times [2021-12-17 15:42:25,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:42:25,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881488025] [2021-12-17 15:42:25,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:42:25,179 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:42:25,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:25,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:42:25,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:25,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:42:25,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:25,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-17 15:42:25,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:25,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-17 15:42:25,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:25,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-17 15:42:25,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:25,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-17 15:42:25,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:25,256 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-17 15:42:25,256 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:42:25,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881488025] [2021-12-17 15:42:25,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881488025] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:42:25,257 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:42:25,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 15:42:25,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158398427] [2021-12-17 15:42:25,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:42:25,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 15:42:25,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:42:25,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 15:42:25,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-17 15:42:25,258 INFO L87 Difference]: Start difference. First operand 554 states and 713 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:42:25,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:42:25,656 INFO L93 Difference]: Finished difference Result 1389 states and 1788 transitions. [2021-12-17 15:42:25,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 15:42:25,657 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 84 [2021-12-17 15:42:25,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:42:25,662 INFO L225 Difference]: With dead ends: 1389 [2021-12-17 15:42:25,662 INFO L226 Difference]: Without dead ends: 847 [2021-12-17 15:42:25,664 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-12-17 15:42:25,664 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 358 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 15:42:25,665 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [367 Valid, 421 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 15:42:25,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2021-12-17 15:42:25,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 654. [2021-12-17 15:42:25,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 568 states have (on average 1.2429577464788732) internal successors, (706), 570 states have internal predecessors, (706), 50 states have call successors, (50), 35 states have call predecessors, (50), 35 states have return successors, (62), 49 states have call predecessors, (62), 50 states have call successors, (62) [2021-12-17 15:42:25,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 818 transitions. [2021-12-17 15:42:25,727 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 818 transitions. Word has length 84 [2021-12-17 15:42:25,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:42:25,727 INFO L470 AbstractCegarLoop]: Abstraction has 654 states and 818 transitions. [2021-12-17 15:42:25,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:42:25,728 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 818 transitions. [2021-12-17 15:42:25,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-12-17 15:42:25,729 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:42:25,729 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:42:25,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-17 15:42:25,730 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:42:25,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:42:25,730 INFO L85 PathProgramCache]: Analyzing trace with hash -608585293, now seen corresponding path program 1 times [2021-12-17 15:42:25,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:42:25,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870627300] [2021-12-17 15:42:25,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:42:25,731 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:42:25,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:25,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:42:25,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:25,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:42:25,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:25,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-17 15:42:25,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:25,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-17 15:42:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:25,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-17 15:42:25,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:25,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-17 15:42:25,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:25,796 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-17 15:42:25,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:42:25,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870627300] [2021-12-17 15:42:25,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870627300] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:42:25,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975202410] [2021-12-17 15:42:25,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:42:25,797 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:42:25,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:42:25,799 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:42:25,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-17 15:42:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:25,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 15:42:25,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:42:26,095 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 15:42:26,096 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:42:26,096 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975202410] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:42:26,096 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:42:26,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-12-17 15:42:26,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465529579] [2021-12-17 15:42:26,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:42:26,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 15:42:26,097 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:42:26,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 15:42:26,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-17 15:42:26,097 INFO L87 Difference]: Start difference. First operand 654 states and 818 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-17 15:42:26,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:42:26,193 INFO L93 Difference]: Finished difference Result 1613 states and 2040 transitions. [2021-12-17 15:42:26,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 15:42:26,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 84 [2021-12-17 15:42:26,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:42:26,200 INFO L225 Difference]: With dead ends: 1613 [2021-12-17 15:42:26,200 INFO L226 Difference]: Without dead ends: 1123 [2021-12-17 15:42:26,203 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-17 15:42:26,204 INFO L933 BasicCegarLoop]: 254 mSDtfsCounter, 121 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:42:26,204 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 410 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:42:26,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2021-12-17 15:42:26,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1123. [2021-12-17 15:42:26,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 977 states have (on average 1.2364380757420677) internal successors, (1208), 979 states have internal predecessors, (1208), 84 states have call successors, (84), 61 states have call predecessors, (84), 61 states have return successors, (116), 83 states have call predecessors, (116), 84 states have call successors, (116) [2021-12-17 15:42:26,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1408 transitions. [2021-12-17 15:42:26,305 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1408 transitions. Word has length 84 [2021-12-17 15:42:26,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:42:26,306 INFO L470 AbstractCegarLoop]: Abstraction has 1123 states and 1408 transitions. [2021-12-17 15:42:26,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-17 15:42:26,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1408 transitions. [2021-12-17 15:42:26,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-12-17 15:42:26,308 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:42:26,308 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:42:26,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-17 15:42:26,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-17 15:42:26,524 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:42:26,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:42:26,524 INFO L85 PathProgramCache]: Analyzing trace with hash -55730782, now seen corresponding path program 1 times [2021-12-17 15:42:26,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:42:26,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925643768] [2021-12-17 15:42:26,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:42:26,525 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:42:26,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:26,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:42:26,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:26,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:42:26,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:26,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-17 15:42:26,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:26,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-17 15:42:26,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:26,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-17 15:42:26,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:26,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-17 15:42:26,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:26,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:42:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:26,652 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-17 15:42:26,652 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:42:26,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925643768] [2021-12-17 15:42:26,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925643768] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:42:26,652 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:42:26,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 15:42:26,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096362784] [2021-12-17 15:42:26,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:42:26,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 15:42:26,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:42:26,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 15:42:26,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-17 15:42:26,654 INFO L87 Difference]: Start difference. First operand 1123 states and 1408 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-17 15:42:27,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:42:27,169 INFO L93 Difference]: Finished difference Result 3486 states and 4372 transitions. [2021-12-17 15:42:27,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 15:42:27,170 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 99 [2021-12-17 15:42:27,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:42:27,182 INFO L225 Difference]: With dead ends: 3486 [2021-12-17 15:42:27,182 INFO L226 Difference]: Without dead ends: 2375 [2021-12-17 15:42:27,187 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2021-12-17 15:42:27,188 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 595 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 15:42:27,188 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [603 Valid, 461 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 15:42:27,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2375 states. [2021-12-17 15:42:27,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2375 to 2136. [2021-12-17 15:42:27,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2136 states, 1849 states have (on average 1.2201189832341806) internal successors, (2256), 1870 states have internal predecessors, (2256), 153 states have call successors, (153), 108 states have call predecessors, (153), 133 states have return successors, (265), 159 states have call predecessors, (265), 153 states have call successors, (265) [2021-12-17 15:42:27,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 2136 states and 2674 transitions. [2021-12-17 15:42:27,383 INFO L78 Accepts]: Start accepts. Automaton has 2136 states and 2674 transitions. Word has length 99 [2021-12-17 15:42:27,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:42:27,383 INFO L470 AbstractCegarLoop]: Abstraction has 2136 states and 2674 transitions. [2021-12-17 15:42:27,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-17 15:42:27,384 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 2674 transitions. [2021-12-17 15:42:27,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-12-17 15:42:27,386 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:42:27,386 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:42:27,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-17 15:42:27,386 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:42:27,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:42:27,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1996312796, now seen corresponding path program 1 times [2021-12-17 15:42:27,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:42:27,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777261560] [2021-12-17 15:42:27,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:42:27,387 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:42:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:27,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:42:27,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:27,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:42:27,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:27,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-17 15:42:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:27,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-17 15:42:27,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:27,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-17 15:42:27,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:27,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-17 15:42:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:27,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:42:27,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:27,444 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-17 15:42:27,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:42:27,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777261560] [2021-12-17 15:42:27,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777261560] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:42:27,445 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:42:27,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 15:42:27,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592073902] [2021-12-17 15:42:27,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:42:27,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 15:42:27,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:42:27,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 15:42:27,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:42:27,446 INFO L87 Difference]: Start difference. First operand 2136 states and 2674 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-17 15:42:27,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:42:27,799 INFO L93 Difference]: Finished difference Result 4575 states and 5687 transitions. [2021-12-17 15:42:27,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 15:42:27,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 99 [2021-12-17 15:42:27,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:42:27,813 INFO L225 Difference]: With dead ends: 4575 [2021-12-17 15:42:27,813 INFO L226 Difference]: Without dead ends: 2450 [2021-12-17 15:42:27,819 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-17 15:42:27,819 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 297 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 15:42:27,820 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [318 Valid, 262 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 15:42:27,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2450 states. [2021-12-17 15:42:27,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2450 to 2131. [2021-12-17 15:42:27,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2131 states, 1847 states have (on average 1.2198159177043855) internal successors, (2253), 1867 states have internal predecessors, (2253), 150 states have call successors, (150), 108 states have call predecessors, (150), 133 states have return successors, (261), 156 states have call predecessors, (261), 150 states have call successors, (261) [2021-12-17 15:42:27,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 2131 states and 2664 transitions. [2021-12-17 15:42:27,994 INFO L78 Accepts]: Start accepts. Automaton has 2131 states and 2664 transitions. Word has length 99 [2021-12-17 15:42:27,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:42:27,994 INFO L470 AbstractCegarLoop]: Abstraction has 2131 states and 2664 transitions. [2021-12-17 15:42:27,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-17 15:42:27,995 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 2664 transitions. [2021-12-17 15:42:27,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-17 15:42:27,996 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:42:27,997 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:42:27,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-17 15:42:27,997 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:42:27,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:42:27,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1243137275, now seen corresponding path program 1 times [2021-12-17 15:42:27,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:42:27,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994531060] [2021-12-17 15:42:27,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:42:27,998 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:42:28,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:28,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:42:28,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:28,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:42:28,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:28,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-17 15:42:28,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:28,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-17 15:42:28,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:28,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-17 15:42:28,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:28,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-17 15:42:28,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:28,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:42:28,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:28,069 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-17 15:42:28,069 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:42:28,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994531060] [2021-12-17 15:42:28,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994531060] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:42:28,069 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:42:28,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 15:42:28,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213293275] [2021-12-17 15:42:28,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:42:28,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 15:42:28,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:42:28,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 15:42:28,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:42:28,072 INFO L87 Difference]: Start difference. First operand 2131 states and 2664 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-17 15:42:28,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:42:28,593 INFO L93 Difference]: Finished difference Result 4973 states and 6237 transitions. [2021-12-17 15:42:28,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 15:42:28,595 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 100 [2021-12-17 15:42:28,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:42:28,609 INFO L225 Difference]: With dead ends: 4973 [2021-12-17 15:42:28,609 INFO L226 Difference]: Without dead ends: 3137 [2021-12-17 15:42:28,615 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-17 15:42:28,616 INFO L933 BasicCegarLoop]: 149 mSDtfsCounter, 381 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 15:42:28,616 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [393 Valid, 360 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 15:42:28,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3137 states. [2021-12-17 15:42:28,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3137 to 2700. [2021-12-17 15:42:28,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2700 states, 2341 states have (on average 1.215719777872704) internal successors, (2846), 2363 states have internal predecessors, (2846), 190 states have call successors, (190), 138 states have call predecessors, (190), 168 states have return successors, (324), 199 states have call predecessors, (324), 190 states have call successors, (324) [2021-12-17 15:42:28,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2700 states to 2700 states and 3360 transitions. [2021-12-17 15:42:28,859 INFO L78 Accepts]: Start accepts. Automaton has 2700 states and 3360 transitions. Word has length 100 [2021-12-17 15:42:28,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:42:28,860 INFO L470 AbstractCegarLoop]: Abstraction has 2700 states and 3360 transitions. [2021-12-17 15:42:28,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-17 15:42:28,860 INFO L276 IsEmpty]: Start isEmpty. Operand 2700 states and 3360 transitions. [2021-12-17 15:42:28,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-12-17 15:42:28,864 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:42:28,864 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:42:28,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-17 15:42:28,864 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:42:28,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:42:28,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1869458483, now seen corresponding path program 1 times [2021-12-17 15:42:28,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:42:28,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058858703] [2021-12-17 15:42:28,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:42:28,865 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:42:28,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:28,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:42:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:28,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:42:28,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:28,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-17 15:42:28,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:28,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-17 15:42:28,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:28,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-17 15:42:28,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:28,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-12-17 15:42:28,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:28,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-17 15:42:28,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:28,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:42:28,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:28,956 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-17 15:42:28,956 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:42:28,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058858703] [2021-12-17 15:42:28,956 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058858703] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:42:28,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590373813] [2021-12-17 15:42:28,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:42:28,957 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:42:28,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:42:28,960 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:42:28,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-17 15:42:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:29,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 15:42:29,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:42:29,244 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-17 15:42:29,244 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:42:29,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590373813] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:42:29,245 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:42:29,245 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2021-12-17 15:42:29,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357074193] [2021-12-17 15:42:29,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:42:29,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 15:42:29,246 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:42:29,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 15:42:29,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-17 15:42:29,247 INFO L87 Difference]: Start difference. First operand 2700 states and 3360 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-17 15:42:29,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:42:29,498 INFO L93 Difference]: Finished difference Result 6076 states and 7553 transitions. [2021-12-17 15:42:29,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 15:42:29,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 117 [2021-12-17 15:42:29,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:42:29,514 INFO L225 Difference]: With dead ends: 6076 [2021-12-17 15:42:29,515 INFO L226 Difference]: Without dead ends: 3387 [2021-12-17 15:42:29,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-17 15:42:29,524 INFO L933 BasicCegarLoop]: 202 mSDtfsCounter, 71 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:42:29,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 341 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:42:29,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3387 states. [2021-12-17 15:42:29,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3387 to 3369. [2021-12-17 15:42:29,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3369 states, 2914 states have (on average 1.2055593685655457) internal successors, (3513), 2936 states have internal predecessors, (3513), 246 states have call successors, (246), 178 states have call predecessors, (246), 208 states have return successors, (386), 255 states have call predecessors, (386), 246 states have call successors, (386) [2021-12-17 15:42:29,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3369 states to 3369 states and 4145 transitions. [2021-12-17 15:42:29,796 INFO L78 Accepts]: Start accepts. Automaton has 3369 states and 4145 transitions. Word has length 117 [2021-12-17 15:42:29,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:42:29,797 INFO L470 AbstractCegarLoop]: Abstraction has 3369 states and 4145 transitions. [2021-12-17 15:42:29,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-17 15:42:29,797 INFO L276 IsEmpty]: Start isEmpty. Operand 3369 states and 4145 transitions. [2021-12-17 15:42:29,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-12-17 15:42:29,801 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:42:29,801 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:42:29,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-17 15:42:30,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:42:30,016 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:42:30,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:42:30,016 INFO L85 PathProgramCache]: Analyzing trace with hash -36607372, now seen corresponding path program 1 times [2021-12-17 15:42:30,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:42:30,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819654738] [2021-12-17 15:42:30,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:42:30,016 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:42:30,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:30,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:42:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:30,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:42:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:30,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-17 15:42:30,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:30,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-17 15:42:30,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:30,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-17 15:42:30,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:30,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 15:42:30,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:30,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-17 15:42:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:30,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:42:30,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:30,092 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-17 15:42:30,092 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:42:30,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819654738] [2021-12-17 15:42:30,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819654738] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:42:30,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477705916] [2021-12-17 15:42:30,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:42:30,094 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:42:30,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:42:30,095 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:42:30,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-17 15:42:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:30,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 15:42:30,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:42:30,375 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 15:42:30,375 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:42:30,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477705916] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:42:30,376 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:42:30,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-12-17 15:42:30,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585429530] [2021-12-17 15:42:30,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:42:30,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 15:42:30,377 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:42:30,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 15:42:30,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-17 15:42:30,378 INFO L87 Difference]: Start difference. First operand 3369 states and 4145 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-17 15:42:30,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:42:30,611 INFO L93 Difference]: Finished difference Result 6104 states and 7524 transitions. [2021-12-17 15:42:30,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 15:42:30,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 121 [2021-12-17 15:42:30,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:42:30,626 INFO L225 Difference]: With dead ends: 6104 [2021-12-17 15:42:30,627 INFO L226 Difference]: Without dead ends: 3416 [2021-12-17 15:42:30,635 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-17 15:42:30,636 INFO L933 BasicCegarLoop]: 246 mSDtfsCounter, 112 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:42:30,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 401 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:42:30,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3416 states. [2021-12-17 15:42:30,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3416 to 3369. [2021-12-17 15:42:30,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3369 states, 2914 states have (on average 1.199382292381606) internal successors, (3495), 2936 states have internal predecessors, (3495), 246 states have call successors, (246), 178 states have call predecessors, (246), 208 states have return successors, (345), 255 states have call predecessors, (345), 246 states have call successors, (345) [2021-12-17 15:42:30,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3369 states to 3369 states and 4086 transitions. [2021-12-17 15:42:30,934 INFO L78 Accepts]: Start accepts. Automaton has 3369 states and 4086 transitions. Word has length 121 [2021-12-17 15:42:30,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:42:30,935 INFO L470 AbstractCegarLoop]: Abstraction has 3369 states and 4086 transitions. [2021-12-17 15:42:30,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-17 15:42:30,935 INFO L276 IsEmpty]: Start isEmpty. Operand 3369 states and 4086 transitions. [2021-12-17 15:42:30,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-12-17 15:42:30,941 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:42:30,941 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:42:30,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-17 15:42:31,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:42:31,158 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:42:31,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:42:31,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1792814822, now seen corresponding path program 1 times [2021-12-17 15:42:31,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:42:31,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773331595] [2021-12-17 15:42:31,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:42:31,159 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:42:31,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:31,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:42:31,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:31,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:42:31,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:31,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-17 15:42:31,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:31,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-17 15:42:31,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:31,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-17 15:42:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:31,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 15:42:31,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:31,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-17 15:42:31,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:31,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:42:31,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:31,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-17 15:42:31,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:31,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:42:31,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:31,251 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 5 proven. 39 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-17 15:42:31,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:42:31,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773331595] [2021-12-17 15:42:31,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773331595] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:42:31,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887792223] [2021-12-17 15:42:31,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:42:31,251 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:42:31,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:42:31,253 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:42:31,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-17 15:42:31,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:31,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 15:42:31,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:42:31,584 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-17 15:42:31,584 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:42:31,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887792223] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:42:31,585 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:42:31,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2021-12-17 15:42:31,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671636995] [2021-12-17 15:42:31,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:42:31,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 15:42:31,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:42:31,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 15:42:31,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-17 15:42:31,588 INFO L87 Difference]: Start difference. First operand 3369 states and 4086 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-17 15:42:32,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:42:32,015 INFO L93 Difference]: Finished difference Result 9860 states and 12095 transitions. [2021-12-17 15:42:32,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 15:42:32,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 153 [2021-12-17 15:42:32,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:42:32,048 INFO L225 Difference]: With dead ends: 9860 [2021-12-17 15:42:32,048 INFO L226 Difference]: Without dead ends: 6503 [2021-12-17 15:42:32,061 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 172 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-17 15:42:32,062 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 137 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:42:32,063 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 346 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:42:32,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6503 states. [2021-12-17 15:42:32,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6503 to 6492. [2021-12-17 15:42:32,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6492 states, 5638 states have (on average 1.1906704505143668) internal successors, (6713), 5674 states have internal predecessors, (6713), 459 states have call successors, (459), 340 states have call predecessors, (459), 394 states have return successors, (722), 479 states have call predecessors, (722), 459 states have call successors, (722) [2021-12-17 15:42:32,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6492 states to 6492 states and 7894 transitions. [2021-12-17 15:42:32,578 INFO L78 Accepts]: Start accepts. Automaton has 6492 states and 7894 transitions. Word has length 153 [2021-12-17 15:42:32,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:42:32,579 INFO L470 AbstractCegarLoop]: Abstraction has 6492 states and 7894 transitions. [2021-12-17 15:42:32,579 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-17 15:42:32,580 INFO L276 IsEmpty]: Start isEmpty. Operand 6492 states and 7894 transitions. [2021-12-17 15:42:32,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-12-17 15:42:32,589 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:42:32,589 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:42:32,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-17 15:42:32,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:42:32,808 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:42:32,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:42:32,809 INFO L85 PathProgramCache]: Analyzing trace with hash -970215938, now seen corresponding path program 1 times [2021-12-17 15:42:32,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:42:32,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946378714] [2021-12-17 15:42:32,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:42:32,809 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:42:32,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:32,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:42:32,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:32,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:42:32,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:32,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-17 15:42:32,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:32,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-17 15:42:32,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:32,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-17 15:42:32,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:32,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-17 15:42:32,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:32,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-17 15:42:32,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:32,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:42:32,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:32,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-17 15:42:32,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:32,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:42:32,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:32,941 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2021-12-17 15:42:32,941 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:42:32,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946378714] [2021-12-17 15:42:32,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946378714] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:42:32,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416002410] [2021-12-17 15:42:32,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:42:32,942 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:42:32,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:42:32,944 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:42:32,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-17 15:42:33,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:33,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 15:42:33,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:42:33,263 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-17 15:42:33,263 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:42:33,264 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416002410] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:42:33,264 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:42:33,264 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2021-12-17 15:42:33,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906105273] [2021-12-17 15:42:33,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:42:33,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 15:42:33,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:42:33,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 15:42:33,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 15:42:33,266 INFO L87 Difference]: Start difference. First operand 6492 states and 7894 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-17 15:42:33,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:42:33,712 INFO L93 Difference]: Finished difference Result 10644 states and 13205 transitions. [2021-12-17 15:42:33,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 15:42:33,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 154 [2021-12-17 15:42:33,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:42:33,751 INFO L225 Difference]: With dead ends: 10644 [2021-12-17 15:42:33,751 INFO L226 Difference]: Without dead ends: 6468 [2021-12-17 15:42:33,767 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 15:42:33,768 INFO L933 BasicCegarLoop]: 289 mSDtfsCounter, 111 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:42:33,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 438 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:42:33,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6468 states. [2021-12-17 15:42:34,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6468 to 6446. [2021-12-17 15:42:34,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6446 states, 5592 states have (on average 1.1686337625178826) internal successors, (6535), 5628 states have internal predecessors, (6535), 459 states have call successors, (459), 340 states have call predecessors, (459), 394 states have return successors, (722), 479 states have call predecessors, (722), 459 states have call successors, (722) [2021-12-17 15:42:34,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6446 states to 6446 states and 7716 transitions. [2021-12-17 15:42:34,292 INFO L78 Accepts]: Start accepts. Automaton has 6446 states and 7716 transitions. Word has length 154 [2021-12-17 15:42:34,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:42:34,292 INFO L470 AbstractCegarLoop]: Abstraction has 6446 states and 7716 transitions. [2021-12-17 15:42:34,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-17 15:42:34,293 INFO L276 IsEmpty]: Start isEmpty. Operand 6446 states and 7716 transitions. [2021-12-17 15:42:34,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-12-17 15:42:34,302 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:42:34,302 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:42:34,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-17 15:42:34,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-12-17 15:42:34,516 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:42:34,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:42:34,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1358937995, now seen corresponding path program 1 times [2021-12-17 15:42:34,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:42:34,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573366656] [2021-12-17 15:42:34,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:42:34,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:42:34,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:34,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:42:34,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:34,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:42:34,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:34,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-17 15:42:34,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:34,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-17 15:42:34,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:34,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-17 15:42:34,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:34,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-17 15:42:34,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:34,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-17 15:42:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:34,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:42:34,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:34,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-17 15:42:34,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:34,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:42:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:34,618 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-12-17 15:42:34,618 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:42:34,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573366656] [2021-12-17 15:42:34,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573366656] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:42:34,619 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:42:34,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 15:42:34,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976553313] [2021-12-17 15:42:34,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:42:34,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 15:42:34,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:42:34,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 15:42:34,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 15:42:34,621 INFO L87 Difference]: Start difference. First operand 6446 states and 7716 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-17 15:42:35,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:42:35,262 INFO L93 Difference]: Finished difference Result 9228 states and 11064 transitions. [2021-12-17 15:42:35,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 15:42:35,263 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 155 [2021-12-17 15:42:35,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:42:35,277 INFO L225 Difference]: With dead ends: 9228 [2021-12-17 15:42:35,278 INFO L226 Difference]: Without dead ends: 4925 [2021-12-17 15:42:35,289 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-12-17 15:42:35,290 INFO L933 BasicCegarLoop]: 239 mSDtfsCounter, 509 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 15:42:35,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [544 Valid, 578 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 15:42:35,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4925 states. [2021-12-17 15:42:35,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4925 to 4454. [2021-12-17 15:42:35,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4454 states, 3883 states have (on average 1.161473087818697) internal successors, (4510), 3905 states have internal predecessors, (4510), 303 states have call successors, (303), 224 states have call predecessors, (303), 267 states have return successors, (448), 326 states have call predecessors, (448), 303 states have call successors, (448) [2021-12-17 15:42:35,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 5261 transitions. [2021-12-17 15:42:35,591 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 5261 transitions. Word has length 155 [2021-12-17 15:42:35,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:42:35,592 INFO L470 AbstractCegarLoop]: Abstraction has 4454 states and 5261 transitions. [2021-12-17 15:42:35,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-17 15:42:35,592 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 5261 transitions. [2021-12-17 15:42:35,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-12-17 15:42:35,599 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:42:35,599 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:42:35,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-17 15:42:35,600 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:42:35,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:42:35,600 INFO L85 PathProgramCache]: Analyzing trace with hash 217702764, now seen corresponding path program 1 times [2021-12-17 15:42:35,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:42:35,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956422876] [2021-12-17 15:42:35,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:42:35,601 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:42:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:35,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:42:35,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:35,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:42:35,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:35,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-17 15:42:35,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:35,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-17 15:42:35,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:35,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-17 15:42:35,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:35,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-17 15:42:35,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:35,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-17 15:42:35,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:35,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:42:35,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:35,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-17 15:42:35,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:35,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:42:35,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:35,679 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 37 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-17 15:42:35,679 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:42:35,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956422876] [2021-12-17 15:42:35,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956422876] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:42:35,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921279261] [2021-12-17 15:42:35,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:42:35,680 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:42:35,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:42:35,684 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:42:35,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-17 15:42:35,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:35,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 15:42:35,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:42:36,033 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-17 15:42:36,033 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:42:36,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921279261] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:42:36,034 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:42:36,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2021-12-17 15:42:36,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396735654] [2021-12-17 15:42:36,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:42:36,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 15:42:36,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:42:36,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 15:42:36,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 15:42:36,036 INFO L87 Difference]: Start difference. First operand 4454 states and 5261 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-17 15:42:36,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:42:36,315 INFO L93 Difference]: Finished difference Result 8019 states and 9613 transitions. [2021-12-17 15:42:36,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 15:42:36,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 156 [2021-12-17 15:42:36,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:42:36,331 INFO L225 Difference]: With dead ends: 8019 [2021-12-17 15:42:36,331 INFO L226 Difference]: Without dead ends: 4470 [2021-12-17 15:42:36,342 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 15:42:36,343 INFO L933 BasicCegarLoop]: 243 mSDtfsCounter, 82 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:42:36,344 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 378 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:42:36,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4470 states. [2021-12-17 15:42:36,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4470 to 4454. [2021-12-17 15:42:36,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4454 states, 3883 states have (on average 1.1382951326294102) internal successors, (4420), 3905 states have internal predecessors, (4420), 303 states have call successors, (303), 224 states have call predecessors, (303), 267 states have return successors, (448), 326 states have call predecessors, (448), 303 states have call successors, (448) [2021-12-17 15:42:36,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 5171 transitions. [2021-12-17 15:42:36,684 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 5171 transitions. Word has length 156 [2021-12-17 15:42:36,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:42:36,684 INFO L470 AbstractCegarLoop]: Abstraction has 4454 states and 5171 transitions. [2021-12-17 15:42:36,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-17 15:42:36,685 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 5171 transitions. [2021-12-17 15:42:36,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-12-17 15:42:36,694 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:42:36,695 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:42:36,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-17 15:42:36,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:42:36,908 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:42:36,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:42:36,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1852604969, now seen corresponding path program 2 times [2021-12-17 15:42:36,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:42:36,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503182312] [2021-12-17 15:42:36,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:42:36,909 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:42:36,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:36,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:42:36,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:36,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 15:42:36,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:36,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-17 15:42:36,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:36,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-17 15:42:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:36,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-17 15:42:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:36,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-17 15:42:36,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:36,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-17 15:42:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:36,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:42:36,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:36,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-17 15:42:36,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:36,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:42:36,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:42:36,984 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-12-17 15:42:36,984 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:42:36,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503182312] [2021-12-17 15:42:36,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503182312] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:42:36,984 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:42:36,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 15:42:36,985 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437896299] [2021-12-17 15:42:36,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:42:36,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 15:42:36,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:42:36,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 15:42:36,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 15:42:36,987 INFO L87 Difference]: Start difference. First operand 4454 states and 5171 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 4 states have internal predecessors, (106), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-17 15:42:37,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:42:37,419 INFO L93 Difference]: Finished difference Result 7209 states and 8473 transitions. [2021-12-17 15:42:37,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 15:42:37,420 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 4 states have internal predecessors, (106), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 156 [2021-12-17 15:42:37,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:42:37,426 INFO L225 Difference]: With dead ends: 7209 [2021-12-17 15:42:37,426 INFO L226 Difference]: Without dead ends: 1669 [2021-12-17 15:42:37,436 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-12-17 15:42:37,436 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 348 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 15:42:37,437 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [361 Valid, 331 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 15:42:37,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2021-12-17 15:42:37,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1669. [2021-12-17 15:42:37,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1669 states, 1446 states have (on average 1.0802213001383125) internal successors, (1562), 1445 states have internal predecessors, (1562), 127 states have call successors, (127), 92 states have call predecessors, (127), 95 states have return successors, (160), 133 states have call predecessors, (160), 127 states have call successors, (160) [2021-12-17 15:42:37,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 1849 transitions. [2021-12-17 15:42:37,536 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 1849 transitions. Word has length 156 [2021-12-17 15:42:37,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:42:37,537 INFO L470 AbstractCegarLoop]: Abstraction has 1669 states and 1849 transitions. [2021-12-17 15:42:37,537 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 4 states have internal predecessors, (106), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-17 15:42:37,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 1849 transitions. [2021-12-17 15:42:37,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-12-17 15:42:37,540 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:42:37,540 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:42:37,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-17 15:42:37,540 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:42:37,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:42:37,541 INFO L85 PathProgramCache]: Analyzing trace with hash -217774742, now seen corresponding path program 1 times [2021-12-17 15:42:37,541 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:42:37,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985513698] [2021-12-17 15:42:37,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:42:37,542 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:42:37,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 15:42:37,554 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-17 15:42:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 15:42:37,613 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-17 15:42:37,614 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-17 15:42:37,615 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 15:42:37,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-17 15:42:37,624 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:42:37,627 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 15:42:37,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 03:42:37 BoogieIcfgContainer [2021-12-17 15:42:37,750 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 15:42:37,751 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 15:42:37,751 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 15:42:37,751 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 15:42:37,752 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 03:42:17" (3/4) ... [2021-12-17 15:42:37,753 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-17 15:42:37,858 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-17 15:42:37,858 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 15:42:37,859 INFO L158 Benchmark]: Toolchain (without parser) took 21345.02ms. Allocated memory was 94.4MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 58.6MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2021-12-17 15:42:37,859 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 94.4MB. Free memory was 74.7MB in the beginning and 74.7MB in the end (delta: 42.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 15:42:37,859 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.55ms. Allocated memory is still 94.4MB. Free memory was 58.4MB in the beginning and 68.1MB in the end (delta: -9.7MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. [2021-12-17 15:42:37,859 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.77ms. Allocated memory is still 94.4MB. Free memory was 68.0MB in the beginning and 65.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 15:42:37,860 INFO L158 Benchmark]: Boogie Preprocessor took 40.84ms. Allocated memory is still 94.4MB. Free memory was 65.9MB in the beginning and 64.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 15:42:37,860 INFO L158 Benchmark]: RCFGBuilder took 459.51ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 64.2MB in the beginning and 87.5MB in the end (delta: -23.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2021-12-17 15:42:37,862 INFO L158 Benchmark]: TraceAbstraction took 20398.86ms. Allocated memory was 113.2MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 87.1MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 479.2MB. Max. memory is 16.1GB. [2021-12-17 15:42:37,863 INFO L158 Benchmark]: Witness Printer took 107.54ms. Allocated memory is still 1.2GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-17 15:42:37,869 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.23ms. Allocated memory is still 94.4MB. Free memory was 74.7MB in the beginning and 74.7MB in the end (delta: 42.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 296.55ms. Allocated memory is still 94.4MB. Free memory was 58.4MB in the beginning and 68.1MB in the end (delta: -9.7MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.77ms. Allocated memory is still 94.4MB. Free memory was 68.0MB in the beginning and 65.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.84ms. Allocated memory is still 94.4MB. Free memory was 65.9MB in the beginning and 64.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 459.51ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 64.2MB in the beginning and 87.5MB in the end (delta: -23.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 20398.86ms. Allocated memory was 113.2MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 87.1MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 479.2MB. Max. memory is 16.1GB. * Witness Printer took 107.54ms. Allocated memory is still 1.2GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int m_pc = 0; [L26] int t1_pc = 0; [L27] int t2_pc = 0; [L28] int m_st ; [L29] int t1_st ; [L30] int t2_st ; [L31] int m_i ; [L32] int t1_i ; [L33] int t2_i ; [L34] int M_E = 2; [L35] int T1_E = 2; [L36] int T2_E = 2; [L37] int E_1 = 2; [L38] int E_2 = 2; VAL [E_1=2, E_2=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0] [L573] int __retres1 ; [L577] CALL init_model() [L487] m_i = 1 [L488] t1_i = 1 [L489] t2_i = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L577] RET init_model() [L578] CALL start_simulation() [L514] int kernel_st ; [L515] int tmp ; [L516] int tmp___0 ; [L520] kernel_st = 0 VAL [E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L521] FCALL update_channels() VAL [E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L522] CALL init_threads() [L221] COND TRUE m_i == 1 [L222] m_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L226] COND TRUE t1_i == 1 [L227] t1_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L231] COND TRUE t2_i == 1 [L232] t2_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L522] RET init_threads() [L523] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L334] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L339] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L344] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L349] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L354] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L523] RET fire_delta_events() VAL [E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L524] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; [L403] CALL, EXPR is_master_triggered() [L153] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L156] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L166] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L168] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L403] RET, EXPR is_master_triggered() [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0] [L411] CALL, EXPR is_transmit1_triggered() [L172] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L175] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L185] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L187] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L411] RET, EXPR is_transmit1_triggered() [L411] tmp___0 = is_transmit1_triggered() [L413] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0] [L419] CALL, EXPR is_transmit2_triggered() [L191] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L194] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L204] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L206] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L419] RET, EXPR is_transmit2_triggered() [L419] tmp___1 = is_transmit2_triggered() [L421] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0] [L524] RET activate_threads() VAL [E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L525] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L367] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L372] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L377] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L382] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L387] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L525] RET reset_delta_events() VAL [E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L528] COND TRUE 1 VAL [E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L531] kernel_st = 1 [L532] CALL eval() [L267] int tmp ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L271] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L274] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L241] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L244] COND TRUE m_st == 0 [L245] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L262] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L274] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L274] tmp = exists_runnable_thread() [L276] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1] [L281] COND TRUE m_st == 0 [L282] int tmp_ndt_1; [L283] tmp_ndt_1 = __VERIFIER_nondet_int() [L284] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0] [L295] COND TRUE t1_st == 0 [L296] int tmp_ndt_2; [L297] tmp_ndt_2 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_2) [L300] t1_st = 1 [L301] CALL transmit1() [L88] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L99] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L101] t1_pc = 1 [L102] t1_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L301] RET transmit1() [L309] COND TRUE t2_st == 0 [L310] int tmp_ndt_3; [L311] tmp_ndt_3 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_3) [L314] t2_st = 1 [L315] CALL transmit2() [L123] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L134] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L136] t2_pc = 1 [L137] t2_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L315] RET transmit2() [L271] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L274] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L241] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L244] COND TRUE m_st == 0 [L245] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L262] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L274] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L274] tmp = exists_runnable_thread() [L276] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L281] COND TRUE m_st == 0 [L282] int tmp_ndt_1; [L283] tmp_ndt_1 = __VERIFIER_nondet_int() [L284] COND TRUE \read(tmp_ndt_1) [L286] m_st = 1 [L287] CALL master() [L47] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L58] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L61] E_1 = 1 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L62] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L435] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; [L403] CALL, EXPR is_master_triggered() [L153] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L156] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L166] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L168] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=0, __retres1=0, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L403] RET, EXPR is_master_triggered() [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0] [L411] CALL, EXPR is_transmit1_triggered() [L172] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L175] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L176] COND TRUE E_1 == 1 [L177] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=1, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L187] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=1, __retres1=1, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L411] RET, EXPR is_transmit1_triggered() [L411] tmp___0 = is_transmit1_triggered() [L413] COND TRUE \read(tmp___0) [L414] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1] [L419] CALL, EXPR is_transmit2_triggered() [L191] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L194] COND TRUE t2_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L195] COND FALSE !(E_2 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L204] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L206] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=0, __retres1=0, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L419] RET, EXPR is_transmit2_triggered() [L419] tmp___1 = is_transmit2_triggered() [L421] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, tmp___1=0] [L435] RET activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L62] RET immediate_notify() VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L63] E_1 = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L66] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L68] m_pc = 1 [L69] m_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L287] RET master() [L295] COND TRUE t1_st == 0 [L296] int tmp_ndt_2; [L297] tmp_ndt_2 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_2) [L300] t1_st = 1 [L301] CALL transmit1() [L88] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L91] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L107] E_2 = 1 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L108] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L435] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; [L403] CALL, EXPR is_master_triggered() [L153] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L156] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L157] COND FALSE !(M_E == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L166] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L168] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=0, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L403] RET, EXPR is_master_triggered() [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0] [L411] CALL, EXPR is_transmit1_triggered() [L172] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L175] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L176] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L185] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L187] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=0, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L411] RET, EXPR is_transmit1_triggered() [L411] tmp___0 = is_transmit1_triggered() [L413] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0] [L419] CALL, EXPR is_transmit2_triggered() [L191] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L194] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L195] COND TRUE E_2 == 1 [L196] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=1, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L206] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=1, __retres1=1, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L419] RET, EXPR is_transmit2_triggered() [L419] tmp___1 = is_transmit2_triggered() [L421] COND TRUE \read(tmp___1) [L422] t2_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=0, tmp___0=0, tmp___1=1] [L435] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L108] RET immediate_notify() VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L109] E_2 = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L99] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L101] t1_pc = 1 [L102] t1_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L301] RET transmit1() [L309] COND TRUE t2_st == 0 [L310] int tmp_ndt_3; [L311] tmp_ndt_3 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_3) [L314] t2_st = 1 [L315] CALL transmit2() [L123] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L126] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L142] CALL error() [L21] reach_error() VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 128 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.2s, OverallIterations: 26, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 10.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7887 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7667 mSDsluCounter, 11301 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6505 mSDsCounter, 1238 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6466 IncrementalHoareTripleChecker+Invalid, 7704 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1238 mSolverCounterUnsat, 4796 mSDtfsCounter, 6466 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1381 GetRequests, 1167 SyntacticMatches, 1 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6492occurred in iteration=21, InterpolantAutomatonStates: 190, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.5s AutomataMinimizationTime, 25 MinimizatonAttempts, 2899 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 3359 NumberOfCodeBlocks, 3359 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 3171 ConstructedInterpolants, 0 QuantifiedInterpolants, 6354 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2395 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 31 InterpolantComputations, 25 PerfectInterpolantSequences, 832/936 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-17 15:42:37,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE