./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/kundu1.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/kundu1.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 c114a15ea6b1c9b012290758a6a9559b9c02a944706c9768958a3bd9c86822a7 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 15:31:01,805 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 15:31:01,807 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 15:31:01,849 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 15:31:01,850 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 15:31:01,851 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 15:31:01,852 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 15:31:01,853 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 15:31:01,854 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 15:31:01,855 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 15:31:01,855 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 15:31:01,856 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 15:31:01,856 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 15:31:01,857 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 15:31:01,858 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 15:31:01,859 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 15:31:01,859 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 15:31:01,860 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 15:31:01,861 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 15:31:01,862 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 15:31:01,863 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 15:31:01,864 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 15:31:01,865 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 15:31:01,866 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 15:31:01,867 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 15:31:01,868 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 15:31:01,868 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 15:31:01,868 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 15:31:01,869 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 15:31:01,869 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 15:31:01,870 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 15:31:01,870 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 15:31:01,871 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 15:31:01,871 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 15:31:01,872 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 15:31:01,872 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 15:31:01,873 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 15:31:01,873 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 15:31:01,873 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 15:31:01,874 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 15:31:01,874 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 15:31:01,875 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:31:01,904 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 15:31:01,906 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 15:31:01,907 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 15:31:01,907 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 15:31:01,908 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 15:31:01,908 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 15:31:01,908 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 15:31:01,909 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 15:31:01,909 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 15:31:01,909 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 15:31:01,910 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 15:31:01,910 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 15:31:01,910 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 15:31:01,910 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 15:31:01,910 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 15:31:01,910 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 15:31:01,911 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 15:31:01,911 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 15:31:01,911 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 15:31:01,911 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 15:31:01,911 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 15:31:01,911 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 15:31:01,912 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 15:31:01,912 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 15:31:01,912 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 15:31:01,912 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 15:31:01,912 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 15:31:01,913 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 15:31:01,914 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 15:31:01,914 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 15:31:01,914 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 15:31:01,914 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 15:31:01,914 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 15:31:01,914 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 15:31:01,915 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 -> c114a15ea6b1c9b012290758a6a9559b9c02a944706c9768958a3bd9c86822a7 [2021-12-17 15:31:02,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 15:31:02,125 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 15:31:02,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 15:31:02,128 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 15:31:02,135 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 15:31:02,136 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/kundu1.cil.c [2021-12-17 15:31:02,197 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a5873217/f5f800f8853042d89417d32a72cce0a2/FLAGe0e5b02f4 [2021-12-17 15:31:02,489 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 15:31:02,490 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/kundu1.cil.c [2021-12-17 15:31:02,500 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a5873217/f5f800f8853042d89417d32a72cce0a2/FLAGe0e5b02f4 [2021-12-17 15:31:02,932 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a5873217/f5f800f8853042d89417d32a72cce0a2 [2021-12-17 15:31:02,935 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 15:31:02,937 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 15:31:02,939 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 15:31:02,939 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 15:31:02,942 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 15:31:02,943 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 03:31:02" (1/1) ... [2021-12-17 15:31:02,944 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@148cf2a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:31:02, skipping insertion in model container [2021-12-17 15:31:02,944 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 03:31:02" (1/1) ... [2021-12-17 15:31:02,948 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 15:31:02,985 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 15:31:03,089 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/kundu1.cil.c[636,649] [2021-12-17 15:31:03,127 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 15:31:03,133 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 15:31:03,140 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/kundu1.cil.c[636,649] [2021-12-17 15:31:03,166 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 15:31:03,182 INFO L208 MainTranslator]: Completed translation [2021-12-17 15:31:03,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:31:03 WrapperNode [2021-12-17 15:31:03,189 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 15:31:03,190 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 15:31:03,190 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 15:31:03,190 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 15:31:03,195 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:31:03" (1/1) ... [2021-12-17 15:31:03,200 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:31:03" (1/1) ... [2021-12-17 15:31:03,218 INFO L137 Inliner]: procedures = 32, calls = 36, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 257 [2021-12-17 15:31:03,218 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 15:31:03,219 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 15:31:03,219 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 15:31:03,219 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 15:31:03,224 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:31:03" (1/1) ... [2021-12-17 15:31:03,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:31:03" (1/1) ... [2021-12-17 15:31:03,227 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:31:03" (1/1) ... [2021-12-17 15:31:03,227 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:31:03" (1/1) ... [2021-12-17 15:31:03,230 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:31:03" (1/1) ... [2021-12-17 15:31:03,234 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:31:03" (1/1) ... [2021-12-17 15:31:03,235 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:31:03" (1/1) ... [2021-12-17 15:31:03,237 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 15:31:03,237 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 15:31:03,237 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 15:31:03,238 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 15:31:03,238 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:31:03" (1/1) ... [2021-12-17 15:31:03,243 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 15:31:03,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:31:03,261 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:31:03,270 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:31:03,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 15:31:03,293 INFO L130 BoogieDeclarations]: Found specification of procedure error [2021-12-17 15:31:03,294 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2021-12-17 15:31:03,294 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2021-12-17 15:31:03,294 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2021-12-17 15:31:03,294 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2021-12-17 15:31:03,294 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2021-12-17 15:31:03,294 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2021-12-17 15:31:03,295 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2021-12-17 15:31:03,295 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2021-12-17 15:31:03,295 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2021-12-17 15:31:03,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 15:31:03,295 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2021-12-17 15:31:03,295 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2021-12-17 15:31:03,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 15:31:03,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 15:31:03,344 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 15:31:03,356 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 15:31:03,577 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 15:31:03,586 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 15:31:03,587 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-17 15:31:03,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 03:31:03 BoogieIcfgContainer [2021-12-17 15:31:03,589 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 15:31:03,591 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 15:31:03,591 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 15:31:03,594 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 15:31:03,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 03:31:02" (1/3) ... [2021-12-17 15:31:03,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a66bdea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 03:31:03, skipping insertion in model container [2021-12-17 15:31:03,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:31:03" (2/3) ... [2021-12-17 15:31:03,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a66bdea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 03:31:03, skipping insertion in model container [2021-12-17 15:31:03,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 03:31:03" (3/3) ... [2021-12-17 15:31:03,596 INFO L111 eAbstractionObserver]: Analyzing ICFG kundu1.cil.c [2021-12-17 15:31:03,599 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 15:31:03,600 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 15:31:03,635 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 15:31:03,641 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:31:03,642 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 15:31:03,674 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 85 states have (on average 1.4941176470588236) internal successors, (127), 89 states have internal predecessors, (127), 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:31:03,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-17 15:31:03,684 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:31:03,684 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] [2021-12-17 15:31:03,685 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:31:03,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:31:03,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1847694624, now seen corresponding path program 1 times [2021-12-17 15:31:03,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:31:03,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120099488] [2021-12-17 15:31:03,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:31:03,711 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:31:03,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:03,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:31:03,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:03,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:31:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:03,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 15:31:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:03,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-17 15:31:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:03,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-17 15:31:03,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:03,909 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:31:03,910 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:31:03,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120099488] [2021-12-17 15:31:03,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120099488] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:31:03,910 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:31:03,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 15:31:03,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359126404] [2021-12-17 15:31:03,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:31:03,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 15:31:03,916 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:31:03,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 15:31:03,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:31:03,941 INFO L87 Difference]: Start difference. First operand has 108 states, 85 states have (on average 1.4941176470588236) internal successors, (127), 89 states have internal predecessors, (127), 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 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:31:04,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:31:04,214 INFO L93 Difference]: Finished difference Result 317 states and 469 transitions. [2021-12-17 15:31:04,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 15:31:04,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2021-12-17 15:31:04,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:31:04,223 INFO L225 Difference]: With dead ends: 317 [2021-12-17 15:31:04,223 INFO L226 Difference]: Without dead ends: 211 [2021-12-17 15:31:04,226 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-17 15:31:04,228 INFO L933 BasicCegarLoop]: 286 mSDtfsCounter, 295 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 15:31:04,229 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [308 Valid, 656 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 15:31:04,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-12-17 15:31:04,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 180. [2021-12-17 15:31:04,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 146 states have (on average 1.404109589041096) internal successors, (205), 149 states have internal predecessors, (205), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2021-12-17 15:31:04,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 248 transitions. [2021-12-17 15:31:04,287 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 248 transitions. Word has length 51 [2021-12-17 15:31:04,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:31:04,287 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 248 transitions. [2021-12-17 15:31:04,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:31:04,288 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 248 transitions. [2021-12-17 15:31:04,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-17 15:31:04,289 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:31:04,289 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] [2021-12-17 15:31:04,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 15:31:04,290 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:31:04,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:31:04,290 INFO L85 PathProgramCache]: Analyzing trace with hash 682456063, now seen corresponding path program 1 times [2021-12-17 15:31:04,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:31:04,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872745890] [2021-12-17 15:31:04,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:31:04,291 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:31:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:04,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:31:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:04,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:31:04,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:04,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 15:31:04,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:04,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-17 15:31:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:04,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-17 15:31:04,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:04,378 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:31:04,378 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:31:04,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872745890] [2021-12-17 15:31:04,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872745890] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:31:04,379 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:31:04,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 15:31:04,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237177288] [2021-12-17 15:31:04,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:31:04,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 15:31:04,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:31:04,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 15:31:04,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 15:31:04,381 INFO L87 Difference]: Start difference. First operand 180 states and 248 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:31:04,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:31:04,523 INFO L93 Difference]: Finished difference Result 381 states and 534 transitions. [2021-12-17 15:31:04,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 15:31:04,524 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2021-12-17 15:31:04,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:31:04,526 INFO L225 Difference]: With dead ends: 381 [2021-12-17 15:31:04,526 INFO L226 Difference]: Without dead ends: 211 [2021-12-17 15:31:04,527 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-12-17 15:31:04,528 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 117 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 15:31:04,528 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 664 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 15:31:04,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-12-17 15:31:04,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 183. [2021-12-17 15:31:04,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 149 states have (on average 1.389261744966443) internal successors, (207), 152 states have internal predecessors, (207), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2021-12-17 15:31:04,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 250 transitions. [2021-12-17 15:31:04,542 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 250 transitions. Word has length 51 [2021-12-17 15:31:04,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:31:04,543 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 250 transitions. [2021-12-17 15:31:04,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:31:04,543 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 250 transitions. [2021-12-17 15:31:04,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-17 15:31:04,544 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:31:04,544 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] [2021-12-17 15:31:04,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 15:31:04,545 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:31:04,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:31:04,545 INFO L85 PathProgramCache]: Analyzing trace with hash 957215677, now seen corresponding path program 1 times [2021-12-17 15:31:04,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:31:04,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106535930] [2021-12-17 15:31:04,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:31:04,546 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:31:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:04,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:31:04,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:04,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:31:04,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:04,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 15:31:04,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:04,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-17 15:31:04,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:04,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-17 15:31:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:04,646 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:31:04,647 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:31:04,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106535930] [2021-12-17 15:31:04,647 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106535930] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:31:04,647 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:31:04,648 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 15:31:04,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828029304] [2021-12-17 15:31:04,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:31:04,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 15:31:04,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:31:04,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 15:31:04,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-17 15:31:04,651 INFO L87 Difference]: Start difference. First operand 183 states and 250 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:31:04,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:31:04,940 INFO L93 Difference]: Finished difference Result 719 states and 999 transitions. [2021-12-17 15:31:04,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 15:31:04,940 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2021-12-17 15:31:04,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:31:04,943 INFO L225 Difference]: With dead ends: 719 [2021-12-17 15:31:04,944 INFO L226 Difference]: Without dead ends: 546 [2021-12-17 15:31:04,945 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-12-17 15:31:04,946 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 566 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 15:31:04,946 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [579 Valid, 714 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 15:31:04,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2021-12-17 15:31:04,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 333. [2021-12-17 15:31:04,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 273 states have (on average 1.36996336996337) internal successors, (374), 276 states have internal predecessors, (374), 39 states have call successors, (39), 21 states have call predecessors, (39), 20 states have return successors, (38), 36 states have call predecessors, (38), 36 states have call successors, (38) [2021-12-17 15:31:04,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 451 transitions. [2021-12-17 15:31:04,976 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 451 transitions. Word has length 51 [2021-12-17 15:31:04,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:31:04,977 INFO L470 AbstractCegarLoop]: Abstraction has 333 states and 451 transitions. [2021-12-17 15:31:04,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:31:04,977 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 451 transitions. [2021-12-17 15:31:04,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-17 15:31:04,978 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:31:04,978 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] [2021-12-17 15:31:04,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-17 15:31:04,979 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:31:04,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:31:04,979 INFO L85 PathProgramCache]: Analyzing trace with hash 758872208, now seen corresponding path program 1 times [2021-12-17 15:31:04,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:31:04,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142807095] [2021-12-17 15:31:04,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:31:04,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:31:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:04,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:31:05,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:05,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:31:05,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:05,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 15:31:05,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:05,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-17 15:31:05,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:05,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:31:05,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:05,025 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:31:05,026 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:31:05,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142807095] [2021-12-17 15:31:05,026 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142807095] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:31:05,026 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:31:05,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 15:31:05,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56016868] [2021-12-17 15:31:05,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:31:05,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 15:31:05,027 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:31:05,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 15:31:05,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:31:05,028 INFO L87 Difference]: Start difference. First operand 333 states and 451 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:31:05,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:31:05,218 INFO L93 Difference]: Finished difference Result 1182 states and 1638 transitions. [2021-12-17 15:31:05,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 15:31:05,219 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2021-12-17 15:31:05,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:31:05,223 INFO L225 Difference]: With dead ends: 1182 [2021-12-17 15:31:05,223 INFO L226 Difference]: Without dead ends: 859 [2021-12-17 15:31:05,224 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-17 15:31:05,225 INFO L933 BasicCegarLoop]: 285 mSDtfsCounter, 294 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 15:31:05,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [307 Valid, 744 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 15:31:05,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2021-12-17 15:31:05,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 758. [2021-12-17 15:31:05,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 620 states have (on average 1.320967741935484) internal successors, (819), 623 states have internal predecessors, (819), 87 states have call successors, (87), 51 states have call predecessors, (87), 50 states have return successors, (98), 84 states have call predecessors, (98), 84 states have call successors, (98) [2021-12-17 15:31:05,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1004 transitions. [2021-12-17 15:31:05,266 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1004 transitions. Word has length 52 [2021-12-17 15:31:05,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:31:05,267 INFO L470 AbstractCegarLoop]: Abstraction has 758 states and 1004 transitions. [2021-12-17 15:31:05,267 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:31:05,267 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1004 transitions. [2021-12-17 15:31:05,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-17 15:31:05,268 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:31:05,268 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] [2021-12-17 15:31:05,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-17 15:31:05,269 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:31:05,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:31:05,269 INFO L85 PathProgramCache]: Analyzing trace with hash 701727983, now seen corresponding path program 1 times [2021-12-17 15:31:05,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:31:05,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425312691] [2021-12-17 15:31:05,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:31:05,270 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:31:05,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:05,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:31:05,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:05,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:31:05,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:05,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 15:31:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:05,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-17 15:31:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:05,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:31:05,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:05,329 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:31:05,329 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:31:05,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425312691] [2021-12-17 15:31:05,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425312691] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:31:05,329 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:31:05,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 15:31:05,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433975386] [2021-12-17 15:31:05,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:31:05,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 15:31:05,330 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:31:05,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 15:31:05,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 15:31:05,331 INFO L87 Difference]: Start difference. First operand 758 states and 1004 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:31:05,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:31:05,478 INFO L93 Difference]: Finished difference Result 1587 states and 2170 transitions. [2021-12-17 15:31:05,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 15:31:05,479 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2021-12-17 15:31:05,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:31:05,482 INFO L225 Difference]: With dead ends: 1587 [2021-12-17 15:31:05,483 INFO L226 Difference]: Without dead ends: 839 [2021-12-17 15:31:05,484 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-12-17 15:31:05,485 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 58 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 15:31:05,486 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 605 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 15:31:05,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2021-12-17 15:31:05,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 776. [2021-12-17 15:31:05,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 638 states have (on average 1.3056426332288402) internal successors, (833), 641 states have internal predecessors, (833), 87 states have call successors, (87), 51 states have call predecessors, (87), 50 states have return successors, (98), 84 states have call predecessors, (98), 84 states have call successors, (98) [2021-12-17 15:31:05,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1018 transitions. [2021-12-17 15:31:05,521 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1018 transitions. Word has length 52 [2021-12-17 15:31:05,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:31:05,521 INFO L470 AbstractCegarLoop]: Abstraction has 776 states and 1018 transitions. [2021-12-17 15:31:05,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:31:05,522 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1018 transitions. [2021-12-17 15:31:05,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-17 15:31:05,524 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:31:05,524 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] [2021-12-17 15:31:05,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-17 15:31:05,524 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:31:05,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:31:05,525 INFO L85 PathProgramCache]: Analyzing trace with hash 763767597, now seen corresponding path program 1 times [2021-12-17 15:31:05,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:31:05,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156506498] [2021-12-17 15:31:05,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:31:05,525 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:31:05,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:05,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:31:05,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:05,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:31:05,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:05,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 15:31:05,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:05,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-17 15:31:05,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:05,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:31:05,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:05,597 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:31:05,597 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:31:05,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156506498] [2021-12-17 15:31:05,597 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156506498] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:31:05,597 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:31:05,597 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 15:31:05,598 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113192871] [2021-12-17 15:31:05,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:31:05,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 15:31:05,598 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:31:05,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 15:31:05,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:31:05,599 INFO L87 Difference]: Start difference. First operand 776 states and 1018 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-12-17 15:31:05,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:31:05,794 INFO L93 Difference]: Finished difference Result 2629 states and 3632 transitions. [2021-12-17 15:31:05,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 15:31:05,795 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 52 [2021-12-17 15:31:05,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:31:05,803 INFO L225 Difference]: With dead ends: 2629 [2021-12-17 15:31:05,803 INFO L226 Difference]: Without dead ends: 1931 [2021-12-17 15:31:05,806 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-17 15:31:05,807 INFO L933 BasicCegarLoop]: 244 mSDtfsCounter, 272 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 15:31:05,807 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [285 Valid, 673 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 15:31:05,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2021-12-17 15:31:05,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1302. [2021-12-17 15:31:05,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1302 states, 1073 states have (on average 1.3019571295433365) internal successors, (1397), 1076 states have internal predecessors, (1397), 143 states have call successors, (143), 86 states have call predecessors, (143), 85 states have return successors, (166), 140 states have call predecessors, (166), 140 states have call successors, (166) [2021-12-17 15:31:05,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 1706 transitions. [2021-12-17 15:31:05,880 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 1706 transitions. Word has length 52 [2021-12-17 15:31:05,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:31:05,880 INFO L470 AbstractCegarLoop]: Abstraction has 1302 states and 1706 transitions. [2021-12-17 15:31:05,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-12-17 15:31:05,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1706 transitions. [2021-12-17 15:31:05,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-17 15:31:05,882 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:31:05,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] [2021-12-17 15:31:05,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-17 15:31:05,882 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:31:05,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:31:05,883 INFO L85 PathProgramCache]: Analyzing trace with hash -938478105, now seen corresponding path program 1 times [2021-12-17 15:31:05,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:31:05,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653877681] [2021-12-17 15:31:05,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:31:05,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:31:05,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:05,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:31:05,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:05,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:31:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:05,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 15:31:05,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:05,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-17 15:31:05,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:05,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:31:05,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:05,945 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:31:05,945 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:31:05,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653877681] [2021-12-17 15:31:05,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653877681] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:31:05,946 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:31:05,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 15:31:05,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671414770] [2021-12-17 15:31:05,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:31:05,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 15:31:05,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:31:05,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 15:31:05,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-17 15:31:05,949 INFO L87 Difference]: Start difference. First operand 1302 states and 1706 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-12-17 15:31:06,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:31:06,179 INFO L93 Difference]: Finished difference Result 2502 states and 3310 transitions. [2021-12-17 15:31:06,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 15:31:06,179 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2021-12-17 15:31:06,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:31:06,185 INFO L225 Difference]: With dead ends: 2502 [2021-12-17 15:31:06,185 INFO L226 Difference]: Without dead ends: 1573 [2021-12-17 15:31:06,188 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-17 15:31:06,188 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 505 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 15:31:06,189 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [522 Valid, 606 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 15:31:06,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2021-12-17 15:31:06,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1462. [2021-12-17 15:31:06,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1462 states, 1207 states have (on average 1.2999171499585749) internal successors, (1569), 1210 states have internal predecessors, (1569), 159 states have call successors, (159), 96 states have call predecessors, (159), 95 states have return successors, (184), 156 states have call predecessors, (184), 156 states have call successors, (184) [2021-12-17 15:31:06,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 1912 transitions. [2021-12-17 15:31:06,240 INFO L78 Accepts]: Start accepts. Automaton has 1462 states and 1912 transitions. Word has length 60 [2021-12-17 15:31:06,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:31:06,241 INFO L470 AbstractCegarLoop]: Abstraction has 1462 states and 1912 transitions. [2021-12-17 15:31:06,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-12-17 15:31:06,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 1912 transitions. [2021-12-17 15:31:06,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-12-17 15:31:06,242 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:31:06,242 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] [2021-12-17 15:31:06,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-17 15:31:06,242 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:31:06,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:31:06,243 INFO L85 PathProgramCache]: Analyzing trace with hash 2020590272, now seen corresponding path program 1 times [2021-12-17 15:31:06,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:31:06,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994375331] [2021-12-17 15:31:06,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:31:06,243 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:31:06,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:06,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:31:06,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:06,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:31:06,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:06,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 15:31:06,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:06,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-17 15:31:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:06,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:31:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:06,297 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:31:06,297 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:31:06,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994375331] [2021-12-17 15:31:06,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994375331] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:31:06,297 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:31:06,297 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 15:31:06,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956318120] [2021-12-17 15:31:06,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:31:06,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 15:31:06,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:31:06,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 15:31:06,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 15:31:06,299 INFO L87 Difference]: Start difference. First operand 1462 states and 1912 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-12-17 15:31:06,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:31:06,672 INFO L93 Difference]: Finished difference Result 4425 states and 6130 transitions. [2021-12-17 15:31:06,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 15:31:06,673 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 63 [2021-12-17 15:31:06,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:31:06,685 INFO L225 Difference]: With dead ends: 4425 [2021-12-17 15:31:06,685 INFO L226 Difference]: Without dead ends: 3338 [2021-12-17 15:31:06,688 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-17 15:31:06,689 INFO L933 BasicCegarLoop]: 404 mSDtfsCounter, 453 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 1300 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 15:31:06,689 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [472 Valid, 1300 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 15:31:06,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2021-12-17 15:31:06,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 2078. [2021-12-17 15:31:06,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2078 states, 1719 states have (on average 1.2990110529377545) internal successors, (2233), 1722 states have internal predecessors, (2233), 223 states have call successors, (223), 136 states have call predecessors, (223), 135 states have return successors, (262), 220 states have call predecessors, (262), 220 states have call successors, (262) [2021-12-17 15:31:06,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2078 states to 2078 states and 2718 transitions. [2021-12-17 15:31:06,772 INFO L78 Accepts]: Start accepts. Automaton has 2078 states and 2718 transitions. Word has length 63 [2021-12-17 15:31:06,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:31:06,772 INFO L470 AbstractCegarLoop]: Abstraction has 2078 states and 2718 transitions. [2021-12-17 15:31:06,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-12-17 15:31:06,772 INFO L276 IsEmpty]: Start isEmpty. Operand 2078 states and 2718 transitions. [2021-12-17 15:31:06,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-17 15:31:06,773 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:31:06,773 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-17 15:31:06,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-17 15:31:06,776 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:31:06,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:31:06,776 INFO L85 PathProgramCache]: Analyzing trace with hash -285621863, now seen corresponding path program 1 times [2021-12-17 15:31:06,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:31:06,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60613045] [2021-12-17 15:31:06,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:31:06,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:31:06,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:06,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:31:06,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:06,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:31:06,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:06,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 15:31:06,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:06,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-17 15:31:06,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:06,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:31:06,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:06,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-17 15:31:06,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:06,853 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 15:31:06,853 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:31:06,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60613045] [2021-12-17 15:31:06,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60613045] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:31:06,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111514172] [2021-12-17 15:31:06,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:31:06,854 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:31:06,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:31:06,856 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:31:06,923 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:31:06,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:06,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 15:31:06,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:31:07,038 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 15:31:07,039 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:31:07,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111514172] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:31:07,039 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:31:07,039 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-12-17 15:31:07,039 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538206838] [2021-12-17 15:31:07,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:31:07,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 15:31:07,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:31:07,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 15:31:07,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-17 15:31:07,041 INFO L87 Difference]: Start difference. First operand 2078 states and 2718 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-17 15:31:07,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:31:07,197 INFO L93 Difference]: Finished difference Result 5794 states and 7710 transitions. [2021-12-17 15:31:07,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 15:31:07,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 68 [2021-12-17 15:31:07,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:31:07,211 INFO L225 Difference]: With dead ends: 5794 [2021-12-17 15:31:07,211 INFO L226 Difference]: Without dead ends: 3727 [2021-12-17 15:31:07,217 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-17 15:31:07,218 INFO L933 BasicCegarLoop]: 234 mSDtfsCounter, 92 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:31:07,218 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 364 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:31:07,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3727 states. [2021-12-17 15:31:07,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3727 to 3589. [2021-12-17 15:31:07,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3589 states, 2941 states have (on average 1.2757565453927235) internal successors, (3752), 2945 states have internal predecessors, (3752), 402 states have call successors, (402), 246 states have call predecessors, (402), 245 states have return successors, (553), 399 states have call predecessors, (553), 399 states have call successors, (553) [2021-12-17 15:31:07,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3589 states to 3589 states and 4707 transitions. [2021-12-17 15:31:07,364 INFO L78 Accepts]: Start accepts. Automaton has 3589 states and 4707 transitions. Word has length 68 [2021-12-17 15:31:07,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:31:07,365 INFO L470 AbstractCegarLoop]: Abstraction has 3589 states and 4707 transitions. [2021-12-17 15:31:07,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-17 15:31:07,365 INFO L276 IsEmpty]: Start isEmpty. Operand 3589 states and 4707 transitions. [2021-12-17 15:31:07,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-17 15:31:07,366 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:31:07,366 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] [2021-12-17 15:31:07,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-17 15:31:07,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:31:07,583 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:31:07,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:31:07,584 INFO L85 PathProgramCache]: Analyzing trace with hash -914471196, now seen corresponding path program 1 times [2021-12-17 15:31:07,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:31:07,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268397284] [2021-12-17 15:31:07,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:31:07,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:31:07,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:07,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:31:07,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:07,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:31:07,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:07,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 15:31:07,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:07,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-17 15:31:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:07,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:31:07,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:07,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-17 15:31:07,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:07,620 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 15:31:07,621 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:31:07,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268397284] [2021-12-17 15:31:07,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268397284] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:31:07,621 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:31:07,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 15:31:07,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610186002] [2021-12-17 15:31:07,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:31:07,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 15:31:07,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:31:07,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 15:31:07,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:31:07,623 INFO L87 Difference]: Start difference. First operand 3589 states and 4707 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-17 15:31:07,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:31:07,853 INFO L93 Difference]: Finished difference Result 7448 states and 9813 transitions. [2021-12-17 15:31:07,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 15:31:07,853 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 71 [2021-12-17 15:31:07,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:31:07,867 INFO L225 Difference]: With dead ends: 7448 [2021-12-17 15:31:07,867 INFO L226 Difference]: Without dead ends: 3874 [2021-12-17 15:31:07,875 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-12-17 15:31:07,876 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 163 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 15:31:07,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 435 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 15:31:07,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3874 states. [2021-12-17 15:31:07,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3874 to 3627. [2021-12-17 15:31:08,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3627 states, 2960 states have (on average 1.2577702702702702) internal successors, (3723), 2983 states have internal predecessors, (3723), 402 states have call successors, (402), 246 states have call predecessors, (402), 264 states have return successors, (553), 399 states have call predecessors, (553), 399 states have call successors, (553) [2021-12-17 15:31:08,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3627 states to 3627 states and 4678 transitions. [2021-12-17 15:31:08,009 INFO L78 Accepts]: Start accepts. Automaton has 3627 states and 4678 transitions. Word has length 71 [2021-12-17 15:31:08,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:31:08,009 INFO L470 AbstractCegarLoop]: Abstraction has 3627 states and 4678 transitions. [2021-12-17 15:31:08,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-17 15:31:08,010 INFO L276 IsEmpty]: Start isEmpty. Operand 3627 states and 4678 transitions. [2021-12-17 15:31:08,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-17 15:31:08,010 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:31:08,011 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] [2021-12-17 15:31:08,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-17 15:31:08,011 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:31:08,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:31:08,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1331867802, now seen corresponding path program 1 times [2021-12-17 15:31:08,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:31:08,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385905707] [2021-12-17 15:31:08,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:31:08,012 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:31:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:08,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:31:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:08,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:31:08,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:08,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 15:31:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:08,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-17 15:31:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:08,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:31:08,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:08,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-17 15:31:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:08,037 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-17 15:31:08,037 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:31:08,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385905707] [2021-12-17 15:31:08,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385905707] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:31:08,037 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:31:08,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 15:31:08,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401272501] [2021-12-17 15:31:08,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:31:08,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 15:31:08,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:31:08,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 15:31:08,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 15:31:08,039 INFO L87 Difference]: Start difference. First operand 3627 states and 4678 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:31:08,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:31:08,206 INFO L93 Difference]: Finished difference Result 4094 states and 5315 transitions. [2021-12-17 15:31:08,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 15:31:08,207 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2021-12-17 15:31:08,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:31:08,220 INFO L225 Difference]: With dead ends: 4094 [2021-12-17 15:31:08,220 INFO L226 Difference]: Without dead ends: 3889 [2021-12-17 15:31:08,223 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:31:08,223 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 174 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:31:08,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 215 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:31:08,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3889 states. [2021-12-17 15:31:08,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3889 to 3558. [2021-12-17 15:31:08,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3558 states, 2907 states have (on average 1.258685930512556) internal successors, (3659), 2929 states have internal predecessors, (3659), 391 states have call successors, (391), 241 states have call predecessors, (391), 259 states have return successors, (542), 388 states have call predecessors, (542), 388 states have call successors, (542) [2021-12-17 15:31:08,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3558 states to 3558 states and 4592 transitions. [2021-12-17 15:31:08,391 INFO L78 Accepts]: Start accepts. Automaton has 3558 states and 4592 transitions. Word has length 71 [2021-12-17 15:31:08,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:31:08,392 INFO L470 AbstractCegarLoop]: Abstraction has 3558 states and 4592 transitions. [2021-12-17 15:31:08,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 15:31:08,392 INFO L276 IsEmpty]: Start isEmpty. Operand 3558 states and 4592 transitions. [2021-12-17 15:31:08,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-12-17 15:31:08,393 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:31:08,393 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] [2021-12-17 15:31:08,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-17 15:31:08,393 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:31:08,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:31:08,394 INFO L85 PathProgramCache]: Analyzing trace with hash -2052507104, now seen corresponding path program 1 times [2021-12-17 15:31:08,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:31:08,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907857409] [2021-12-17 15:31:08,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:31:08,394 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:31:08,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:08,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:31:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:08,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:31:08,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:08,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 15:31:08,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:08,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-17 15:31:08,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:08,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:31:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:08,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 15:31:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:08,431 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 15:31:08,431 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:31:08,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907857409] [2021-12-17 15:31:08,431 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907857409] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:31:08,431 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:31:08,432 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 15:31:08,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271821173] [2021-12-17 15:31:08,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:31:08,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 15:31:08,432 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:31:08,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 15:31:08,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 15:31:08,433 INFO L87 Difference]: Start difference. First operand 3558 states and 4592 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-17 15:31:08,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:31:08,875 INFO L93 Difference]: Finished difference Result 10658 states and 14141 transitions. [2021-12-17 15:31:08,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 15:31:08,876 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 72 [2021-12-17 15:31:08,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:31:08,901 INFO L225 Difference]: With dead ends: 10658 [2021-12-17 15:31:08,902 INFO L226 Difference]: Without dead ends: 6928 [2021-12-17 15:31:08,913 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-12-17 15:31:08,914 INFO L933 BasicCegarLoop]: 261 mSDtfsCounter, 631 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 15:31:08,914 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [643 Valid, 780 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 15:31:08,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6928 states. [2021-12-17 15:31:09,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6928 to 6790. [2021-12-17 15:31:09,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6790 states, 5512 states have (on average 1.2193396226415094) internal successors, (6721), 5574 states have internal predecessors, (6721), 754 states have call successors, (754), 466 states have call predecessors, (754), 523 states have return successors, (1151), 751 states have call predecessors, (1151), 751 states have call successors, (1151) [2021-12-17 15:31:09,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6790 states to 6790 states and 8626 transitions. [2021-12-17 15:31:09,205 INFO L78 Accepts]: Start accepts. Automaton has 6790 states and 8626 transitions. Word has length 72 [2021-12-17 15:31:09,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:31:09,205 INFO L470 AbstractCegarLoop]: Abstraction has 6790 states and 8626 transitions. [2021-12-17 15:31:09,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-17 15:31:09,205 INFO L276 IsEmpty]: Start isEmpty. Operand 6790 states and 8626 transitions. [2021-12-17 15:31:09,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-12-17 15:31:09,210 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:31:09,211 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 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:31:09,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-17 15:31:09,211 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:31:09,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:31:09,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1221595769, now seen corresponding path program 1 times [2021-12-17 15:31:09,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:31:09,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802588948] [2021-12-17 15:31:09,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:31:09,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:31:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:09,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:31:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:09,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:31:09,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:09,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 15:31:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:09,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-17 15:31:09,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:09,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:31:09,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:09,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-17 15:31:09,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:09,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-17 15:31:09,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:09,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-17 15:31:09,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:09,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-17 15:31:09,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:09,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-17 15:31:09,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:09,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-17 15:31:09,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:09,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-17 15:31:09,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:09,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-17 15:31:09,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:09,274 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2021-12-17 15:31:09,274 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:31:09,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802588948] [2021-12-17 15:31:09,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802588948] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:31:09,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9738382] [2021-12-17 15:31:09,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:31:09,275 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:31:09,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:31:09,276 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:31:09,306 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:31:09,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:09,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 15:31:09,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:31:09,583 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-12-17 15:31:09,583 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:31:09,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9738382] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:31:09,584 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:31:09,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2021-12-17 15:31:09,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064534938] [2021-12-17 15:31:09,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:31:09,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 15:31:09,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:31:09,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 15:31:09,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-17 15:31:09,585 INFO L87 Difference]: Start difference. First operand 6790 states and 8626 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-17 15:31:09,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:31:09,807 INFO L93 Difference]: Finished difference Result 11276 states and 14390 transitions. [2021-12-17 15:31:09,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 15:31:09,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 127 [2021-12-17 15:31:09,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:31:09,822 INFO L225 Difference]: With dead ends: 11276 [2021-12-17 15:31:09,822 INFO L226 Difference]: Without dead ends: 4297 [2021-12-17 15:31:09,840 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-17 15:31:09,841 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 76 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:31:09,841 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 135 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:31:09,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4297 states. [2021-12-17 15:31:10,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4297 to 4293. [2021-12-17 15:31:10,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4293 states, 3485 states have (on average 1.20545193687231) internal successors, (4201), 3521 states have internal predecessors, (4201), 478 states have call successors, (478), 296 states have call predecessors, (478), 329 states have return successors, (694), 476 states have call predecessors, (694), 476 states have call successors, (694) [2021-12-17 15:31:10,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4293 states to 4293 states and 5373 transitions. [2021-12-17 15:31:10,037 INFO L78 Accepts]: Start accepts. Automaton has 4293 states and 5373 transitions. Word has length 127 [2021-12-17 15:31:10,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:31:10,037 INFO L470 AbstractCegarLoop]: Abstraction has 4293 states and 5373 transitions. [2021-12-17 15:31:10,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-17 15:31:10,038 INFO L276 IsEmpty]: Start isEmpty. Operand 4293 states and 5373 transitions. [2021-12-17 15:31:10,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-12-17 15:31:10,041 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:31:10,041 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:10,059 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:31:10,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-17 15:31:10,252 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:31:10,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:31:10,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1343258013, now seen corresponding path program 1 times [2021-12-17 15:31:10,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:31:10,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789747490] [2021-12-17 15:31:10,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:31:10,252 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:31:10,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:10,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:31:10,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:10,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:31:10,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:10,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 15:31:10,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:10,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-17 15:31:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:10,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:31:10,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:10,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 15:31:10,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:10,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-17 15:31:10,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:10,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-17 15:31:10,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:10,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-17 15:31:10,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:10,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-17 15:31:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:10,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 15:31:10,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:10,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-17 15:31:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:10,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2021-12-17 15:31:10,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:10,318 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-12-17 15:31:10,318 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:31:10,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789747490] [2021-12-17 15:31:10,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789747490] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:31:10,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946047635] [2021-12-17 15:31:10,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:31:10,319 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:31:10,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:31:10,320 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:31:10,347 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:31:10,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:10,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 15:31:10,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:31:10,626 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-17 15:31:10,626 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:31:10,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946047635] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:31:10,626 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:31:10,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2021-12-17 15:31:10,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116205598] [2021-12-17 15:31:10,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:31:10,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 15:31:10,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:31:10,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 15:31:10,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-17 15:31:10,628 INFO L87 Difference]: Start difference. First operand 4293 states and 5373 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-17 15:31:10,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:31:10,785 INFO L93 Difference]: Finished difference Result 9150 states and 11419 transitions. [2021-12-17 15:31:10,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 15:31:10,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 131 [2021-12-17 15:31:10,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:31:10,812 INFO L225 Difference]: With dead ends: 9150 [2021-12-17 15:31:10,812 INFO L226 Difference]: Without dead ends: 5190 [2021-12-17 15:31:10,820 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-17 15:31:10,821 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 45 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:31:10,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 266 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:31:10,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5190 states. [2021-12-17 15:31:10,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5190 to 5190. [2021-12-17 15:31:10,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5190 states, 4198 states have (on average 1.193425440686041) internal successors, (5010), 4238 states have internal predecessors, (5010), 583 states have call successors, (583), 371 states have call predecessors, (583), 408 states have return successors, (809), 581 states have call predecessors, (809), 581 states have call successors, (809) [2021-12-17 15:31:10,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5190 states to 5190 states and 6402 transitions. [2021-12-17 15:31:10,992 INFO L78 Accepts]: Start accepts. Automaton has 5190 states and 6402 transitions. Word has length 131 [2021-12-17 15:31:10,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:31:10,993 INFO L470 AbstractCegarLoop]: Abstraction has 5190 states and 6402 transitions. [2021-12-17 15:31:10,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-17 15:31:10,994 INFO L276 IsEmpty]: Start isEmpty. Operand 5190 states and 6402 transitions. [2021-12-17 15:31:10,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-12-17 15:31:10,997 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:31:10,997 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:11,014 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:31:11,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:31:11,213 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:31:11,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:31:11,214 INFO L85 PathProgramCache]: Analyzing trace with hash 844943966, now seen corresponding path program 1 times [2021-12-17 15:31:11,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:31:11,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935223828] [2021-12-17 15:31:11,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:31:11,214 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:31:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:11,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:31:11,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:11,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:31:11,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:11,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 15:31:11,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:11,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-17 15:31:11,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:11,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:31:11,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:11,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 15:31:11,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:11,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-17 15:31:11,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:11,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-17 15:31:11,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:11,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-17 15:31:11,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:11,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-17 15:31:11,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:11,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-17 15:31:11,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:11,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-17 15:31:11,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:11,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-17 15:31:11,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:11,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-17 15:31:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:11,286 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2021-12-17 15:31:11,286 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:31:11,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935223828] [2021-12-17 15:31:11,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935223828] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:31:11,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068367803] [2021-12-17 15:31:11,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:31:11,287 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:31:11,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:31:11,304 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:31:11,390 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:31:11,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:11,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 15:31:11,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:31:11,623 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-12-17 15:31:11,623 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:31:11,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068367803] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:31:11,623 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:31:11,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2021-12-17 15:31:11,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046789413] [2021-12-17 15:31:11,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:31:11,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 15:31:11,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:31:11,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 15:31:11,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-17 15:31:11,625 INFO L87 Difference]: Start difference. First operand 5190 states and 6402 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2021-12-17 15:31:11,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:31:11,862 INFO L93 Difference]: Finished difference Result 13673 states and 17010 transitions. [2021-12-17 15:31:11,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 15:31:11,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 154 [2021-12-17 15:31:11,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:31:11,883 INFO L225 Difference]: With dead ends: 13673 [2021-12-17 15:31:11,884 INFO L226 Difference]: Without dead ends: 8722 [2021-12-17 15:31:11,895 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-17 15:31:11,896 INFO L933 BasicCegarLoop]: 234 mSDtfsCounter, 95 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:31:11,896 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 356 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:31:11,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8722 states. [2021-12-17 15:31:12,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8722 to 8718. [2021-12-17 15:31:12,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8718 states, 7074 states have (on average 1.1707661860333616) internal successors, (8282), 7130 states have internal predecessors, (8282), 947 states have call successors, (947), 643 states have call predecessors, (947), 696 states have return successors, (1365), 945 states have call predecessors, (1365), 945 states have call successors, (1365) [2021-12-17 15:31:12,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8718 states to 8718 states and 10594 transitions. [2021-12-17 15:31:12,233 INFO L78 Accepts]: Start accepts. Automaton has 8718 states and 10594 transitions. Word has length 154 [2021-12-17 15:31:12,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:31:12,233 INFO L470 AbstractCegarLoop]: Abstraction has 8718 states and 10594 transitions. [2021-12-17 15:31:12,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2021-12-17 15:31:12,234 INFO L276 IsEmpty]: Start isEmpty. Operand 8718 states and 10594 transitions. [2021-12-17 15:31:12,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-12-17 15:31:12,237 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:31:12,238 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:12,253 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:31:12,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-17 15:31:12,453 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:31:12,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:31:12,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1688949468, now seen corresponding path program 1 times [2021-12-17 15:31:12,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:31:12,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430657458] [2021-12-17 15:31:12,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:31:12,454 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:31:12,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:12,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:31:12,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:12,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:31:12,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:12,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 15:31:12,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:12,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-17 15:31:12,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:12,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:31:12,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:12,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 15:31:12,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:12,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-17 15:31:12,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:12,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-17 15:31:12,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:12,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-17 15:31:12,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:12,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-17 15:31:12,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:12,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-17 15:31:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:12,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-17 15:31:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:12,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-17 15:31:12,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:12,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-17 15:31:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:12,525 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2021-12-17 15:31:12,526 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:31:12,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430657458] [2021-12-17 15:31:12,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430657458] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:31:12,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178927669] [2021-12-17 15:31:12,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:31:12,526 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:31:12,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:31:12,538 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:31:12,579 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:31:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:12,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-17 15:31:12,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:31:12,843 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-17 15:31:12,843 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:31:12,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178927669] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:31:12,843 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:31:12,844 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2021-12-17 15:31:12,844 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844935378] [2021-12-17 15:31:12,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:31:12,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 15:31:12,844 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:31:12,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 15:31:12,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-17 15:31:12,845 INFO L87 Difference]: Start difference. First operand 8718 states and 10594 transitions. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-17 15:31:13,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:31:13,076 INFO L93 Difference]: Finished difference Result 14114 states and 17190 transitions. [2021-12-17 15:31:13,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 15:31:13,077 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 154 [2021-12-17 15:31:13,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:31:13,090 INFO L225 Difference]: With dead ends: 14114 [2021-12-17 15:31:13,090 INFO L226 Difference]: Without dead ends: 5407 [2021-12-17 15:31:13,104 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-12-17 15:31:13,104 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 46 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:31:13,105 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 621 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:31:13,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5407 states. [2021-12-17 15:31:13,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5407 to 5115. [2021-12-17 15:31:13,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5115 states, 4342 states have (on average 1.1706586826347305) internal successors, (5083), 4354 states have internal predecessors, (5083), 440 states have call successors, (440), 276 states have call predecessors, (440), 332 states have return successors, (645), 484 states have call predecessors, (645), 438 states have call successors, (645) [2021-12-17 15:31:13,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5115 states to 5115 states and 6168 transitions. [2021-12-17 15:31:13,321 INFO L78 Accepts]: Start accepts. Automaton has 5115 states and 6168 transitions. Word has length 154 [2021-12-17 15:31:13,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:31:13,321 INFO L470 AbstractCegarLoop]: Abstraction has 5115 states and 6168 transitions. [2021-12-17 15:31:13,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-17 15:31:13,321 INFO L276 IsEmpty]: Start isEmpty. Operand 5115 states and 6168 transitions. [2021-12-17 15:31:13,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-12-17 15:31:13,325 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:31:13,325 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:13,355 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:31:13,558 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,SelfDestructingSolverStorable15 [2021-12-17 15:31:13,559 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:31:13,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:31:13,559 INFO L85 PathProgramCache]: Analyzing trace with hash -493377335, now seen corresponding path program 1 times [2021-12-17 15:31:13,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:31:13,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923485534] [2021-12-17 15:31:13,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:31:13,560 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:31:13,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:13,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:31:13,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:13,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:31:13,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:13,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 15:31:13,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:13,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-17 15:31:13,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:13,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:31:13,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:13,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-17 15:31:13,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:13,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-17 15:31:13,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:13,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-17 15:31:13,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:13,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-12-17 15:31:13,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:13,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-17 15:31:13,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:13,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-17 15:31:13,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:13,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-17 15:31:13,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:13,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-12-17 15:31:13,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:13,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-17 15:31:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:13,645 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-12-17 15:31:13,645 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:31:13,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923485534] [2021-12-17 15:31:13,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923485534] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:31:13,645 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:31:13,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 15:31:13,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526386807] [2021-12-17 15:31:13,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:31:13,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 15:31:13,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:31:13,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 15:31:13,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 15:31:13,647 INFO L87 Difference]: Start difference. First operand 5115 states and 6168 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-12-17 15:31:13,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:31:13,852 INFO L93 Difference]: Finished difference Result 5302 states and 6385 transitions. [2021-12-17 15:31:13,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 15:31:13,853 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 158 [2021-12-17 15:31:13,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:31:13,865 INFO L225 Difference]: With dead ends: 5302 [2021-12-17 15:31:13,865 INFO L226 Difference]: Without dead ends: 5025 [2021-12-17 15:31:13,868 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:31:13,868 INFO L933 BasicCegarLoop]: 129 mSDtfsCounter, 94 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 15:31:13,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 305 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 15:31:13,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5025 states. [2021-12-17 15:31:14,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5025 to 4841. [2021-12-17 15:31:14,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4841 states, 4110 states have (on average 1.1734793187347932) internal successors, (4823), 4121 states have internal predecessors, (4823), 417 states have call successors, (417), 260 states have call predecessors, (417), 313 states have return successors, (619), 459 states have call predecessors, (619), 415 states have call successors, (619) [2021-12-17 15:31:14,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4841 states to 4841 states and 5859 transitions. [2021-12-17 15:31:14,070 INFO L78 Accepts]: Start accepts. Automaton has 4841 states and 5859 transitions. Word has length 158 [2021-12-17 15:31:14,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:31:14,071 INFO L470 AbstractCegarLoop]: Abstraction has 4841 states and 5859 transitions. [2021-12-17 15:31:14,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-12-17 15:31:14,071 INFO L276 IsEmpty]: Start isEmpty. Operand 4841 states and 5859 transitions. [2021-12-17 15:31:14,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-12-17 15:31:14,074 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:31:14,074 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:14,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-17 15:31:14,074 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:31:14,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:31:14,075 INFO L85 PathProgramCache]: Analyzing trace with hash -850407883, now seen corresponding path program 1 times [2021-12-17 15:31:14,075 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:31:14,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155150074] [2021-12-17 15:31:14,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:31:14,075 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:31:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:14,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:31:14,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:14,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:31:14,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:14,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 15:31:14,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:14,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-17 15:31:14,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:14,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:31:14,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:14,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-17 15:31:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:14,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-17 15:31:14,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:14,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-17 15:31:14,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:14,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-17 15:31:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:14,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-17 15:31:14,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:14,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-17 15:31:14,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:14,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-17 15:31:14,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:14,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-12-17 15:31:14,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:14,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-17 15:31:14,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:14,162 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 16 proven. 28 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-12-17 15:31:14,162 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:31:14,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155150074] [2021-12-17 15:31:14,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155150074] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:31:14,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001890920] [2021-12-17 15:31:14,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:31:14,164 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:31:14,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:31:14,180 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:31:14,242 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:31:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:14,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 15:31:14,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:31:14,512 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-12-17 15:31:14,513 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:31:14,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001890920] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:31:14,513 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:31:14,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2021-12-17 15:31:14,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356629080] [2021-12-17 15:31:14,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:31:14,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 15:31:14,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:31:14,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 15:31:14,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-17 15:31:14,515 INFO L87 Difference]: Start difference. First operand 4841 states and 5859 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-12-17 15:31:14,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:31:14,648 INFO L93 Difference]: Finished difference Result 9087 states and 11040 transitions. [2021-12-17 15:31:14,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 15:31:14,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 164 [2021-12-17 15:31:14,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:31:14,659 INFO L225 Difference]: With dead ends: 9087 [2021-12-17 15:31:14,660 INFO L226 Difference]: Without dead ends: 4503 [2021-12-17 15:31:14,666 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-17 15:31:14,666 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 25 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:31:14,667 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 259 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:31:14,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4503 states. [2021-12-17 15:31:14,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4503 to 4503. [2021-12-17 15:31:14,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4503 states, 3841 states have (on average 1.1759958344181203) internal successors, (4517), 3852 states have internal predecessors, (4517), 377 states have call successors, (377), 234 states have call predecessors, (377), 284 states have return successors, (568), 416 states have call predecessors, (568), 375 states have call successors, (568) [2021-12-17 15:31:14,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4503 states to 4503 states and 5462 transitions. [2021-12-17 15:31:14,850 INFO L78 Accepts]: Start accepts. Automaton has 4503 states and 5462 transitions. Word has length 164 [2021-12-17 15:31:14,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:31:14,851 INFO L470 AbstractCegarLoop]: Abstraction has 4503 states and 5462 transitions. [2021-12-17 15:31:14,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-12-17 15:31:14,851 INFO L276 IsEmpty]: Start isEmpty. Operand 4503 states and 5462 transitions. [2021-12-17 15:31:14,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-12-17 15:31:14,852 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:31:14,853 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:14,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-17 15:31:15,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-17 15:31:15,069 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:31:15,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:31:15,070 INFO L85 PathProgramCache]: Analyzing trace with hash 990777910, now seen corresponding path program 1 times [2021-12-17 15:31:15,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:31:15,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259431610] [2021-12-17 15:31:15,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:31:15,070 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:31:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:15,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:31:15,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:15,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:31:15,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:15,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 15:31:15,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:15,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-17 15:31:15,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:15,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:31:15,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:15,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-17 15:31:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:15,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-17 15:31:15,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:15,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-17 15:31:15,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:15,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-17 15:31:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:15,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-17 15:31:15,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:15,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-17 15:31:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:15,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-17 15:31:15,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:15,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-12-17 15:31:15,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:15,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-17 15:31:15,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:15,130 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2021-12-17 15:31:15,130 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:31:15,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259431610] [2021-12-17 15:31:15,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259431610] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:31:15,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967955593] [2021-12-17 15:31:15,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:31:15,131 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:31:15,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:31:15,132 INFO L229 MonitoredProcess]: Starting monitored process 8 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:31:15,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-17 15:31:15,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:15,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 15:31:15,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:31:15,391 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-17 15:31:15,392 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:31:15,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967955593] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:31:15,392 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:31:15,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2021-12-17 15:31:15,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544214134] [2021-12-17 15:31:15,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:31:15,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 15:31:15,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:31:15,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 15:31:15,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:31:15,396 INFO L87 Difference]: Start difference. First operand 4503 states and 5462 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-17 15:31:15,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:31:15,504 INFO L93 Difference]: Finished difference Result 8682 states and 10665 transitions. [2021-12-17 15:31:15,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 15:31:15,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 164 [2021-12-17 15:31:15,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:31:15,513 INFO L225 Difference]: With dead ends: 8682 [2021-12-17 15:31:15,514 INFO L226 Difference]: Without dead ends: 4330 [2021-12-17 15:31:15,519 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:31:15,520 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 84 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:31:15,520 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 301 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:31:15,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4330 states. [2021-12-17 15:31:15,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4330 to 4327. [2021-12-17 15:31:15,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4327 states, 3665 states have (on average 1.1607094133697136) internal successors, (4254), 3676 states have internal predecessors, (4254), 377 states have call successors, (377), 234 states have call predecessors, (377), 284 states have return successors, (568), 416 states have call predecessors, (568), 375 states have call successors, (568) [2021-12-17 15:31:15,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4327 states to 4327 states and 5199 transitions. [2021-12-17 15:31:15,646 INFO L78 Accepts]: Start accepts. Automaton has 4327 states and 5199 transitions. Word has length 164 [2021-12-17 15:31:15,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:31:15,647 INFO L470 AbstractCegarLoop]: Abstraction has 4327 states and 5199 transitions. [2021-12-17 15:31:15,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-17 15:31:15,647 INFO L276 IsEmpty]: Start isEmpty. Operand 4327 states and 5199 transitions. [2021-12-17 15:31:15,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-12-17 15:31:15,649 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:31:15,649 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:15,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-17 15:31:15,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:31:15,865 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:31:15,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:31:15,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1614442849, now seen corresponding path program 1 times [2021-12-17 15:31:15,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:31:15,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171384293] [2021-12-17 15:31:15,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:31:15,866 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:31:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:15,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:31:15,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:15,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:31:15,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:15,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 15:31:15,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:15,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-17 15:31:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:15,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:31:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:15,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-17 15:31:15,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:15,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-17 15:31:15,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:15,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-17 15:31:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:15,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-17 15:31:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:15,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-17 15:31:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:15,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-17 15:31:15,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:15,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-17 15:31:15,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:15,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-12-17 15:31:15,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:15,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-12-17 15:31:15,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:15,961 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2021-12-17 15:31:15,961 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:31:15,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171384293] [2021-12-17 15:31:15,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171384293] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:31:15,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276418396] [2021-12-17 15:31:15,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:31:15,963 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:31:15,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:31:15,984 INFO L229 MonitoredProcess]: Starting monitored process 9 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:31:16,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-17 15:31:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:16,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-17 15:31:16,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:31:16,344 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 69 proven. 1 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-12-17 15:31:16,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 15:31:16,741 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2021-12-17 15:31:16,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276418396] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 15:31:16,742 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 15:31:16,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2021-12-17 15:31:16,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784779897] [2021-12-17 15:31:16,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 15:31:16,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-17 15:31:16,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:31:16,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-17 15:31:16,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-12-17 15:31:16,743 INFO L87 Difference]: Start difference. First operand 4327 states and 5199 transitions. Second operand has 12 states, 12 states have (on average 18.5) internal successors, (222), 11 states have internal predecessors, (222), 5 states have call successors, (39), 5 states have call predecessors, (39), 3 states have return successors, (38), 4 states have call predecessors, (38), 4 states have call successors, (38) [2021-12-17 15:31:17,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:31:17,667 INFO L93 Difference]: Finished difference Result 14956 states and 18628 transitions. [2021-12-17 15:31:17,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-17 15:31:17,667 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 18.5) internal successors, (222), 11 states have internal predecessors, (222), 5 states have call successors, (39), 5 states have call predecessors, (39), 3 states have return successors, (38), 4 states have call predecessors, (38), 4 states have call successors, (38) Word has length 165 [2021-12-17 15:31:17,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:31:17,688 INFO L225 Difference]: With dead ends: 14956 [2021-12-17 15:31:17,689 INFO L226 Difference]: Without dead ends: 10554 [2021-12-17 15:31:17,696 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 353 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2021-12-17 15:31:17,697 INFO L933 BasicCegarLoop]: 424 mSDtfsCounter, 1462 mSDsluCounter, 1578 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1478 SdHoareTripleChecker+Valid, 2002 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-17 15:31:17,697 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1478 Valid, 2002 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-17 15:31:17,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10554 states. [2021-12-17 15:31:17,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10554 to 7452. [2021-12-17 15:31:17,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7452 states, 6315 states have (on average 1.1608867775138558) internal successors, (7331), 6336 states have internal predecessors, (7331), 648 states have call successors, (648), 400 states have call predecessors, (648), 488 states have return successors, (982), 715 states have call predecessors, (982), 646 states have call successors, (982) [2021-12-17 15:31:17,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7452 states to 7452 states and 8961 transitions. [2021-12-17 15:31:17,956 INFO L78 Accepts]: Start accepts. Automaton has 7452 states and 8961 transitions. Word has length 165 [2021-12-17 15:31:17,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:31:17,957 INFO L470 AbstractCegarLoop]: Abstraction has 7452 states and 8961 transitions. [2021-12-17 15:31:17,957 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 18.5) internal successors, (222), 11 states have internal predecessors, (222), 5 states have call successors, (39), 5 states have call predecessors, (39), 3 states have return successors, (38), 4 states have call predecessors, (38), 4 states have call successors, (38) [2021-12-17 15:31:17,957 INFO L276 IsEmpty]: Start isEmpty. Operand 7452 states and 8961 transitions. [2021-12-17 15:31:17,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-12-17 15:31:17,959 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:31:17,959 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:17,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-17 15:31:18,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:31:18,176 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:31:18,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:31:18,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1527260902, now seen corresponding path program 1 times [2021-12-17 15:31:18,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:31:18,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190314378] [2021-12-17 15:31:18,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:31:18,176 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:31:18,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:18,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:31:18,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:18,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:31:18,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:18,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 15:31:18,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:18,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-17 15:31:18,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:18,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:31:18,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:18,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-17 15:31:18,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:18,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-17 15:31:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:18,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-17 15:31:18,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:18,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-17 15:31:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:18,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-17 15:31:18,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:18,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-17 15:31:18,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:18,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-12-17 15:31:18,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:18,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-17 15:31:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:18,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-12-17 15:31:18,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:18,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-12-17 15:31:18,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:18,228 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2021-12-17 15:31:18,228 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:31:18,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190314378] [2021-12-17 15:31:18,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190314378] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:31:18,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477893087] [2021-12-17 15:31:18,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:31:18,229 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:31:18,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:31:18,244 INFO L229 MonitoredProcess]: Starting monitored process 10 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:31:18,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-17 15:31:18,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:18,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 15:31:18,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:31:18,570 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-17 15:31:18,570 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:31:18,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477893087] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:31:18,570 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:31:18,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-12-17 15:31:18,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509524480] [2021-12-17 15:31:18,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:31:18,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 15:31:18,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:31:18,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 15:31:18,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-17 15:31:18,572 INFO L87 Difference]: Start difference. First operand 7452 states and 8961 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-17 15:31:18,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:31:18,763 INFO L93 Difference]: Finished difference Result 14200 states and 17109 transitions. [2021-12-17 15:31:18,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 15:31:18,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 184 [2021-12-17 15:31:18,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:31:18,780 INFO L225 Difference]: With dead ends: 14200 [2021-12-17 15:31:18,780 INFO L226 Difference]: Without dead ends: 6724 [2021-12-17 15:31:18,790 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 213 SyntacticMatches, 0 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:31:18,791 INFO L933 BasicCegarLoop]: 174 mSDtfsCounter, 58 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 280 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:31:18,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 280 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:31:18,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6724 states. [2021-12-17 15:31:19,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6724 to 6448. [2021-12-17 15:31:19,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6448 states, 5487 states have (on average 1.1570985966830691) internal successors, (6349), 5504 states have internal predecessors, (6349), 547 states have call successors, (547), 336 states have call predecessors, (547), 413 states have return successors, (753), 607 states have call predecessors, (753), 545 states have call successors, (753) [2021-12-17 15:31:19,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6448 states to 6448 states and 7649 transitions. [2021-12-17 15:31:19,066 INFO L78 Accepts]: Start accepts. Automaton has 6448 states and 7649 transitions. Word has length 184 [2021-12-17 15:31:19,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:31:19,067 INFO L470 AbstractCegarLoop]: Abstraction has 6448 states and 7649 transitions. [2021-12-17 15:31:19,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-17 15:31:19,067 INFO L276 IsEmpty]: Start isEmpty. Operand 6448 states and 7649 transitions. [2021-12-17 15:31:19,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2021-12-17 15:31:19,073 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:31:19,073 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2021-12-17 15:31:19,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-17 15:31:19,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:31:19,290 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:31:19,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:31:19,291 INFO L85 PathProgramCache]: Analyzing trace with hash 837962927, now seen corresponding path program 1 times [2021-12-17 15:31:19,291 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:31:19,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586920024] [2021-12-17 15:31:19,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:31:19,291 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:31:19,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:19,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:31:19,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:19,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:31:19,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:19,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 15:31:19,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:19,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-17 15:31:19,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:19,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:31:19,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:19,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-17 15:31:19,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:19,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-17 15:31:19,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:19,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-17 15:31:19,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:19,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-17 15:31:19,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:19,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-17 15:31:19,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:19,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-17 15:31:19,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:19,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-12-17 15:31:19,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:19,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-17 15:31:19,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:19,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-12-17 15:31:19,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:19,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-12-17 15:31:19,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:19,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2021-12-17 15:31:19,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:19,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2021-12-17 15:31:19,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:19,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2021-12-17 15:31:19,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:19,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2021-12-17 15:31:19,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:19,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2021-12-17 15:31:19,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:19,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-17 15:31:19,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:19,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2021-12-17 15:31:19,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:19,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2021-12-17 15:31:19,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:19,361 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 83 proven. 14 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2021-12-17 15:31:19,361 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:31:19,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586920024] [2021-12-17 15:31:19,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586920024] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:31:19,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874607152] [2021-12-17 15:31:19,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:31:19,362 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:31:19,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:31:19,376 INFO L229 MonitoredProcess]: Starting monitored process 11 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:31:19,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-17 15:31:19,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:19,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 15:31:19,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:31:19,763 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 317 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2021-12-17 15:31:19,763 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:31:19,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874607152] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:31:19,763 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:31:19,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-12-17 15:31:19,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130238048] [2021-12-17 15:31:19,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:31:19,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 15:31:19,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:31:19,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 15:31:19,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 15:31:19,765 INFO L87 Difference]: Start difference. First operand 6448 states and 7649 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2021-12-17 15:31:20,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:31:20,023 INFO L93 Difference]: Finished difference Result 16531 states and 19638 transitions. [2021-12-17 15:31:20,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 15:31:20,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 249 [2021-12-17 15:31:20,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:31:20,048 INFO L225 Difference]: With dead ends: 16531 [2021-12-17 15:31:20,048 INFO L226 Difference]: Without dead ends: 10287 [2021-12-17 15:31:20,058 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 294 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:31:20,059 INFO L933 BasicCegarLoop]: 213 mSDtfsCounter, 61 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:31:20,059 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 340 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:31:20,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10287 states. [2021-12-17 15:31:20,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10287 to 10164. [2021-12-17 15:31:20,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10164 states, 8623 states have (on average 1.1483242491012409) internal successors, (9902), 8640 states have internal predecessors, (9902), 897 states have call successors, (897), 553 states have call predecessors, (897), 643 states have return successors, (1167), 970 states have call predecessors, (1167), 895 states have call successors, (1167) [2021-12-17 15:31:20,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10164 states to 10164 states and 11966 transitions. [2021-12-17 15:31:20,504 INFO L78 Accepts]: Start accepts. Automaton has 10164 states and 11966 transitions. Word has length 249 [2021-12-17 15:31:20,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:31:20,507 INFO L470 AbstractCegarLoop]: Abstraction has 10164 states and 11966 transitions. [2021-12-17 15:31:20,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2021-12-17 15:31:20,507 INFO L276 IsEmpty]: Start isEmpty. Operand 10164 states and 11966 transitions. [2021-12-17 15:31:20,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2021-12-17 15:31:20,514 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:31:20,514 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2021-12-17 15:31:20,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-17 15:31:20,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-12-17 15:31:20,731 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:31:20,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:31:20,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1528072143, now seen corresponding path program 1 times [2021-12-17 15:31:20,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:31:20,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34670930] [2021-12-17 15:31:20,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:31:20,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:31:20,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:20,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:31:20,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:20,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:31:20,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:20,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 15:31:20,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:20,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-17 15:31:20,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:20,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:31:20,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:20,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-17 15:31:20,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:20,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-17 15:31:20,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:20,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-17 15:31:20,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:20,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-17 15:31:20,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:20,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-17 15:31:20,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:20,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-17 15:31:20,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:20,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-12-17 15:31:20,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:20,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-17 15:31:20,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:20,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-12-17 15:31:20,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:20,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-12-17 15:31:20,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:20,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2021-12-17 15:31:20,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:20,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2021-12-17 15:31:20,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:20,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2021-12-17 15:31:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:20,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2021-12-17 15:31:20,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:20,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2021-12-17 15:31:20,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:20,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-17 15:31:20,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:20,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2021-12-17 15:31:20,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:20,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2021-12-17 15:31:20,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:20,818 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 83 proven. 14 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2021-12-17 15:31:20,818 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:31:20,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34670930] [2021-12-17 15:31:20,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34670930] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:31:20,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340300326] [2021-12-17 15:31:20,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:31:20,819 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:31:20,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:31:20,820 INFO L229 MonitoredProcess]: Starting monitored process 12 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:31:20,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-17 15:31:20,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:20,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 15:31:20,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:31:21,241 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 268 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2021-12-17 15:31:21,241 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:31:21,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340300326] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:31:21,242 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:31:21,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2021-12-17 15:31:21,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160126292] [2021-12-17 15:31:21,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:31:21,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 15:31:21,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:31:21,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 15:31:21,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:31:21,245 INFO L87 Difference]: Start difference. First operand 10164 states and 11966 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2021-12-17 15:31:21,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:31:21,592 INFO L93 Difference]: Finished difference Result 11340 states and 13350 transitions. [2021-12-17 15:31:21,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 15:31:21,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 249 [2021-12-17 15:31:21,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:31:21,615 INFO L225 Difference]: With dead ends: 11340 [2021-12-17 15:31:21,615 INFO L226 Difference]: Without dead ends: 10167 [2021-12-17 15:31:21,621 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:31:21,621 INFO L933 BasicCegarLoop]: 213 mSDtfsCounter, 51 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:31:21,622 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 333 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:31:21,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10167 states. [2021-12-17 15:31:22,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10167 to 10164. [2021-12-17 15:31:22,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10164 states, 8623 states have (on average 1.1458889017743246) internal successors, (9881), 8640 states have internal predecessors, (9881), 897 states have call successors, (897), 553 states have call predecessors, (897), 643 states have return successors, (1167), 970 states have call predecessors, (1167), 895 states have call successors, (1167) [2021-12-17 15:31:22,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10164 states to 10164 states and 11945 transitions. [2021-12-17 15:31:22,083 INFO L78 Accepts]: Start accepts. Automaton has 10164 states and 11945 transitions. Word has length 249 [2021-12-17 15:31:22,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:31:22,084 INFO L470 AbstractCegarLoop]: Abstraction has 10164 states and 11945 transitions. [2021-12-17 15:31:22,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2021-12-17 15:31:22,085 INFO L276 IsEmpty]: Start isEmpty. Operand 10164 states and 11945 transitions. [2021-12-17 15:31:22,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2021-12-17 15:31:22,095 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:31:22,096 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:31:22,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-17 15:31:22,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-12-17 15:31:22,311 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:31:22,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:31:22,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1078208605, now seen corresponding path program 1 times [2021-12-17 15:31:22,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:31:22,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014812499] [2021-12-17 15:31:22,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:31:22,312 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:31:22,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:22,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:31:22,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:22,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:31:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:22,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 15:31:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:22,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-17 15:31:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:22,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:31:22,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:22,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-17 15:31:22,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:22,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-17 15:31:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:22,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-17 15:31:22,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:22,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-17 15:31:22,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:22,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-17 15:31:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:22,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-17 15:31:22,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:22,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-17 15:31:22,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:22,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-12-17 15:31:22,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:22,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-17 15:31:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:22,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-12-17 15:31:22,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:22,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2021-12-17 15:31:22,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:22,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2021-12-17 15:31:22,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:22,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2021-12-17 15:31:22,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:22,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2021-12-17 15:31:22,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:22,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-17 15:31:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:22,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2021-12-17 15:31:22,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:22,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-12-17 15:31:22,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:22,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2021-12-17 15:31:22,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:22,376 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 94 proven. 13 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2021-12-17 15:31:22,376 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:31:22,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014812499] [2021-12-17 15:31:22,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014812499] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:31:22,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224533362] [2021-12-17 15:31:22,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:31:22,377 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:31:22,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:31:22,392 INFO L229 MonitoredProcess]: Starting monitored process 13 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:31:22,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-17 15:31:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:31:22,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 15:31:22,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:31:22,770 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 279 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-12-17 15:31:22,770 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:31:22,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224533362] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:31:22,770 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:31:22,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2021-12-17 15:31:22,771 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480906338] [2021-12-17 15:31:22,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:31:22,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 15:31:22,771 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:31:22,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 15:31:22,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 15:31:22,772 INFO L87 Difference]: Start difference. First operand 10164 states and 11945 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2021-12-17 15:31:22,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:31:22,908 INFO L93 Difference]: Finished difference Result 14190 states and 16673 transitions. [2021-12-17 15:31:22,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 15:31:22,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 252 [2021-12-17 15:31:22,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:31:22,920 INFO L225 Difference]: With dead ends: 14190 [2021-12-17 15:31:22,920 INFO L226 Difference]: Without dead ends: 4172 [2021-12-17 15:31:22,931 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 15:31:22,932 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 7 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:31:22,932 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 270 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:31:22,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4172 states. [2021-12-17 15:31:23,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4172 to 4172. [2021-12-17 15:31:23,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4172 states, 3510 states have (on average 1.1236467236467236) internal successors, (3944), 3532 states have internal predecessors, (3944), 364 states have call successors, (364), 245 states have call predecessors, (364), 297 states have return successors, (481), 394 states have call predecessors, (481), 362 states have call successors, (481) [2021-12-17 15:31:23,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4172 states to 4172 states and 4789 transitions. [2021-12-17 15:31:23,077 INFO L78 Accepts]: Start accepts. Automaton has 4172 states and 4789 transitions. Word has length 252 [2021-12-17 15:31:23,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:31:23,078 INFO L470 AbstractCegarLoop]: Abstraction has 4172 states and 4789 transitions. [2021-12-17 15:31:23,078 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2021-12-17 15:31:23,078 INFO L276 IsEmpty]: Start isEmpty. Operand 4172 states and 4789 transitions. [2021-12-17 15:31:23,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2021-12-17 15:31:23,081 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:31:23,081 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2021-12-17 15:31:23,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-17 15:31:23,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-12-17 15:31:23,290 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:31:23,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:31:23,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1480841608, now seen corresponding path program 1 times [2021-12-17 15:31:23,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:31:23,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076978491] [2021-12-17 15:31:23,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:31:23,290 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:31:23,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 15:31:23,309 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-17 15:31:23,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 15:31:23,415 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-17 15:31:23,415 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-17 15:31:23,416 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 15:31:23,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-17 15:31:23,421 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:31:23,424 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 15:31:23,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 03:31:23 BoogieIcfgContainer [2021-12-17 15:31:23,554 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 15:31:23,554 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 15:31:23,554 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 15:31:23,555 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 15:31:23,555 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 03:31:03" (3/4) ... [2021-12-17 15:31:23,556 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-17 15:31:23,663 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-17 15:31:23,663 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 15:31:23,663 INFO L158 Benchmark]: Toolchain (without parser) took 20726.36ms. Allocated memory was 81.8MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 50.4MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 78.6MB. Max. memory is 16.1GB. [2021-12-17 15:31:23,663 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 81.8MB. Free memory is still 41.0MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 15:31:23,663 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.26ms. Allocated memory is still 81.8MB. Free memory was 50.1MB in the beginning and 57.8MB in the end (delta: -7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-17 15:31:23,663 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.23ms. Allocated memory is still 81.8MB. Free memory was 57.8MB in the beginning and 55.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 15:31:23,664 INFO L158 Benchmark]: Boogie Preprocessor took 18.11ms. Allocated memory is still 81.8MB. Free memory was 55.7MB in the beginning and 54.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 15:31:23,664 INFO L158 Benchmark]: RCFGBuilder took 351.36ms. Allocated memory is still 81.8MB. Free memory was 54.0MB in the beginning and 38.6MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-17 15:31:23,664 INFO L158 Benchmark]: TraceAbstraction took 19962.84ms. Allocated memory was 81.8MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 38.3MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2021-12-17 15:31:23,664 INFO L158 Benchmark]: Witness Printer took 108.36ms. Allocated memory is still 2.4GB. Free memory was 2.3GB in the beginning and 2.3GB in the end (delta: 28.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2021-12-17 15:31:23,665 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.24ms. Allocated memory is still 81.8MB. Free memory is still 41.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 250.26ms. Allocated memory is still 81.8MB. Free memory was 50.1MB in the beginning and 57.8MB in the end (delta: -7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.23ms. Allocated memory is still 81.8MB. Free memory was 57.8MB in the beginning and 55.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.11ms. Allocated memory is still 81.8MB. Free memory was 55.7MB in the beginning and 54.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 351.36ms. Allocated memory is still 81.8MB. Free memory was 54.0MB in the beginning and 38.6MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 19962.84ms. Allocated memory was 81.8MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 38.3MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 108.36ms. Allocated memory is still 2.4GB. Free memory was 2.3GB in the beginning and 2.3GB in the end (delta: 28.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int max_loop ; [L26] int num ; [L27] int i ; [L28] int e ; [L29] int timer ; [L30] char data_0 ; [L31] char data_1 ; [L74] int P_1_pc; [L75] int P_1_st ; [L76] int P_1_i ; [L77] int P_1_ev ; [L132] int C_1_pc ; [L133] int C_1_st ; [L134] int C_1_i ; [L135] int C_1_ev ; [L136] int C_1_pr ; VAL [C_1_ev=0, C_1_i=0, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=0, num=0, P_1_ev=0, P_1_i=0, P_1_pc=0, P_1_st=0, timer=0] [L500] int count ; [L501] int __retres2 ; [L505] num = 0 [L506] i = 0 [L507] max_loop = 2 [L509] timer = 0 [L510] P_1_pc = 0 [L511] C_1_pc = 0 [L513] count = 0 [L514] CALL init_model() [L493] P_1_i = 1 [L494] C_1_i = 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L514] RET init_model() [L515] CALL start_simulation() [L431] int kernel_st ; [L432] int tmp ; [L433] int tmp___0 ; [L437] kernel_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L438] FCALL update_channels() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L439] CALL init_threads() [L236] COND TRUE (int )P_1_i == 1 [L237] P_1_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L241] COND TRUE (int )C_1_i == 1 [L242] C_1_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L439] RET init_threads() [L440] FCALL fire_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L441] CALL activate_threads() VAL [\old(C_1_st)=0, \old(P_1_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [\old(C_1_st)=0, \old(P_1_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L117] COND FALSE !((int )P_1_pc == 1) VAL [\old(C_1_st)=0, \old(P_1_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L127] __retres1 = 0 VAL [\old(C_1_st)=0, \old(P_1_st)=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L129] return (__retres1); VAL [\old(C_1_st)=0, \old(P_1_st)=0, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND FALSE !(\read(tmp)) VAL [\old(C_1_st)=0, \old(P_1_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0, tmp=0] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [\old(C_1_st)=0, \old(P_1_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L199] COND FALSE !((int )C_1_pc == 1) VAL [\old(C_1_st)=0, \old(P_1_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L209] COND FALSE !((int )C_1_pc == 2) VAL [\old(C_1_st)=0, \old(P_1_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L219] __retres1 = 0 VAL [\old(C_1_st)=0, \old(P_1_st)=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L221] return (__retres1); VAL [\old(C_1_st)=0, \old(P_1_st)=0, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [\old(C_1_st)=0, \old(P_1_st)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0, tmp=0, tmp___1=0] [L441] RET activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L442] FCALL reset_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L445] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L448] kernel_st = 1 [L449] CALL eval() [L272] int tmp ; [L273] int tmp___0 ; [L274] int tmp___1 ; [L275] int tmp___2 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L279] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L251] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [__retres1=1, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L268] return (__retres1); VAL [\result=1, __retres1=1, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, exists_runnable_thread()=1, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0, tmp___2=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND FALSE !(\read(tmp)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0, tmp=0, tmp___2=1] [L304] COND TRUE (int )C_1_st == 0 [L306] tmp___1 = __VERIFIER_nondet_int() [L308] COND TRUE \read(tmp___1) [L310] C_1_st = 1 [L311] CALL C_1() [L138] char c ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L141] COND TRUE (int )C_1_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L156] COND TRUE i < max_loop VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L158] COND TRUE num == 0 [L159] timer = 1 [L160] i += 1 [L161] C_1_pc = 1 [L162] C_1_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L311] RET C_1() [L279] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1, tmp=0, tmp___1=1, tmp___2=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L251] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [__retres1=1, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L268] return (__retres1); VAL [\result=1, __retres1=1, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, exists_runnable_thread()=1, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1, tmp=0, tmp___1=1, tmp___2=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1, tmp=0, tmp___1=1, tmp___2=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND TRUE \read(tmp) [L295] P_1_st = 1 [L296] CALL P_1() [L82] COND TRUE (int )P_1_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, timer=1] [L93] COND TRUE i < max_loop VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, timer=1] [L96] CALL write_data(num, 'A') [L59] COND TRUE i___0 == 0 [L60] data_0 = c VAL [\old(c)=65, \old(i___0)=0, c=65, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, i___0=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, timer=1] [L96] RET write_data(num, 'A') [L97] num += 1 [L98] P_1_pc = 1 [L99] P_1_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L296] RET P_1() [L304] COND FALSE !((int )C_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=-1, tmp___1=1, tmp___2=1] [L279] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=-1, tmp___1=1, tmp___2=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L251] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L254] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 VAL [__retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L268] return (__retres1); VAL [\result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, exists_runnable_thread()=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=-1, tmp___1=1, tmp___2=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND FALSE !(\read(tmp___2)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=-1, tmp___1=1, tmp___2=0] [L449] RET eval() [L452] kernel_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=2, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L453] FCALL update_channels() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=2, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L456] kernel_st = 3 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=3, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L457] FCALL fire_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=3, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L458] CALL activate_threads() VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L118] COND FALSE !((int )P_1_ev == 1) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L127] __retres1 = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L129] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND FALSE !(\read(tmp)) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L200] COND FALSE !((int )e == 1) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L219] __retres1 = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L221] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0, tmp___1=0] [L458] RET activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=3, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L459] FCALL reset_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=3, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L462] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L251] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L254] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 VAL [__retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L268] return (__retres1); VAL [\result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L462] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, exists_runnable_thread()=0, i=1, kernel_st=3, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L462] tmp = exists_runnable_thread() [L464] COND TRUE tmp == 0 [L466] kernel_st = 4 [L467] CALL fire_time_events() [L346] C_1_ev = 1 [L348] P_1_ev = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L467] RET fire_time_events() [L468] CALL activate_threads() VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L118] COND TRUE (int )P_1_ev == 1 [L119] __retres1 = 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L129] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \result=1, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND TRUE \read(tmp) [L384] P_1_st = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=1] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L200] COND FALSE !((int )e == 1) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L219] __retres1 = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L221] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \result=0, __retres1=0, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=1, tmp___1=0] [L468] RET activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=4, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=0] [L469] CALL reset_time_events() [L360] COND TRUE (int )P_1_ev == 1 [L361] P_1_ev = 2 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L365] COND TRUE (int )C_1_ev == 1 [L366] C_1_ev = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L469] RET reset_time_events() [L475] CALL, EXPR stop_simulation() [L412] int tmp ; [L413] int __retres2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L417] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [__retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L268] return (__retres1); VAL [\result=1, __retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L417] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, exists_runnable_thread()=1, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L417] tmp = exists_runnable_thread() [L419] COND TRUE \read(tmp) [L420] __retres2 = 0 VAL [__retres2=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=1] [L427] return (__retres2); VAL [\result=0, __retres2=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=1] [L475] RET, EXPR stop_simulation() [L475] tmp___0 = stop_simulation() [L477] COND FALSE !(\read(tmp___0)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=4, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=0, tmp___0=0] [L445] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=4, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=0, tmp___0=0] [L448] kernel_st = 1 [L449] CALL eval() [L272] int tmp ; [L273] int tmp___0 ; [L274] int tmp___1 ; [L275] int tmp___2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L279] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [__retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L268] return (__retres1); VAL [\result=1, __retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, exists_runnable_thread()=1, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp___2=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND TRUE \read(tmp) [L295] P_1_st = 1 [L296] CALL P_1() [L82] COND FALSE !((int )P_1_pc == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L85] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L93] COND TRUE i < max_loop VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L96] CALL write_data(num, 'A') [L59] COND FALSE !(i___0 == 0) VAL [\old(c)=65, \old(i___0)=1, c=65, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, i___0=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L62] COND TRUE i___0 == 1 [L63] data_1 = c VAL [\old(c)=65, \old(i___0)=1, c=65, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, i___0=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L96] RET write_data(num, 'A') [L97] num += 1 [L98] P_1_pc = 1 [L99] P_1_st = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L296] RET P_1() [L304] COND FALSE !((int )C_1_st == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=-2, tmp___2=1] [L279] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=-2, tmp___2=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L254] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 VAL [__retres1=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L268] return (__retres1); VAL [\result=0, __retres1=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, exists_runnable_thread()=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=-2, tmp___2=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND FALSE !(\read(tmp___2)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=-2, tmp___2=0] [L449] RET eval() [L452] kernel_st = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=2, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0, tmp___0=0] [L453] FCALL update_channels() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=2, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0, tmp___0=0] [L456] kernel_st = 3 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=3, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0, tmp___0=0] [L457] FCALL fire_delta_events() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=3, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0, tmp___0=0] [L458] CALL activate_threads() VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L118] COND FALSE !((int )P_1_ev == 1) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L127] __retres1 = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L129] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \result=0, __retres1=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND FALSE !(\read(tmp)) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L200] COND FALSE !((int )e == 1) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L219] __retres1 = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L221] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \result=0, __retres1=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0, tmp___1=0] [L458] RET activate_threads() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=3, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0, tmp___0=0] [L459] FCALL reset_delta_events() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=3, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0, tmp___0=0] [L462] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L254] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 VAL [__retres1=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L268] return (__retres1); VAL [\result=0, __retres1=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L462] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, exists_runnable_thread()=0, i=1, kernel_st=3, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1, tmp=0, tmp___0=0] [L462] tmp = exists_runnable_thread() [L464] COND TRUE tmp == 0 [L466] kernel_st = 4 [L467] CALL fire_time_events() [L346] C_1_ev = 1 [L348] P_1_ev = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L467] RET fire_time_events() [L468] CALL activate_threads() VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L118] COND TRUE (int )P_1_ev == 1 [L119] __retres1 = 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L129] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \result=1, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND TRUE \read(tmp) [L384] P_1_st = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=1] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L200] COND FALSE !((int )e == 1) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L219] __retres1 = 0 VAL [\old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L221] return (__retres1); VAL [\old(C_1_st)=2, \old(P_1_st)=2, \result=0, __retres1=0, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [\old(C_1_st)=2, \old(P_1_st)=2, C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=1, tmp___1=0] [L468] RET activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=4, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=0, tmp___0=0] [L469] CALL reset_time_events() [L360] COND TRUE (int )P_1_ev == 1 [L361] P_1_ev = 2 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L365] COND TRUE (int )C_1_ev == 1 [L366] C_1_ev = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L469] RET reset_time_events() [L475] CALL, EXPR stop_simulation() [L412] int tmp ; [L413] int __retres2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L417] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [__retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L268] return (__retres1); VAL [\result=1, __retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L417] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, exists_runnable_thread()=1, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L417] tmp = exists_runnable_thread() [L419] COND TRUE \read(tmp) [L420] __retres2 = 0 VAL [__retres2=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=1] [L427] return (__retres2); VAL [\result=0, __retres2=0, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=1] [L475] RET, EXPR stop_simulation() [L475] tmp___0 = stop_simulation() [L477] COND FALSE !(\read(tmp___0)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=4, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=0, tmp___0=0] [L445] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=4, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp=0, tmp___0=0] [L448] kernel_st = 1 [L449] CALL eval() [L272] int tmp ; [L273] int tmp___0 ; [L274] int tmp___1 ; [L275] int tmp___2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L279] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [__retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L268] return (__retres1); VAL [\result=1, __retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, exists_runnable_thread()=1, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1, tmp___2=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND TRUE \read(tmp) [L295] P_1_st = 1 [L296] CALL P_1() [L82] COND FALSE !((int )P_1_pc == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L85] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L93] COND TRUE i < max_loop VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L96] CALL write_data(num, 'A') [L59] COND FALSE !(i___0 == 0) VAL [\old(c)=65, \old(i___0)=2, c=65, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, i___0=2, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L62] COND FALSE !(i___0 == 1) VAL [\old(c)=65, \old(i___0)=2, c=65, C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, i___0=2, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L66] CALL error() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L19] reach_error() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 108 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.8s, OverallIterations: 25, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5857 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5724 mSDsluCounter, 13224 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8126 mSDsCounter, 1027 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2866 IncrementalHoareTripleChecker+Invalid, 3893 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1027 mSolverCounterUnsat, 5098 mSDtfsCounter, 2866 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2939 GetRequests, 2773 SyntacticMatches, 5 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10164occurred in iteration=22, InterpolantAutomatonStates: 155, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 7281 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 5202 NumberOfCodeBlocks, 5202 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 5054 ConstructedInterpolants, 0 QuantifiedInterpolants, 8606 SizeOfPredicates, 3 NumberOfNonLiveVariables, 5696 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 37 InterpolantComputations, 23 PerfectInterpolantSequences, 4772/4894 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:31:23,698 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