./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/soft_float_3a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_3a.c.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 95f89ee6bcff8f17eb3e93b344abecdfb8ddea0894d1b25afafccf6235d7ced6 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 11:04:27,688 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 11:04:27,689 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 11:04:27,736 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 11:04:27,737 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 11:04:27,738 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 11:04:27,741 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 11:04:27,743 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 11:04:27,745 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 11:04:27,746 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 11:04:27,746 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 11:04:27,748 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 11:04:27,748 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 11:04:27,753 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 11:04:27,753 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 11:04:27,754 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 11:04:27,758 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 11:04:27,759 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 11:04:27,761 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 11:04:27,762 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 11:04:27,765 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 11:04:27,766 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 11:04:27,767 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 11:04:27,767 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 11:04:27,768 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 11:04:27,770 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 11:04:27,771 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 11:04:27,771 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 11:04:27,772 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 11:04:27,773 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 11:04:27,773 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 11:04:27,774 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 11:04:27,775 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 11:04:27,775 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 11:04:27,776 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 11:04:27,776 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 11:04:27,776 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 11:04:27,777 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 11:04:27,777 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 11:04:27,777 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 11:04:27,778 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 11:04:27,779 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 11:04:27,780 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 11:04:27,804 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 11:04:27,804 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 11:04:27,805 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 11:04:27,805 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 11:04:27,805 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 11:04:27,805 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 11:04:27,806 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 11:04:27,806 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 11:04:27,806 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 11:04:27,807 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 11:04:27,807 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 11:04:27,807 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 11:04:27,807 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 11:04:27,807 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 11:04:27,808 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 11:04:27,808 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 11:04:27,808 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 11:04:27,808 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 11:04:27,808 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 11:04:27,808 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 11:04:27,809 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 11:04:27,809 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 11:04:27,809 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 11:04:27,809 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 11:04:27,809 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 11:04:27,809 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 11:04:27,810 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 11:04:27,810 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 11:04:27,810 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 11:04:27,810 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 11:04:27,810 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 11:04:27,810 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 11:04:27,811 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 11:04:27,811 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 -> 95f89ee6bcff8f17eb3e93b344abecdfb8ddea0894d1b25afafccf6235d7ced6 [2022-07-22 11:04:27,978 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 11:04:27,995 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 11:04:27,997 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 11:04:27,998 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 11:04:27,999 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 11:04:27,999 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_3a.c.cil.c [2022-07-22 11:04:28,050 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2372e1a7/228a250490024ffd9d4fb7a85dda7aef/FLAG8709ad739 [2022-07-22 11:04:28,346 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 11:04:28,346 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_3a.c.cil.c [2022-07-22 11:04:28,351 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2372e1a7/228a250490024ffd9d4fb7a85dda7aef/FLAG8709ad739 [2022-07-22 11:04:28,777 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2372e1a7/228a250490024ffd9d4fb7a85dda7aef [2022-07-22 11:04:28,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 11:04:28,780 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 11:04:28,781 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 11:04:28,781 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 11:04:28,789 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 11:04:28,790 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:04:28" (1/1) ... [2022-07-22 11:04:28,791 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@103d83d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:04:28, skipping insertion in model container [2022-07-22 11:04:28,791 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:04:28" (1/1) ... [2022-07-22 11:04:28,795 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 11:04:28,826 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 11:04:28,946 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/bitvector/soft_float_3a.c.cil.c[728,741] [2022-07-22 11:04:28,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:04:28,991 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 11:04:28,999 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/bitvector/soft_float_3a.c.cil.c[728,741] [2022-07-22 11:04:29,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:04:29,035 INFO L208 MainTranslator]: Completed translation [2022-07-22 11:04:29,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:04:29 WrapperNode [2022-07-22 11:04:29,041 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 11:04:29,042 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 11:04:29,042 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 11:04:29,042 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 11:04:29,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:04:29" (1/1) ... [2022-07-22 11:04:29,061 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:04:29" (1/1) ... [2022-07-22 11:04:29,082 INFO L137 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 178 [2022-07-22 11:04:29,083 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 11:04:29,083 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 11:04:29,083 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 11:04:29,083 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 11:04:29,089 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:04:29" (1/1) ... [2022-07-22 11:04:29,089 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:04:29" (1/1) ... [2022-07-22 11:04:29,091 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:04:29" (1/1) ... [2022-07-22 11:04:29,091 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:04:29" (1/1) ... [2022-07-22 11:04:29,096 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:04:29" (1/1) ... [2022-07-22 11:04:29,100 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:04:29" (1/1) ... [2022-07-22 11:04:29,104 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:04:29" (1/1) ... [2022-07-22 11:04:29,107 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 11:04:29,108 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 11:04:29,108 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 11:04:29,108 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 11:04:29,112 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:04:29" (1/1) ... [2022-07-22 11:04:29,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 11:04:29,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:04:29,135 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 11:04:29,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 11:04:29,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 11:04:29,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 11:04:29,165 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-07-22 11:04:29,165 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-07-22 11:04:29,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 11:04:29,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 11:04:29,166 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-22 11:04:29,166 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-22 11:04:29,219 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 11:04:29,220 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 11:04:29,531 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 11:04:29,536 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 11:04:29,536 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-22 11:04:29,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:04:29 BoogieIcfgContainer [2022-07-22 11:04:29,538 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 11:04:29,539 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 11:04:29,539 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 11:04:29,541 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 11:04:29,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 11:04:28" (1/3) ... [2022-07-22 11:04:29,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@420f7a7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:04:29, skipping insertion in model container [2022-07-22 11:04:29,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:04:29" (2/3) ... [2022-07-22 11:04:29,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@420f7a7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:04:29, skipping insertion in model container [2022-07-22 11:04:29,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:04:29" (3/3) ... [2022-07-22 11:04:29,552 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_3a.c.cil.c [2022-07-22 11:04:29,567 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 11:04:29,567 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 11:04:29,626 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 11:04:29,630 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@74b9d993, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@56903eaf [2022-07-22 11:04:29,633 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 11:04:29,636 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 78 states have (on average 1.7179487179487178) internal successors, (134), 80 states have internal predecessors, (134), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-22 11:04:29,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-22 11:04:29,647 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:04:29,647 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:04:29,648 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:04:29,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:04:29,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1780268165, now seen corresponding path program 1 times [2022-07-22 11:04:29,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:04:29,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885637667] [2022-07-22 11:04:29,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:04:29,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:04:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:29,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:04:29,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:29,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:04:29,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:29,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 11:04:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:29,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 11:04:29,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:29,896 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-22 11:04:29,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:04:29,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885637667] [2022-07-22 11:04:29,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885637667] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:04:29,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:04:29,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:04:29,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777856448] [2022-07-22 11:04:29,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:04:29,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:04:29,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:04:29,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:04:29,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:04:29,934 INFO L87 Difference]: Start difference. First operand has 87 states, 78 states have (on average 1.7179487179487178) internal successors, (134), 80 states have internal predecessors, (134), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-22 11:04:30,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:04:30,023 INFO L93 Difference]: Finished difference Result 184 states and 309 transitions. [2022-07-22 11:04:30,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:04:30,025 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2022-07-22 11:04:30,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:04:30,031 INFO L225 Difference]: With dead ends: 184 [2022-07-22 11:04:30,031 INFO L226 Difference]: Without dead ends: 89 [2022-07-22 11:04:30,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:04:30,036 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 41 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:04:30,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 335 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:04:30,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-22 11:04:30,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 81. [2022-07-22 11:04:30,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 74 states have (on average 1.5135135135135136) internal successors, (112), 74 states have internal predecessors, (112), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-22 11:04:30,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 121 transitions. [2022-07-22 11:04:30,065 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 121 transitions. Word has length 41 [2022-07-22 11:04:30,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:04:30,066 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 121 transitions. [2022-07-22 11:04:30,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-22 11:04:30,066 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 121 transitions. [2022-07-22 11:04:30,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-22 11:04:30,068 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:04:30,068 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:04:30,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 11:04:30,069 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:04:30,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:04:30,069 INFO L85 PathProgramCache]: Analyzing trace with hash -2045217877, now seen corresponding path program 1 times [2022-07-22 11:04:30,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:04:30,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905654304] [2022-07-22 11:04:30,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:04:30,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:04:30,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:30,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:04:30,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:30,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:04:30,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:30,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 11:04:30,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:30,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 11:04:30,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:30,164 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-22 11:04:30,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:04:30,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905654304] [2022-07-22 11:04:30,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905654304] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:04:30,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:04:30,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 11:04:30,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175926051] [2022-07-22 11:04:30,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:04:30,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 11:04:30,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:04:30,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 11:04:30,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:04:30,167 INFO L87 Difference]: Start difference. First operand 81 states and 121 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-22 11:04:30,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:04:30,206 INFO L93 Difference]: Finished difference Result 99 states and 147 transitions. [2022-07-22 11:04:30,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 11:04:30,206 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2022-07-22 11:04:30,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:04:30,207 INFO L225 Difference]: With dead ends: 99 [2022-07-22 11:04:30,210 INFO L226 Difference]: Without dead ends: 89 [2022-07-22 11:04:30,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-22 11:04:30,211 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 36 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:04:30,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 433 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:04:30,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-22 11:04:30,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 81. [2022-07-22 11:04:30,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 74 states have (on average 1.5) internal successors, (111), 74 states have internal predecessors, (111), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-22 11:04:30,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 120 transitions. [2022-07-22 11:04:30,219 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 120 transitions. Word has length 43 [2022-07-22 11:04:30,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:04:30,219 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 120 transitions. [2022-07-22 11:04:30,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-22 11:04:30,220 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 120 transitions. [2022-07-22 11:04:30,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-22 11:04:30,221 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:04:30,221 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:04:30,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 11:04:30,221 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:04:30,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:04:30,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1440402793, now seen corresponding path program 1 times [2022-07-22 11:04:30,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:04:30,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109909438] [2022-07-22 11:04:30,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:04:30,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:04:30,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:30,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:04:30,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:30,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:04:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:30,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 11:04:30,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:30,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 11:04:30,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:30,302 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-22 11:04:30,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:04:30,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109909438] [2022-07-22 11:04:30,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109909438] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:04:30,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099665384] [2022-07-22 11:04:30,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:04:30,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:04:30,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:04:30,306 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) [2022-07-22 11:04:30,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-22 11:04:30,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:30,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-22 11:04:30,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:04:30,461 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-22 11:04:30,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:04:30,602 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-22 11:04:30,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099665384] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-22 11:04:30,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-22 11:04:30,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 8] total 15 [2022-07-22 11:04:30,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607313290] [2022-07-22 11:04:30,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:04:30,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 11:04:30,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:04:30,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 11:04:30,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2022-07-22 11:04:30,604 INFO L87 Difference]: Start difference. First operand 81 states and 120 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-22 11:04:30,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:04:30,692 INFO L93 Difference]: Finished difference Result 167 states and 248 transitions. [2022-07-22 11:04:30,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 11:04:30,693 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2022-07-22 11:04:30,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:04:30,694 INFO L225 Difference]: With dead ends: 167 [2022-07-22 11:04:30,694 INFO L226 Difference]: Without dead ends: 118 [2022-07-22 11:04:30,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2022-07-22 11:04:30,695 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 50 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:04:30,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 559 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:04:30,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-07-22 11:04:30,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 87. [2022-07-22 11:04:30,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 79 states have (on average 1.4683544303797469) internal successors, (116), 79 states have internal predecessors, (116), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-22 11:04:30,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 129 transitions. [2022-07-22 11:04:30,703 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 129 transitions. Word has length 43 [2022-07-22 11:04:30,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:04:30,703 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 129 transitions. [2022-07-22 11:04:30,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-22 11:04:30,703 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 129 transitions. [2022-07-22 11:04:30,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-22 11:04:30,704 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:04:30,704 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:04:30,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-22 11:04:30,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:04:30,923 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:04:30,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:04:30,923 INFO L85 PathProgramCache]: Analyzing trace with hash 853596779, now seen corresponding path program 1 times [2022-07-22 11:04:30,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:04:30,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446041332] [2022-07-22 11:04:30,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:04:30,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:04:30,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:30,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:04:30,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:30,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:04:30,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:31,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 11:04:31,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:31,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 11:04:31,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:31,011 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-22 11:04:31,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:04:31,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446041332] [2022-07-22 11:04:31,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446041332] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:04:31,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675836108] [2022-07-22 11:04:31,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:04:31,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:04:31,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:04:31,018 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) [2022-07-22 11:04:31,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-22 11:04:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:31,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-22 11:04:31,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:04:31,154 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-22 11:04:31,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:04:31,267 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-22 11:04:31,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675836108] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:04:31,268 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 11:04:31,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 6] total 15 [2022-07-22 11:04:31,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102702602] [2022-07-22 11:04:31,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 11:04:31,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-22 11:04:31,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:04:31,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-22 11:04:31,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2022-07-22 11:04:31,269 INFO L87 Difference]: Start difference. First operand 87 states and 129 transitions. Second operand has 15 states, 15 states have (on average 4.0) internal successors, (60), 12 states have internal predecessors, (60), 4 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2022-07-22 11:04:31,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:04:31,699 INFO L93 Difference]: Finished difference Result 307 states and 490 transitions. [2022-07-22 11:04:31,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-22 11:04:31,699 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 12 states have internal predecessors, (60), 4 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) Word has length 43 [2022-07-22 11:04:31,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:04:31,701 INFO L225 Difference]: With dead ends: 307 [2022-07-22 11:04:31,701 INFO L226 Difference]: Without dead ends: 223 [2022-07-22 11:04:31,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=739, Unknown=0, NotChecked=0, Total=930 [2022-07-22 11:04:31,720 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 246 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:04:31,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 987 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 11:04:31,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-07-22 11:04:31,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 160. [2022-07-22 11:04:31,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 149 states have (on average 1.4697986577181208) internal successors, (219), 148 states have internal predecessors, (219), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (15), 8 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-22 11:04:31,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 240 transitions. [2022-07-22 11:04:31,736 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 240 transitions. Word has length 43 [2022-07-22 11:04:31,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:04:31,736 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 240 transitions. [2022-07-22 11:04:31,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 12 states have internal predecessors, (60), 4 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2022-07-22 11:04:31,737 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 240 transitions. [2022-07-22 11:04:31,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-22 11:04:31,738 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:04:31,738 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:04:31,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-22 11:04:31,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-22 11:04:31,963 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:04:31,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:04:31,963 INFO L85 PathProgramCache]: Analyzing trace with hash -662181193, now seen corresponding path program 1 times [2022-07-22 11:04:31,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:04:31,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472962240] [2022-07-22 11:04:31,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:04:31,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:04:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:31,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:04:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:31,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:04:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:32,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-22 11:04:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:32,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 11:04:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:32,015 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-22 11:04:32,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:04:32,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472962240] [2022-07-22 11:04:32,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472962240] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:04:32,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949582617] [2022-07-22 11:04:32,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:04:32,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:04:32,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:04:32,024 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) [2022-07-22 11:04:32,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-22 11:04:32,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:32,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 11:04:32,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:04:32,092 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 11:04:32,092 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 11:04:32,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949582617] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:04:32,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 11:04:32,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-07-22 11:04:32,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145154] [2022-07-22 11:04:32,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:04:32,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:04:32,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:04:32,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:04:32,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-22 11:04:32,093 INFO L87 Difference]: Start difference. First operand 160 states and 240 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-22 11:04:32,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:04:32,135 INFO L93 Difference]: Finished difference Result 322 states and 485 transitions. [2022-07-22 11:04:32,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:04:32,135 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 48 [2022-07-22 11:04:32,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:04:32,136 INFO L225 Difference]: With dead ends: 322 [2022-07-22 11:04:32,136 INFO L226 Difference]: Without dead ends: 169 [2022-07-22 11:04:32,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-22 11:04:32,138 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 28 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:04:32,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 307 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:04:32,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-07-22 11:04:32,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2022-07-22 11:04:32,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 153 states have (on average 1.4640522875816993) internal successors, (224), 153 states have internal predecessors, (224), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (18), 8 states have call predecessors, (18), 5 states have call successors, (18) [2022-07-22 11:04:32,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 248 transitions. [2022-07-22 11:04:32,146 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 248 transitions. Word has length 48 [2022-07-22 11:04:32,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:04:32,147 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 248 transitions. [2022-07-22 11:04:32,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-22 11:04:32,147 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 248 transitions. [2022-07-22 11:04:32,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-22 11:04:32,148 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:04:32,148 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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] [2022-07-22 11:04:32,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-22 11:04:32,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:04:32,374 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:04:32,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:04:32,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1876784193, now seen corresponding path program 1 times [2022-07-22 11:04:32,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:04:32,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466758428] [2022-07-22 11:04:32,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:04:32,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:04:32,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:32,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:04:32,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:32,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:04:32,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:32,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 11:04:32,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:32,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 11:04:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:32,428 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-22 11:04:32,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:04:32,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466758428] [2022-07-22 11:04:32,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466758428] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:04:32,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742434969] [2022-07-22 11:04:32,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:04:32,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:04:32,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:04:32,430 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) [2022-07-22 11:04:32,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-22 11:04:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:32,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 11:04:32,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:04:32,510 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 11:04:32,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:04:32,582 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-22 11:04:32,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742434969] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:04:32,582 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 11:04:32,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2022-07-22 11:04:32,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82188279] [2022-07-22 11:04:32,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 11:04:32,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-22 11:04:32,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:04:32,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-22 11:04:32,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-07-22 11:04:32,587 INFO L87 Difference]: Start difference. First operand 165 states and 248 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-22 11:04:32,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:04:32,864 INFO L93 Difference]: Finished difference Result 466 states and 742 transitions. [2022-07-22 11:04:32,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-22 11:04:32,865 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2022-07-22 11:04:32,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:04:32,867 INFO L225 Difference]: With dead ends: 466 [2022-07-22 11:04:32,867 INFO L226 Difference]: Without dead ends: 308 [2022-07-22 11:04:32,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=213, Invalid=437, Unknown=0, NotChecked=0, Total=650 [2022-07-22 11:04:32,868 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 403 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:04:32,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 800 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:04:32,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-07-22 11:04:32,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 181. [2022-07-22 11:04:32,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 169 states have (on average 1.4970414201183433) internal successors, (253), 169 states have internal predecessors, (253), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (18), 8 states have call predecessors, (18), 5 states have call successors, (18) [2022-07-22 11:04:32,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 277 transitions. [2022-07-22 11:04:32,889 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 277 transitions. Word has length 51 [2022-07-22 11:04:32,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:04:32,889 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 277 transitions. [2022-07-22 11:04:32,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-22 11:04:32,889 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 277 transitions. [2022-07-22 11:04:32,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-22 11:04:32,890 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:04:32,890 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:04:32,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-22 11:04:33,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:04:33,091 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:04:33,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:04:33,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1192790047, now seen corresponding path program 1 times [2022-07-22 11:04:33,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:04:33,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815071690] [2022-07-22 11:04:33,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:04:33,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:04:33,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:33,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:04:33,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:33,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:04:33,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:33,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 11:04:33,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:33,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 11:04:33,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:33,194 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-22 11:04:33,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:04:33,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815071690] [2022-07-22 11:04:33,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815071690] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:04:33,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699992816] [2022-07-22 11:04:33,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:04:33,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:04:33,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:04:33,196 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) [2022-07-22 11:04:33,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-22 11:04:33,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:33,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-22 11:04:33,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:04:33,286 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-22 11:04:33,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:04:33,345 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-22 11:04:33,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699992816] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-22 11:04:33,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-22 11:04:33,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 7] total 14 [2022-07-22 11:04:33,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214095408] [2022-07-22 11:04:33,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:04:33,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 11:04:33,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:04:33,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 11:04:33,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-07-22 11:04:33,348 INFO L87 Difference]: Start difference. First operand 181 states and 277 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-22 11:04:33,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:04:33,393 INFO L93 Difference]: Finished difference Result 204 states and 301 transitions. [2022-07-22 11:04:33,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 11:04:33,393 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 55 [2022-07-22 11:04:33,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:04:33,396 INFO L225 Difference]: With dead ends: 204 [2022-07-22 11:04:33,396 INFO L226 Difference]: Without dead ends: 198 [2022-07-22 11:04:33,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-07-22 11:04:33,398 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 22 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:04:33,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 457 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:04:33,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-22 11:04:33,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2022-07-22 11:04:33,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 184 states have (on average 1.4619565217391304) internal successors, (269), 184 states have internal predecessors, (269), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (18), 8 states have call predecessors, (18), 5 states have call successors, (18) [2022-07-22 11:04:33,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 293 transitions. [2022-07-22 11:04:33,411 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 293 transitions. Word has length 55 [2022-07-22 11:04:33,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:04:33,412 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 293 transitions. [2022-07-22 11:04:33,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-22 11:04:33,413 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 293 transitions. [2022-07-22 11:04:33,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-22 11:04:33,414 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:04:33,414 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:04:33,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-22 11:04:33,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:04:33,623 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:04:33,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:04:33,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1135531745, now seen corresponding path program 1 times [2022-07-22 11:04:33,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:04:33,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877348220] [2022-07-22 11:04:33,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:04:33,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:04:33,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:33,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:04:33,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:33,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:04:33,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:33,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 11:04:33,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:33,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 11:04:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:33,677 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-22 11:04:33,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:04:33,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877348220] [2022-07-22 11:04:33,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877348220] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:04:33,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:04:33,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 11:04:33,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720306749] [2022-07-22 11:04:33,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:04:33,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 11:04:33,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:04:33,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 11:04:33,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 11:04:33,680 INFO L87 Difference]: Start difference. First operand 196 states and 293 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-22 11:04:33,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:04:33,719 INFO L93 Difference]: Finished difference Result 222 states and 334 transitions. [2022-07-22 11:04:33,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 11:04:33,720 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 55 [2022-07-22 11:04:33,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:04:33,724 INFO L225 Difference]: With dead ends: 222 [2022-07-22 11:04:33,724 INFO L226 Difference]: Without dead ends: 205 [2022-07-22 11:04:33,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-22 11:04:33,725 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 38 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:04:33,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 662 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:04:33,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-07-22 11:04:33,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 185. [2022-07-22 11:04:33,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 173 states have (on average 1.4682080924855492) internal successors, (254), 174 states have internal predecessors, (254), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-22 11:04:33,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 275 transitions. [2022-07-22 11:04:33,734 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 275 transitions. Word has length 55 [2022-07-22 11:04:33,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:04:33,735 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 275 transitions. [2022-07-22 11:04:33,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-22 11:04:33,735 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 275 transitions. [2022-07-22 11:04:33,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-22 11:04:33,737 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:04:33,737 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-22 11:04:33,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 11:04:33,737 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:04:33,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:04:33,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1032849812, now seen corresponding path program 1 times [2022-07-22 11:04:33,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:04:33,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609110675] [2022-07-22 11:04:33,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:04:33,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:04:33,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:33,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:04:33,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:33,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:04:33,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:33,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 11:04:33,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:33,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 11:04:33,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:33,823 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-22 11:04:33,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:04:33,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609110675] [2022-07-22 11:04:33,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609110675] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:04:33,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156388309] [2022-07-22 11:04:33,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:04:33,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:04:33,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:04:33,836 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) [2022-07-22 11:04:33,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-22 11:04:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:33,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 11:04:33,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:04:33,921 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 11:04:33,921 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 11:04:33,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156388309] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:04:33,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 11:04:33,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2022-07-22 11:04:33,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137483597] [2022-07-22 11:04:33,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:04:33,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 11:04:33,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:04:33,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 11:04:33,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-22 11:04:33,923 INFO L87 Difference]: Start difference. First operand 185 states and 275 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-22 11:04:34,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:04:34,057 INFO L93 Difference]: Finished difference Result 405 states and 619 transitions. [2022-07-22 11:04:34,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 11:04:34,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 57 [2022-07-22 11:04:34,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:04:34,059 INFO L225 Difference]: With dead ends: 405 [2022-07-22 11:04:34,059 INFO L226 Difference]: Without dead ends: 227 [2022-07-22 11:04:34,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-22 11:04:34,060 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 47 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:04:34,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 404 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:04:34,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-07-22 11:04:34,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 192. [2022-07-22 11:04:34,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 180 states have (on average 1.461111111111111) internal successors, (263), 181 states have internal predecessors, (263), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-22 11:04:34,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 284 transitions. [2022-07-22 11:04:34,069 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 284 transitions. Word has length 57 [2022-07-22 11:04:34,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:04:34,069 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 284 transitions. [2022-07-22 11:04:34,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-22 11:04:34,069 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 284 transitions. [2022-07-22 11:04:34,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-22 11:04:34,070 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:04:34,070 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-22 11:04:34,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-22 11:04:34,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:04:34,289 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:04:34,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:04:34,290 INFO L85 PathProgramCache]: Analyzing trace with hash -897188252, now seen corresponding path program 1 times [2022-07-22 11:04:34,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:04:34,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568959374] [2022-07-22 11:04:34,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:04:34,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:04:34,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:34,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:04:34,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:34,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:04:34,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:34,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 11:04:34,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:34,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 11:04:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:34,378 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-22 11:04:34,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:04:34,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568959374] [2022-07-22 11:04:34,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568959374] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:04:34,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791111527] [2022-07-22 11:04:34,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:04:34,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:04:34,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:04:34,379 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) [2022-07-22 11:04:34,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-22 11:04:34,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:34,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-22 11:04:34,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:04:34,470 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 11:04:34,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:04:34,557 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-22 11:04:34,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791111527] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:04:34,557 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 11:04:34,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-07-22 11:04:34,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708995074] [2022-07-22 11:04:34,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 11:04:34,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-22 11:04:34,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:04:34,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 11:04:34,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-22 11:04:34,559 INFO L87 Difference]: Start difference. First operand 192 states and 284 transitions. Second operand has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 13 states have internal predecessors, (80), 2 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-22 11:04:35,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:04:35,097 INFO L93 Difference]: Finished difference Result 528 states and 827 transitions. [2022-07-22 11:04:35,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-22 11:04:35,098 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 13 states have internal predecessors, (80), 2 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 60 [2022-07-22 11:04:35,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:04:35,099 INFO L225 Difference]: With dead ends: 528 [2022-07-22 11:04:35,099 INFO L226 Difference]: Without dead ends: 343 [2022-07-22 11:04:35,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=345, Invalid=845, Unknown=0, NotChecked=0, Total=1190 [2022-07-22 11:04:35,101 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 572 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 11:04:35,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 637 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 11:04:35,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-07-22 11:04:35,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 189. [2022-07-22 11:04:35,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 177 states have (on average 1.4463276836158192) internal successors, (256), 178 states have internal predecessors, (256), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-22 11:04:35,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 277 transitions. [2022-07-22 11:04:35,110 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 277 transitions. Word has length 60 [2022-07-22 11:04:35,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:04:35,111 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 277 transitions. [2022-07-22 11:04:35,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 13 states have internal predecessors, (80), 2 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-22 11:04:35,111 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 277 transitions. [2022-07-22 11:04:35,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-22 11:04:35,112 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:04:35,112 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 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] [2022-07-22 11:04:35,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-22 11:04:35,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:04:35,327 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:04:35,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:04:35,328 INFO L85 PathProgramCache]: Analyzing trace with hash -33599038, now seen corresponding path program 1 times [2022-07-22 11:04:35,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:04:35,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196632069] [2022-07-22 11:04:35,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:04:35,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:04:35,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:35,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:04:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:35,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:04:35,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:35,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-22 11:04:35,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:35,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 11:04:35,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:35,401 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 4 proven. 35 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-22 11:04:35,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:04:35,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196632069] [2022-07-22 11:04:35,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196632069] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:04:35,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658015477] [2022-07-22 11:04:35,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:04:35,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:04:35,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:04:35,412 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) [2022-07-22 11:04:35,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-22 11:04:35,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:35,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 11:04:35,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:04:35,524 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 11:04:35,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:04:35,651 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 4 proven. 35 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-22 11:04:35,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658015477] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:04:35,651 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 11:04:35,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2022-07-22 11:04:35,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930247746] [2022-07-22 11:04:35,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 11:04:35,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-22 11:04:35,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:04:35,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-22 11:04:35,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2022-07-22 11:04:35,652 INFO L87 Difference]: Start difference. First operand 189 states and 277 transitions. Second operand has 21 states, 21 states have (on average 4.476190476190476) internal successors, (94), 20 states have internal predecessors, (94), 2 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-22 11:04:36,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:04:36,120 INFO L93 Difference]: Finished difference Result 665 states and 1051 transitions. [2022-07-22 11:04:36,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-22 11:04:36,120 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.476190476190476) internal successors, (94), 20 states have internal predecessors, (94), 2 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 62 [2022-07-22 11:04:36,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:04:36,122 INFO L225 Difference]: With dead ends: 665 [2022-07-22 11:04:36,123 INFO L226 Difference]: Without dead ends: 483 [2022-07-22 11:04:36,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=654, Invalid=1326, Unknown=0, NotChecked=0, Total=1980 [2022-07-22 11:04:36,124 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 1090 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1090 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:04:36,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1090 Valid, 732 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 11:04:36,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2022-07-22 11:04:36,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 210. [2022-07-22 11:04:36,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 198 states have (on average 1.47979797979798) internal successors, (293), 199 states have internal predecessors, (293), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-22 11:04:36,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 314 transitions. [2022-07-22 11:04:36,139 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 314 transitions. Word has length 62 [2022-07-22 11:04:36,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:04:36,139 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 314 transitions. [2022-07-22 11:04:36,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.476190476190476) internal successors, (94), 20 states have internal predecessors, (94), 2 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-22 11:04:36,139 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 314 transitions. [2022-07-22 11:04:36,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-22 11:04:36,140 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:04:36,140 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 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] [2022-07-22 11:04:36,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-22 11:04:36,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-22 11:04:36,358 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:04:36,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:04:36,358 INFO L85 PathProgramCache]: Analyzing trace with hash 94815332, now seen corresponding path program 2 times [2022-07-22 11:04:36,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:04:36,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243409982] [2022-07-22 11:04:36,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:04:36,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:04:36,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:36,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:04:36,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:36,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:04:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:36,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-22 11:04:36,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:36,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-22 11:04:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:36,497 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 4 proven. 54 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-22 11:04:36,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:04:36,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243409982] [2022-07-22 11:04:36,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243409982] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:04:36,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511615479] [2022-07-22 11:04:36,497 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 11:04:36,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:04:36,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:04:36,499 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) [2022-07-22 11:04:36,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-22 11:04:36,574 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 11:04:36,574 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 11:04:36,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-22 11:04:36,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:04:36,677 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 25 proven. 45 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 11:04:36,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:04:36,863 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 4 proven. 54 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-22 11:04:36,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511615479] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:04:36,863 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 11:04:36,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2022-07-22 11:04:36,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702601933] [2022-07-22 11:04:36,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 11:04:36,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-22 11:04:36,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:04:36,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-22 11:04:36,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-07-22 11:04:36,864 INFO L87 Difference]: Start difference. First operand 210 states and 314 transitions. Second operand has 26 states, 26 states have (on average 4.461538461538462) internal successors, (116), 25 states have internal predecessors, (116), 2 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-22 11:04:47,662 WARN L233 SmtUtils]: Spent 5.48s on a formula simplification. DAG size of input: 42 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 11:05:06,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:05:06,021 INFO L93 Difference]: Finished difference Result 643 states and 1016 transitions. [2022-07-22 11:05:06,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-22 11:05:06,022 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.461538461538462) internal successors, (116), 25 states have internal predecessors, (116), 2 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2022-07-22 11:05:06,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:05:06,025 INFO L225 Difference]: With dead ends: 643 [2022-07-22 11:05:06,025 INFO L226 Difference]: Without dead ends: 440 [2022-07-22 11:05:06,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 28.5s TimeCoverageRelationStatistics Valid=993, Invalid=2909, Unknown=4, NotChecked=0, Total=3906 [2022-07-22 11:05:06,027 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 1127 mSDsluCounter, 1118 mSDsCounter, 0 mSdLazyCounter, 1306 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1127 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 1663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 1306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-22 11:05:06,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1127 Valid, 1246 Invalid, 1663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 1306 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-22 11:05:06,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2022-07-22 11:05:06,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 213. [2022-07-22 11:05:06,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 201 states have (on average 1.472636815920398) internal successors, (296), 202 states have internal predecessors, (296), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-22 11:05:06,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 317 transitions. [2022-07-22 11:05:06,043 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 317 transitions. Word has length 72 [2022-07-22 11:05:06,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:05:06,043 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 317 transitions. [2022-07-22 11:05:06,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.461538461538462) internal successors, (116), 25 states have internal predecessors, (116), 2 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-22 11:05:06,043 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 317 transitions. [2022-07-22 11:05:06,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-22 11:05:06,047 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:05:06,047 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 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] [2022-07-22 11:05:06,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-22 11:05:06,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:05:06,262 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:05:06,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:05:06,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1227676354, now seen corresponding path program 2 times [2022-07-22 11:05:06,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:05:06,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394190180] [2022-07-22 11:05:06,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:06,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:05:06,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:06,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:05:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:06,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:05:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:06,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 11:05:06,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:06,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-22 11:05:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:06,432 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 4 proven. 164 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-22 11:05:06,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:05:06,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394190180] [2022-07-22 11:05:06,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394190180] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:05:06,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675077750] [2022-07-22 11:05:06,433 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 11:05:06,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:05:06,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:05:06,436 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) [2022-07-22 11:05:06,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-22 11:05:06,494 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 11:05:06,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 11:05:06,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-22 11:05:06,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:05:06,656 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 25 proven. 155 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 11:05:06,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:05:07,017 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 4 proven. 164 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-22 11:05:07,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675077750] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:05:07,017 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 11:05:07,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 39 [2022-07-22 11:05:07,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193298403] [2022-07-22 11:05:07,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 11:05:07,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-22 11:05:07,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:05:07,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-22 11:05:07,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=492, Invalid=990, Unknown=0, NotChecked=0, Total=1482 [2022-07-22 11:05:07,019 INFO L87 Difference]: Start difference. First operand 213 states and 317 transitions. Second operand has 39 states, 39 states have (on average 3.7948717948717947) internal successors, (148), 38 states have internal predecessors, (148), 2 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-22 11:05:08,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:05:08,319 INFO L93 Difference]: Finished difference Result 1030 states and 1673 transitions. [2022-07-22 11:05:08,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-07-22 11:05:08,319 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.7948717948717947) internal successors, (148), 38 states have internal predecessors, (148), 2 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 80 [2022-07-22 11:05:08,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:05:08,323 INFO L225 Difference]: With dead ends: 1030 [2022-07-22 11:05:08,324 INFO L226 Difference]: Without dead ends: 824 [2022-07-22 11:05:08,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2207 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2379, Invalid=4931, Unknown=0, NotChecked=0, Total=7310 [2022-07-22 11:05:08,327 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 2268 mSDsluCounter, 1258 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 561 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2268 SdHoareTripleChecker+Valid, 1363 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 561 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-22 11:05:08,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2268 Valid, 1363 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [561 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-22 11:05:08,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2022-07-22 11:05:08,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 246. [2022-07-22 11:05:08,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 234 states have (on average 1.5085470085470085) internal successors, (353), 235 states have internal predecessors, (353), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-22 11:05:08,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 374 transitions. [2022-07-22 11:05:08,355 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 374 transitions. Word has length 80 [2022-07-22 11:05:08,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:05:08,355 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 374 transitions. [2022-07-22 11:05:08,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.7948717948717947) internal successors, (148), 38 states have internal predecessors, (148), 2 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-22 11:05:08,356 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 374 transitions. [2022-07-22 11:05:08,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-22 11:05:08,357 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:05:08,357 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 4, 4, 4, 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] [2022-07-22 11:05:08,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-22 11:05:08,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-22 11:05:08,563 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:05:08,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:05:08,564 INFO L85 PathProgramCache]: Analyzing trace with hash 511529060, now seen corresponding path program 3 times [2022-07-22 11:05:08,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:05:08,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805414357] [2022-07-22 11:05:08,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:08,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:05:08,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:08,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:05:08,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:08,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:05:08,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:08,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-22 11:05:08,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:08,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 11:05:08,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:08,866 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 4 proven. 282 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-22 11:05:08,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:05:08,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805414357] [2022-07-22 11:05:08,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805414357] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:05:08,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757940620] [2022-07-22 11:05:08,867 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 11:05:08,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:05:08,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:05:08,873 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) [2022-07-22 11:05:08,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-22 11:05:09,279 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2022-07-22 11:05:09,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 11:05:09,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-22 11:05:09,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:05:09,617 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 25 proven. 273 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 11:05:09,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:05:10,370 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 4 proven. 282 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-22 11:05:10,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757940620] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:05:10,370 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 11:05:10,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 50 [2022-07-22 11:05:10,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755816318] [2022-07-22 11:05:10,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 11:05:10,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-22 11:05:10,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:05:10,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-22 11:05:10,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=1831, Unknown=0, NotChecked=0, Total=2450 [2022-07-22 11:05:10,372 INFO L87 Difference]: Start difference. First operand 246 states and 374 transitions. Second operand has 50 states, 50 states have (on average 3.76) internal successors, (188), 49 states have internal predecessors, (188), 2 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-22 11:05:25,692 WARN L233 SmtUtils]: Spent 6.83s on a formula simplification. DAG size of input: 57 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 11:05:34,507 WARN L233 SmtUtils]: Spent 5.83s on a formula simplification. DAG size of input: 52 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 11:05:43,727 WARN L233 SmtUtils]: Spent 7.98s on a formula simplification. DAG size of input: 47 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 11:06:17,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:06:17,592 INFO L93 Difference]: Finished difference Result 835 states and 1329 transitions. [2022-07-22 11:06:17,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-07-22 11:06:17,593 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.76) internal successors, (188), 49 states have internal predecessors, (188), 2 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 96 [2022-07-22 11:06:17,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:06:17,595 INFO L225 Difference]: With dead ends: 835 [2022-07-22 11:06:17,596 INFO L226 Difference]: Without dead ends: 596 [2022-07-22 11:06:17,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3414 ImplicationChecksByTransitivity, 65.0s TimeCoverageRelationStatistics Valid=2913, Invalid=9964, Unknown=5, NotChecked=0, Total=12882 [2022-07-22 11:06:17,599 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 1885 mSDsluCounter, 3428 mSDsCounter, 0 mSdLazyCounter, 4614 mSolverCounterSat, 1108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1885 SdHoareTripleChecker+Valid, 3572 SdHoareTripleChecker+Invalid, 5722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1108 IncrementalHoareTripleChecker+Valid, 4614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-22 11:06:17,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1885 Valid, 3572 Invalid, 5722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1108 Valid, 4614 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-22 11:06:17,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2022-07-22 11:06:17,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 243. [2022-07-22 11:06:17,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 231 states have (on average 1.4978354978354977) internal successors, (346), 232 states have internal predecessors, (346), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-22 11:06:17,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 367 transitions. [2022-07-22 11:06:17,615 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 367 transitions. Word has length 96 [2022-07-22 11:06:17,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:06:17,616 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 367 transitions. [2022-07-22 11:06:17,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.76) internal successors, (188), 49 states have internal predecessors, (188), 2 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-22 11:06:17,616 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 367 transitions. [2022-07-22 11:06:17,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-22 11:06:17,617 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:06:17,617 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 22, 4, 4, 4, 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] [2022-07-22 11:06:17,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-22 11:06:17,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-22 11:06:17,822 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:06:17,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:06:17,822 INFO L85 PathProgramCache]: Analyzing trace with hash -95998782, now seen corresponding path program 3 times [2022-07-22 11:06:17,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:06:17,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361270066] [2022-07-22 11:06:17,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:06:17,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:06:17,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:06:17,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:06:17,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:06:17,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:06:17,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:06:18,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-22 11:06:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:06:18,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-22 11:06:18,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:06:18,172 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 4 proven. 746 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-22 11:06:18,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:06:18,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361270066] [2022-07-22 11:06:18,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361270066] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:06:18,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481272646] [2022-07-22 11:06:18,173 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 11:06:18,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:06:18,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:06:18,174 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) [2022-07-22 11:06:18,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-22 11:07:23,722 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2022-07-22 11:07:23,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 11:07:23,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-22 11:07:23,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:07:24,137 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 25 proven. 737 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 11:07:24,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:07:25,106 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 4 proven. 746 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-22 11:07:25,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481272646] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:07:25,106 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 11:07:25,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 75 [2022-07-22 11:07:25,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837765587] [2022-07-22 11:07:25,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 11:07:25,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-07-22 11:07:25,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:07:25,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-07-22 11:07:25,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1848, Invalid=3702, Unknown=0, NotChecked=0, Total=5550 [2022-07-22 11:07:25,110 INFO L87 Difference]: Start difference. First operand 243 states and 367 transitions. Second operand has 75 states, 75 states have (on average 3.4133333333333336) internal successors, (256), 74 states have internal predecessors, (256), 2 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-22 11:07:29,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:07:29,377 INFO L93 Difference]: Finished difference Result 1747 states and 2909 transitions. [2022-07-22 11:07:29,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2022-07-22 11:07:29,378 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 3.4133333333333336) internal successors, (256), 74 states have internal predecessors, (256), 2 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 116 [2022-07-22 11:07:29,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:07:29,384 INFO L225 Difference]: With dead ends: 1747 [2022-07-22 11:07:29,384 INFO L226 Difference]: Without dead ends: 1511 [2022-07-22 11:07:29,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8944 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=9130, Invalid=19262, Unknown=0, NotChecked=0, Total=28392 [2022-07-22 11:07:29,392 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 6601 mSDsluCounter, 1672 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 1231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6601 SdHoareTripleChecker+Valid, 1777 SdHoareTripleChecker+Invalid, 1895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1231 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-22 11:07:29,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6601 Valid, 1777 Invalid, 1895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1231 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-22 11:07:29,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2022-07-22 11:07:29,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 318. [2022-07-22 11:07:29,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 306 states have (on average 1.5457516339869282) internal successors, (473), 307 states have internal predecessors, (473), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-22 11:07:29,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 494 transitions. [2022-07-22 11:07:29,456 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 494 transitions. Word has length 116 [2022-07-22 11:07:29,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:07:29,456 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 494 transitions. [2022-07-22 11:07:29,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 3.4133333333333336) internal successors, (256), 74 states have internal predecessors, (256), 2 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-22 11:07:29,457 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 494 transitions. [2022-07-22 11:07:29,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-22 11:07:29,458 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:07:29,458 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 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] [2022-07-22 11:07:29,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-22 11:07:29,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-22 11:07:29,668 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:07:29,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:07:29,668 INFO L85 PathProgramCache]: Analyzing trace with hash 974708580, now seen corresponding path program 4 times [2022-07-22 11:07:29,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:07:29,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338720373] [2022-07-22 11:07:29,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:07:29,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:07:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:07:29,727 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:07:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:07:29,774 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:07:29,774 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-22 11:07:29,775 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 11:07:29,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-22 11:07:29,778 INFO L356 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:07:29,781 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 11:07:29,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 11:07:29 BoogieIcfgContainer [2022-07-22 11:07:29,850 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 11:07:29,850 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 11:07:29,850 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 11:07:29,851 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 11:07:29,851 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:04:29" (3/4) ... [2022-07-22 11:07:29,853 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-22 11:07:29,853 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 11:07:29,853 INFO L158 Benchmark]: Toolchain (without parser) took 181073.35ms. Allocated memory was 86.0MB in the beginning and 220.2MB in the end (delta: 134.2MB). Free memory was 52.0MB in the beginning and 95.7MB in the end (delta: -43.7MB). Peak memory consumption was 89.6MB. Max. memory is 16.1GB. [2022-07-22 11:07:29,853 INFO L158 Benchmark]: CDTParser took 7.28ms. Allocated memory is still 86.0MB. Free memory was 56.8MB in the beginning and 67.8MB in the end (delta: -11.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 11:07:29,853 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.63ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 51.8MB in the beginning and 78.4MB in the end (delta: -26.6MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. [2022-07-22 11:07:29,853 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.09ms. Allocated memory is still 104.9MB. Free memory was 78.4MB in the beginning and 76.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 11:07:29,854 INFO L158 Benchmark]: Boogie Preprocessor took 24.02ms. Allocated memory is still 104.9MB. Free memory was 76.1MB in the beginning and 74.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 11:07:29,854 INFO L158 Benchmark]: RCFGBuilder took 430.22ms. Allocated memory is still 104.9MB. Free memory was 74.6MB in the beginning and 56.4MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-07-22 11:07:29,854 INFO L158 Benchmark]: TraceAbstraction took 180311.13ms. Allocated memory was 104.9MB in the beginning and 220.2MB in the end (delta: 115.3MB). Free memory was 55.8MB in the beginning and 95.7MB in the end (delta: -39.9MB). Peak memory consumption was 75.4MB. Max. memory is 16.1GB. [2022-07-22 11:07:29,854 INFO L158 Benchmark]: Witness Printer took 2.19ms. Allocated memory is still 220.2MB. Free memory is still 95.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 11:07:29,855 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 7.28ms. Allocated memory is still 86.0MB. Free memory was 56.8MB in the beginning and 67.8MB in the end (delta: -11.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 260.63ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 51.8MB in the beginning and 78.4MB in the end (delta: -26.6MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.09ms. Allocated memory is still 104.9MB. Free memory was 78.4MB in the beginning and 76.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.02ms. Allocated memory is still 104.9MB. Free memory was 76.1MB in the beginning and 74.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 430.22ms. Allocated memory is still 104.9MB. Free memory was 74.6MB in the beginning and 56.4MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 180311.13ms. Allocated memory was 104.9MB in the beginning and 220.2MB in the end (delta: 115.3MB). Free memory was 55.8MB in the beginning and 95.7MB in the end (delta: -39.9MB). Peak memory consumption was 75.4MB. Max. memory is 16.1GB. * Witness Printer took 2.19ms. Allocated memory is still 220.2MB. Free memory is still 95.7MB. There was no memory consumed. 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 - UnprovableResult [Line: 17]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseComplement at line 76. Possible FailurePath: [L221] unsigned int a ; [L222] unsigned int ma = __VERIFIER_nondet_uint(); [L223] signed char ea = __VERIFIER_nondet_char(); [L224] unsigned int b ; [L225] unsigned int mb = __VERIFIER_nondet_uint(); [L226] signed char eb = __VERIFIER_nondet_char(); [L227] unsigned int r_mul ; [L228] unsigned int zero ; [L229] unsigned int one ; [L230] int sb ; [L231] int tmp ; [L232] int tmp___0 ; [L233] int tmp___1 ; [L234] int __retres16 ; VAL [ea=127, eb=0] [L238] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=0, m=0, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, __retres4=0, e=0, m=0, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L80] return (__retres4); VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, \result=0, __retres4=0, e=0, m=0, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L238] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=127, eb=0, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L238] zero = base2flt(0, 0) [L239] CALL, EXPR base2flt(1, 0) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=0, m=1, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=0, m=1, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L35] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=0, m=1, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=0, m=1, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-1, m=2, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-1, m=2, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-1, m=2, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-2, m=4, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-2, m=4, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-2, m=4, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-3, m=8, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-3, m=8, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-3, m=8, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-4, m=16, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-4, m=16, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-4, m=16, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-5, m=32, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-5, m=32, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-5, m=32, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-6, m=64, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-6, m=64, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-6, m=64, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-7, m=128, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-7, m=128, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-7, m=128, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-8, m=256, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-8, m=256, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-8, m=256, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-9, m=512, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-9, m=512, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-9, m=512, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-10, m=1024, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-10, m=1024, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-10, m=1024, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-11, m=2048, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-11, m=2048, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-11, m=2048, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-12, m=4096, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-12, m=4096, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-12, m=4096, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-13, m=8192, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-13, m=8192, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-13, m=8192, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-14, m=16384, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-14, m=16384, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-14, m=16384, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-15, m=32768, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-15, m=32768, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-15, m=32768, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-16, m=65536, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-16, m=65536, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-16, m=65536, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-17, m=131072, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-17, m=131072, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-17, m=131072, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-18, m=262144, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-18, m=262144, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-18, m=262144, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-19, m=524288, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-19, m=524288, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-19, m=524288, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-20, m=1048576, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-20, m=1048576, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-20, m=1048576, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-21, m=2097152, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-21, m=2097152, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-21, m=2097152, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-22, m=4194304, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-22, m=4194304, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-22, m=4194304, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-23, m=8388608, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-23, m=8388608, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-23, m=8388608, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-24, m=16777216, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L47] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-24, m=16777216, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-24, m=0, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L77] res = m | ((unsigned int )(e + 128) << 24U) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-24, m=0, m = m & ~ (1U << 24U)=4294967297, res=0, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L78] __retres4 = res VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, __retres4=0, e=-24, m=0, m = m & ~ (1U << 24U)=4294967297, res=0, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L80] return (__retres4); VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, \result=4294967296, __retres4=0, e=-24, m=0, m = m & ~ (1U << 24U)=4294967297, res=0, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L239] RET, EXPR base2flt(1, 0) VAL [base2flt(1, 0)=4294967296, ea=127, eb=0, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=1744830464, zero=0] [L239] one = base2flt(1, 0) [L240] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, e=127, m=33554432, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L29] COND FALSE !(! m) VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, e=127, m=33554432, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, e=127, m=33554432, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L57] COND TRUE 1 VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, e=127, m=33554432, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L59] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, e=127, m=33554432, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L64] COND TRUE e >= 127 [L65] __retres4 = 4294967295U VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, __retres4=4294967295, e=127, m=33554432, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L80] return (__retres4); VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, \result=4294967295, __retres4=4294967295, e=127, m=33554432, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L240] RET, EXPR base2flt(ma, ea) VAL [base2flt(ma, ea)=4294967295, ea=127, eb=0, m = m & ~ (1U << 24U)=4294967297, ma=33554432, one=0, res = m | ((unsigned int )(e + 128) << 24U)=1744830464, zero=0] [L240] a = base2flt(ma, ea) [L241] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, e=0, m=0, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, __retres4=0, e=0, m=0, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L80] return (__retres4); VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, \result=0, __retres4=0, e=0, m=0, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L241] RET, EXPR base2flt(mb, eb) VAL [a=4294967295, base2flt(mb, eb)=0, ea=127, eb=0, m = m & ~ (1U << 24U)=4294967297, ma=33554432, mb=0, one=0, res = m | ((unsigned int )(e + 128) << 24U)=1744830464, zero=0] [L241] b = base2flt(mb, eb) [L242] CALL, EXPR mulflt(a, b) [L148] unsigned int res ; [L149] unsigned int ma ; [L150] unsigned int mb ; [L151] unsigned long long accu ; [L152] int ea ; [L153] int eb ; [L154] unsigned int tmp ; [L155] unsigned int __retres10 ; VAL [\old(a)=4294967295, \old(b)=0, a=4294967295, b=0, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L158] COND FALSE !(a < b) VAL [\old(a)=4294967295, \old(b)=0, a=4294967295, b=0, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L165] COND TRUE ! b [L166] __retres10 = 0U VAL [\old(a)=4294967295, \old(b)=0, __retres10=0, a=4294967295, b=0, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L217] return (__retres10); VAL [\old(a)=4294967295, \old(b)=0, \result=0, __retres10=0, a=4294967295, b=0, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L242] RET, EXPR mulflt(a, b) [L242] r_mul = mulflt(a, b) [L244] COND FALSE !(b < one) VAL [a=4294967295, b=0, ea=127, eb=0, m = m & ~ (1U << 24U)=4294967297, ma=33554432, mb=0, one=0, r_mul=0, res = m | ((unsigned int )(e + 128) << 24U)=1744830464, zero=0] [L247] COND FALSE !(b > one) [L250] tmp = 0 VAL [a=4294967295, b=0, ea=127, eb=0, m = m & ~ (1U << 24U)=4294967297, ma=33554432, mb=0, one=0, r_mul=0, res = m | ((unsigned int )(e + 128) << 24U)=1744830464, tmp=0, zero=0] [L252] sb = tmp VAL [a=4294967295, b=0, ea=127, eb=0, m = m & ~ (1U << 24U)=4294967297, ma=33554432, mb=0, one=0, r_mul=0, res = m | ((unsigned int )(e + 128) << 24U)=1744830464, sb=0, tmp=0, zero=0] [L254] COND TRUE sb == 0 VAL [a=4294967295, b=0, ea=127, eb=0, m = m & ~ (1U << 24U)=4294967297, ma=33554432, mb=0, one=0, r_mul=0, res = m | ((unsigned int )(e + 128) << 24U)=1744830464, sb=0, tmp=0, zero=0] [L255] COND TRUE r_mul < a [L256] tmp___1 = -1 VAL [a=4294967295, b=0, ea=127, eb=0, m = m & ~ (1U << 24U)=4294967297, ma=33554432, mb=0, one=0, r_mul=0, res = m | ((unsigned int )(e + 128) << 24U)=1744830464, sb=0, tmp=0, tmp___1=-1, zero=0] [L266] CALL __VERIFIER_assert(tmp___1 == 0) VAL [\old(cond)=0, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L16] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L17] reach_error() VAL [\old(cond)=0, cond=0, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 87 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 180.2s, OverallIterations: 16, TraceHistogramMax: 24, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 104.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14454 SdHoareTripleChecker+Valid, 6.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14454 mSDsluCounter, 14271 SdHoareTripleChecker+Invalid, 5.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12536 mSDsCounter, 3757 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8686 IncrementalHoareTripleChecker+Invalid, 12443 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3757 mSolverCounterUnsat, 1735 mSDtfsCounter, 8686 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2289 GetRequests, 1679 SyntacticMatches, 0 SemanticMatches, 610 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16831 ImplicationChecksByTransitivity, 98.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=318occurred in iteration=15, InterpolantAutomatonStates: 480, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 3076 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 66.4s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 1831 NumberOfCodeBlocks, 1831 NumberOfCodeBlocksAsserted, 71 NumberOfCheckSat, 2346 ConstructedInterpolants, 0 QuantifiedInterpolants, 8264 SizeOfPredicates, 25 NumberOfNonLiveVariables, 2621 ConjunctsInSsa, 162 ConjunctsInUnsatCore, 37 InterpolantComputations, 7 PerfectInterpolantSequences, 923/4853 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 could not prove your program: unable to determine feasibility of some traces [2022-07-22 11:07:29,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/bitvector/soft_float_3a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 95f89ee6bcff8f17eb3e93b344abecdfb8ddea0894d1b25afafccf6235d7ced6 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 11:07:31,473 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 11:07:31,474 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 11:07:31,521 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 11:07:31,521 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 11:07:31,522 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 11:07:31,526 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 11:07:31,528 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 11:07:31,530 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 11:07:31,534 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 11:07:31,535 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 11:07:31,536 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 11:07:31,537 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 11:07:31,538 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 11:07:31,539 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 11:07:31,542 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 11:07:31,545 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 11:07:31,546 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 11:07:31,547 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 11:07:31,549 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 11:07:31,552 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 11:07:31,552 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 11:07:31,553 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 11:07:31,554 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 11:07:31,555 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 11:07:31,557 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 11:07:31,558 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 11:07:31,558 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 11:07:31,558 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 11:07:31,559 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 11:07:31,559 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 11:07:31,560 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 11:07:31,561 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 11:07:31,561 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 11:07:31,562 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 11:07:31,563 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 11:07:31,563 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 11:07:31,563 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 11:07:31,563 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 11:07:31,564 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 11:07:31,564 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 11:07:31,565 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 11:07:31,566 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-22 11:07:31,594 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 11:07:31,596 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 11:07:31,596 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 11:07:31,596 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 11:07:31,597 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 11:07:31,597 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 11:07:31,597 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 11:07:31,597 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 11:07:31,598 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 11:07:31,598 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 11:07:31,598 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 11:07:31,598 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 11:07:31,599 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 11:07:31,599 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 11:07:31,599 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 11:07:31,599 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 11:07:31,599 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-22 11:07:31,599 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-22 11:07:31,599 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-22 11:07:31,600 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 11:07:31,600 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 11:07:31,600 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 11:07:31,600 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 11:07:31,600 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 11:07:31,601 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 11:07:31,601 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 11:07:31,601 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 11:07:31,601 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 11:07:31,601 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 11:07:31,601 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 11:07:31,602 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-22 11:07:31,602 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-22 11:07:31,602 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 11:07:31,602 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 11:07:31,602 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 11:07:31,602 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-22 11:07:31,602 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 95f89ee6bcff8f17eb3e93b344abecdfb8ddea0894d1b25afafccf6235d7ced6 [2022-07-22 11:07:31,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 11:07:31,885 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 11:07:31,887 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 11:07:31,888 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 11:07:31,888 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 11:07:31,890 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_3a.c.cil.c [2022-07-22 11:07:31,936 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/840f87f73/4e8e2976b8224a5a8b692f7f7d851ddd/FLAGdcedb462e [2022-07-22 11:07:32,308 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 11:07:32,309 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_3a.c.cil.c [2022-07-22 11:07:32,317 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/840f87f73/4e8e2976b8224a5a8b692f7f7d851ddd/FLAGdcedb462e [2022-07-22 11:07:32,702 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/840f87f73/4e8e2976b8224a5a8b692f7f7d851ddd [2022-07-22 11:07:32,704 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 11:07:32,706 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 11:07:32,707 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 11:07:32,707 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 11:07:32,709 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 11:07:32,710 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:07:32" (1/1) ... [2022-07-22 11:07:32,712 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ba99a29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:07:32, skipping insertion in model container [2022-07-22 11:07:32,713 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:07:32" (1/1) ... [2022-07-22 11:07:32,717 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 11:07:32,731 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 11:07:32,844 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/bitvector/soft_float_3a.c.cil.c[728,741] [2022-07-22 11:07:32,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:07:32,900 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 11:07:32,908 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/bitvector/soft_float_3a.c.cil.c[728,741] [2022-07-22 11:07:32,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:07:32,959 INFO L208 MainTranslator]: Completed translation [2022-07-22 11:07:32,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:07:32 WrapperNode [2022-07-22 11:07:32,960 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 11:07:32,960 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 11:07:32,960 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 11:07:32,961 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 11:07:32,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:07:32" (1/1) ... [2022-07-22 11:07:32,978 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:07:32" (1/1) ... [2022-07-22 11:07:32,997 INFO L137 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 110 [2022-07-22 11:07:32,997 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 11:07:32,998 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 11:07:32,999 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 11:07:32,999 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 11:07:33,004 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:07:32" (1/1) ... [2022-07-22 11:07:33,004 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:07:32" (1/1) ... [2022-07-22 11:07:33,017 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:07:32" (1/1) ... [2022-07-22 11:07:33,017 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:07:32" (1/1) ... [2022-07-22 11:07:33,024 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:07:32" (1/1) ... [2022-07-22 11:07:33,027 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:07:32" (1/1) ... [2022-07-22 11:07:33,028 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:07:32" (1/1) ... [2022-07-22 11:07:33,029 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 11:07:33,030 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 11:07:33,030 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 11:07:33,030 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 11:07:33,030 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:07:32" (1/1) ... [2022-07-22 11:07:33,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 11:07:33,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:07:33,060 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 11:07:33,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 11:07:33,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 11:07:33,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-22 11:07:33,096 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-07-22 11:07:33,097 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-07-22 11:07:33,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 11:07:33,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 11:07:33,098 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-22 11:07:33,098 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-22 11:07:33,198 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 11:07:33,200 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 11:07:33,420 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 11:07:33,427 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 11:07:33,434 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-22 11:07:33,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:07:33 BoogieIcfgContainer [2022-07-22 11:07:33,435 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 11:07:33,437 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 11:07:33,437 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 11:07:33,439 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 11:07:33,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 11:07:32" (1/3) ... [2022-07-22 11:07:33,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f8d5c18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:07:33, skipping insertion in model container [2022-07-22 11:07:33,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:07:32" (2/3) ... [2022-07-22 11:07:33,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f8d5c18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:07:33, skipping insertion in model container [2022-07-22 11:07:33,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:07:33" (3/3) ... [2022-07-22 11:07:33,441 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_3a.c.cil.c [2022-07-22 11:07:33,456 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 11:07:33,460 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 11:07:33,501 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 11:07:33,508 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@74f1fe05, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@229fe577 [2022-07-22 11:07:33,509 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 11:07:33,512 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 44 states have internal predecessors, (66), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-22 11:07:33,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-22 11:07:33,519 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:07:33,520 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:07:33,521 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:07:33,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:07:33,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1696138713, now seen corresponding path program 1 times [2022-07-22 11:07:33,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:07:33,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [224404391] [2022-07-22 11:07:33,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:07:33,536 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:07:33,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:07:33,541 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 11:07:33,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-22 11:07:33,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:07:33,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 11:07:33,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:07:33,683 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 11:07:33,683 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 11:07:33,684 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 11:07:33,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [224404391] [2022-07-22 11:07:33,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [224404391] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:07:33,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:07:33,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:07:33,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704237369] [2022-07-22 11:07:33,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:07:33,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:07:33,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 11:07:33,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:07:33,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:07:33,711 INFO L87 Difference]: Start difference. First operand has 51 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 44 states have internal predecessors, (66), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-22 11:07:33,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:07:33,805 INFO L93 Difference]: Finished difference Result 113 states and 179 transitions. [2022-07-22 11:07:33,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 11:07:33,821 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2022-07-22 11:07:33,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:07:33,827 INFO L225 Difference]: With dead ends: 113 [2022-07-22 11:07:33,827 INFO L226 Difference]: Without dead ends: 59 [2022-07-22 11:07:33,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:07:33,832 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 16 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:07:33,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 161 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:07:33,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-22 11:07:33,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 50. [2022-07-22 11:07:33,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 42 states have internal predecessors, (59), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-22 11:07:33,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 70 transitions. [2022-07-22 11:07:33,891 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 70 transitions. Word has length 41 [2022-07-22 11:07:33,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:07:33,891 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 70 transitions. [2022-07-22 11:07:33,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-22 11:07:33,893 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 70 transitions. [2022-07-22 11:07:33,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-22 11:07:33,896 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:07:33,896 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:07:33,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-22 11:07:34,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 11:07:34,105 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:07:34,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:07:34,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1421820539, now seen corresponding path program 1 times [2022-07-22 11:07:34,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:07:34,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [778116275] [2022-07-22 11:07:34,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:07:34,107 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:07:34,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:07:34,108 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 11:07:34,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-22 11:07:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:07:34,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 11:07:34,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:07:34,186 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 11:07:34,187 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 11:07:34,187 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 11:07:34,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [778116275] [2022-07-22 11:07:34,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [778116275] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:07:34,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:07:34,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:07:34,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599059772] [2022-07-22 11:07:34,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:07:34,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:07:34,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 11:07:34,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:07:34,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:07:34,190 INFO L87 Difference]: Start difference. First operand 50 states and 70 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-22 11:07:34,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:07:34,269 INFO L93 Difference]: Finished difference Result 105 states and 150 transitions. [2022-07-22 11:07:34,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:07:34,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 44 [2022-07-22 11:07:34,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:07:34,271 INFO L225 Difference]: With dead ends: 105 [2022-07-22 11:07:34,271 INFO L226 Difference]: Without dead ends: 62 [2022-07-22 11:07:34,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:07:34,272 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 10 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:07:34,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 154 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:07:34,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-22 11:07:34,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2022-07-22 11:07:34,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 46 states have (on average 1.391304347826087) internal successors, (64), 47 states have internal predecessors, (64), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-22 11:07:34,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 77 transitions. [2022-07-22 11:07:34,280 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 77 transitions. Word has length 44 [2022-07-22 11:07:34,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:07:34,280 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 77 transitions. [2022-07-22 11:07:34,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-22 11:07:34,280 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 77 transitions. [2022-07-22 11:07:34,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-22 11:07:34,281 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:07:34,282 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:07:34,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-22 11:07:34,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 11:07:34,490 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:07:34,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:07:34,490 INFO L85 PathProgramCache]: Analyzing trace with hash -865634876, now seen corresponding path program 1 times [2022-07-22 11:07:34,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:07:34,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [343072603] [2022-07-22 11:07:34,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:07:34,491 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:07:34,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:07:34,492 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 11:07:34,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-22 11:07:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:07:34,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 11:07:34,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:07:34,574 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 11:07:34,574 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 11:07:34,574 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 11:07:34,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [343072603] [2022-07-22 11:07:34,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [343072603] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:07:34,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:07:34,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:07:34,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871473836] [2022-07-22 11:07:34,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:07:34,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:07:34,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 11:07:34,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:07:34,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:07:34,576 INFO L87 Difference]: Start difference. First operand 55 states and 77 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-22 11:07:34,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:07:34,646 INFO L93 Difference]: Finished difference Result 114 states and 162 transitions. [2022-07-22 11:07:34,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 11:07:34,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2022-07-22 11:07:34,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:07:34,651 INFO L225 Difference]: With dead ends: 114 [2022-07-22 11:07:34,651 INFO L226 Difference]: Without dead ends: 66 [2022-07-22 11:07:34,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:07:34,656 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 16 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:07:34,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 147 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:07:34,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-07-22 11:07:34,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2022-07-22 11:07:34,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 48 states have internal predecessors, (65), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-22 11:07:34,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 78 transitions. [2022-07-22 11:07:34,668 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 78 transitions. Word has length 45 [2022-07-22 11:07:34,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:07:34,669 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 78 transitions. [2022-07-22 11:07:34,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-22 11:07:34,669 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 78 transitions. [2022-07-22 11:07:34,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-22 11:07:34,670 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:07:34,670 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:07:34,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-22 11:07:34,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 11:07:34,872 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:07:34,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:07:34,872 INFO L85 PathProgramCache]: Analyzing trace with hash 155611130, now seen corresponding path program 1 times [2022-07-22 11:07:34,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:07:34,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1970689929] [2022-07-22 11:07:34,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:07:34,873 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:07:34,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:07:34,875 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 11:07:34,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-22 11:07:34,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:07:34,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 11:07:34,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:07:34,972 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 11:07:34,972 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 11:07:34,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 11:07:34,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1970689929] [2022-07-22 11:07:34,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1970689929] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:07:34,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:07:34,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 11:07:34,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151772653] [2022-07-22 11:07:34,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:07:34,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 11:07:34,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 11:07:34,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 11:07:34,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:07:34,974 INFO L87 Difference]: Start difference. First operand 56 states and 78 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-22 11:07:35,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:07:35,076 INFO L93 Difference]: Finished difference Result 122 states and 173 transitions. [2022-07-22 11:07:35,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 11:07:35,076 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2022-07-22 11:07:35,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:07:35,079 INFO L225 Difference]: With dead ends: 122 [2022-07-22 11:07:35,079 INFO L226 Difference]: Without dead ends: 73 [2022-07-22 11:07:35,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-22 11:07:35,087 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 19 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:07:35,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 194 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:07:35,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-22 11:07:35,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 57. [2022-07-22 11:07:35,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 49 states have internal predecessors, (67), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-22 11:07:35,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 80 transitions. [2022-07-22 11:07:35,101 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 80 transitions. Word has length 46 [2022-07-22 11:07:35,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:07:35,101 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 80 transitions. [2022-07-22 11:07:35,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-22 11:07:35,101 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions. [2022-07-22 11:07:35,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-22 11:07:35,102 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:07:35,102 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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] [2022-07-22 11:07:35,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-22 11:07:35,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 11:07:35,303 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:07:35,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:07:35,303 INFO L85 PathProgramCache]: Analyzing trace with hash 709732423, now seen corresponding path program 1 times [2022-07-22 11:07:35,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:07:35,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1799923778] [2022-07-22 11:07:35,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:07:35,304 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:07:35,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:07:35,305 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 11:07:35,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-22 11:07:35,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:07:35,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 11:07:35,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:07:35,405 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 11:07:35,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:07:35,520 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-22 11:07:35,521 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 11:07:35,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1799923778] [2022-07-22 11:07:35,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1799923778] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:07:35,521 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 11:07:35,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-22 11:07:35,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168304082] [2022-07-22 11:07:35,521 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 11:07:35,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 11:07:35,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 11:07:35,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 11:07:35,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-22 11:07:35,522 INFO L87 Difference]: Start difference. First operand 57 states and 80 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-22 11:07:35,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:07:35,666 INFO L93 Difference]: Finished difference Result 143 states and 205 transitions. [2022-07-22 11:07:35,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 11:07:35,666 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2022-07-22 11:07:35,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:07:35,667 INFO L225 Difference]: With dead ends: 143 [2022-07-22 11:07:35,667 INFO L226 Difference]: Without dead ends: 93 [2022-07-22 11:07:35,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2022-07-22 11:07:35,668 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 52 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:07:35,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 266 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:07:35,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-22 11:07:35,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 65. [2022-07-22 11:07:35,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 57 states have internal predecessors, (80), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-22 11:07:35,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 93 transitions. [2022-07-22 11:07:35,676 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 93 transitions. Word has length 47 [2022-07-22 11:07:35,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:07:35,676 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 93 transitions. [2022-07-22 11:07:35,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-22 11:07:35,676 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 93 transitions. [2022-07-22 11:07:35,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-22 11:07:35,677 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:07:35,678 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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] [2022-07-22 11:07:35,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-22 11:07:35,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 11:07:35,892 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:07:35,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:07:35,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1261268282, now seen corresponding path program 1 times [2022-07-22 11:07:35,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:07:35,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [385567971] [2022-07-22 11:07:35,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:07:35,893 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:07:35,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:07:35,894 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 11:07:35,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-22 11:07:35,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:07:35,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 11:07:35,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:07:35,975 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 11:07:35,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:07:36,101 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-22 11:07:36,101 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 11:07:36,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [385567971] [2022-07-22 11:07:36,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [385567971] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:07:36,102 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 11:07:36,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-07-22 11:07:36,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668235571] [2022-07-22 11:07:36,102 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 11:07:36,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 11:07:36,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 11:07:36,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 11:07:36,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-22 11:07:36,103 INFO L87 Difference]: Start difference. First operand 65 states and 93 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-22 11:07:36,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:07:36,322 INFO L93 Difference]: Finished difference Result 161 states and 233 transitions. [2022-07-22 11:07:36,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 11:07:36,323 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 49 [2022-07-22 11:07:36,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:07:36,324 INFO L225 Difference]: With dead ends: 161 [2022-07-22 11:07:36,324 INFO L226 Difference]: Without dead ends: 103 [2022-07-22 11:07:36,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2022-07-22 11:07:36,325 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 105 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:07:36,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 360 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:07:36,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-07-22 11:07:36,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 69. [2022-07-22 11:07:36,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 60 states have (on average 1.45) internal successors, (87), 61 states have internal predecessors, (87), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-22 11:07:36,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 100 transitions. [2022-07-22 11:07:36,337 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 100 transitions. Word has length 49 [2022-07-22 11:07:36,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:07:36,337 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 100 transitions. [2022-07-22 11:07:36,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-22 11:07:36,338 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 100 transitions. [2022-07-22 11:07:36,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-22 11:07:36,339 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:07:36,339 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:07:36,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-22 11:07:36,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 11:07:36,548 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:07:36,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:07:36,548 INFO L85 PathProgramCache]: Analyzing trace with hash 243604347, now seen corresponding path program 2 times [2022-07-22 11:07:36,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:07:36,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1219367589] [2022-07-22 11:07:36,548 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 11:07:36,548 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:07:36,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:07:36,549 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 11:07:36,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-22 11:07:36,579 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-22 11:07:36,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 11:07:36,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 11:07:36,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:07:36,615 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-22 11:07:36,615 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 11:07:36,615 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 11:07:36,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1219367589] [2022-07-22 11:07:36,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1219367589] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:07:36,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:07:36,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 11:07:36,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441610082] [2022-07-22 11:07:36,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:07:36,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 11:07:36,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 11:07:36,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 11:07:36,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 11:07:36,616 INFO L87 Difference]: Start difference. First operand 69 states and 100 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-22 11:07:36,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:07:36,650 INFO L93 Difference]: Finished difference Result 109 states and 158 transitions. [2022-07-22 11:07:36,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 11:07:36,651 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 56 [2022-07-22 11:07:36,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:07:36,652 INFO L225 Difference]: With dead ends: 109 [2022-07-22 11:07:36,652 INFO L226 Difference]: Without dead ends: 88 [2022-07-22 11:07:36,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-22 11:07:36,653 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 17 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:07:36,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 288 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:07:36,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-22 11:07:36,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 78. [2022-07-22 11:07:36,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 67 states have (on average 1.4029850746268657) internal successors, (94), 69 states have internal predecessors, (94), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-22 11:07:36,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 112 transitions. [2022-07-22 11:07:36,659 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 112 transitions. Word has length 56 [2022-07-22 11:07:36,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:07:36,659 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 112 transitions. [2022-07-22 11:07:36,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-22 11:07:36,659 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 112 transitions. [2022-07-22 11:07:36,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-22 11:07:36,660 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:07:36,660 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:07:36,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-22 11:07:36,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 11:07:36,866 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:07:36,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:07:36,867 INFO L85 PathProgramCache]: Analyzing trace with hash 944668925, now seen corresponding path program 1 times [2022-07-22 11:07:36,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:07:36,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1552572185] [2022-07-22 11:07:36,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:07:36,867 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:07:36,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:07:36,868 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 11:07:36,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-22 11:07:36,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:07:36,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 11:07:36,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:07:36,989 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 24 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 11:07:36,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:07:37,229 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-22 11:07:37,229 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 11:07:37,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1552572185] [2022-07-22 11:07:37,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1552572185] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:07:37,229 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 11:07:37,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-07-22 11:07:37,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722063829] [2022-07-22 11:07:37,229 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 11:07:37,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-22 11:07:37,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 11:07:37,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 11:07:37,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-22 11:07:37,235 INFO L87 Difference]: Start difference. First operand 78 states and 112 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-22 11:07:37,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:07:37,816 INFO L93 Difference]: Finished difference Result 220 states and 317 transitions. [2022-07-22 11:07:37,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-22 11:07:37,817 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 56 [2022-07-22 11:07:37,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:07:37,818 INFO L225 Difference]: With dead ends: 220 [2022-07-22 11:07:37,818 INFO L226 Difference]: Without dead ends: 149 [2022-07-22 11:07:37,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=323, Unknown=0, NotChecked=0, Total=506 [2022-07-22 11:07:37,819 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 182 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 11:07:37,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 529 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 11:07:37,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-07-22 11:07:37,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 92. [2022-07-22 11:07:37,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 81 states have (on average 1.4444444444444444) internal successors, (117), 83 states have internal predecessors, (117), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-22 11:07:37,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 135 transitions. [2022-07-22 11:07:37,829 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 135 transitions. Word has length 56 [2022-07-22 11:07:37,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:07:37,829 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 135 transitions. [2022-07-22 11:07:37,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-22 11:07:37,829 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 135 transitions. [2022-07-22 11:07:37,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-22 11:07:37,830 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:07:37,830 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:07:37,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-22 11:07:38,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 11:07:38,039 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:07:38,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:07:38,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1013596344, now seen corresponding path program 1 times [2022-07-22 11:07:38,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:07:38,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1886327243] [2022-07-22 11:07:38,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:07:38,039 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:07:38,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:07:38,040 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 11:07:38,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-22 11:07:38,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:07:38,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-22 11:07:38,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:07:38,174 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 24 proven. 45 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 11:07:38,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:07:38,385 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 4 proven. 53 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-22 11:07:38,385 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 11:07:38,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1886327243] [2022-07-22 11:07:38,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1886327243] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:07:38,385 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 11:07:38,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-07-22 11:07:38,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214347274] [2022-07-22 11:07:38,385 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 11:07:38,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-22 11:07:38,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 11:07:38,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-22 11:07:38,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2022-07-22 11:07:38,386 INFO L87 Difference]: Start difference. First operand 92 states and 135 transitions. Second operand has 18 states, 18 states have (on average 4.0) internal successors, (72), 18 states have internal predecessors, (72), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-22 11:07:38,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:07:38,936 INFO L93 Difference]: Finished difference Result 243 states and 355 transitions. [2022-07-22 11:07:38,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-22 11:07:38,937 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.0) internal successors, (72), 18 states have internal predecessors, (72), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 61 [2022-07-22 11:07:38,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:07:38,938 INFO L225 Difference]: With dead ends: 243 [2022-07-22 11:07:38,938 INFO L226 Difference]: Without dead ends: 158 [2022-07-22 11:07:38,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=354, Invalid=638, Unknown=0, NotChecked=0, Total=992 [2022-07-22 11:07:38,939 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 405 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 11:07:38,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 608 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 11:07:38,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-07-22 11:07:38,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 102. [2022-07-22 11:07:38,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 91 states have (on average 1.4725274725274726) internal successors, (134), 93 states have internal predecessors, (134), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-22 11:07:38,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 152 transitions. [2022-07-22 11:07:38,959 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 152 transitions. Word has length 61 [2022-07-22 11:07:38,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:07:38,960 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 152 transitions. [2022-07-22 11:07:38,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.0) internal successors, (72), 18 states have internal predecessors, (72), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-22 11:07:38,960 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 152 transitions. [2022-07-22 11:07:38,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-22 11:07:38,960 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:07:38,961 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:07:38,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-22 11:07:39,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 11:07:39,170 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:07:39,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:07:39,171 INFO L85 PathProgramCache]: Analyzing trace with hash -206571907, now seen corresponding path program 2 times [2022-07-22 11:07:39,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:07:39,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [978558436] [2022-07-22 11:07:39,171 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 11:07:39,171 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:07:39,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:07:39,177 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 11:07:39,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-22 11:07:39,208 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-22 11:07:39,208 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 11:07:39,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 11:07:39,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:07:39,215 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2022-07-22 11:07:39,215 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 11:07:39,215 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 11:07:39,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [978558436] [2022-07-22 11:07:39,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [978558436] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:07:39,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:07:39,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:07:39,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297096016] [2022-07-22 11:07:39,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:07:39,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:07:39,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 11:07:39,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:07:39,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:07:39,216 INFO L87 Difference]: Start difference. First operand 102 states and 152 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-22 11:07:39,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:07:39,223 INFO L93 Difference]: Finished difference Result 111 states and 162 transitions. [2022-07-22 11:07:39,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:07:39,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 74 [2022-07-22 11:07:39,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:07:39,224 INFO L225 Difference]: With dead ends: 111 [2022-07-22 11:07:39,224 INFO L226 Difference]: Without dead ends: 102 [2022-07-22 11:07:39,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:07:39,225 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:07:39,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:07:39,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-22 11:07:39,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-07-22 11:07:39,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 91 states have (on average 1.4615384615384615) internal successors, (133), 93 states have internal predecessors, (133), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-22 11:07:39,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 151 transitions. [2022-07-22 11:07:39,231 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 151 transitions. Word has length 74 [2022-07-22 11:07:39,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:07:39,231 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 151 transitions. [2022-07-22 11:07:39,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-22 11:07:39,231 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 151 transitions. [2022-07-22 11:07:39,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-22 11:07:39,232 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:07:39,232 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:07:39,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-07-22 11:07:39,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 11:07:39,438 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:07:39,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:07:39,438 INFO L85 PathProgramCache]: Analyzing trace with hash -138085853, now seen corresponding path program 1 times [2022-07-22 11:07:39,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:07:39,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1456708013] [2022-07-22 11:07:39,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:07:39,439 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:07:39,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:07:39,440 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 11:07:39,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-22 11:07:39,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:07:39,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-22 11:07:39,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:07:39,696 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 24 proven. 155 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 11:07:39,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:07:40,401 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 4 proven. 163 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-22 11:07:40,402 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 11:07:40,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1456708013] [2022-07-22 11:07:40,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1456708013] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:07:40,402 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 11:07:40,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-07-22 11:07:40,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641688414] [2022-07-22 11:07:40,402 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 11:07:40,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-22 11:07:40,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 11:07:40,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-22 11:07:40,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-07-22 11:07:40,403 INFO L87 Difference]: Start difference. First operand 102 states and 151 transitions. Second operand has 26 states, 26 states have (on average 3.8461538461538463) internal successors, (100), 26 states have internal predecessors, (100), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-22 11:07:43,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:07:43,130 INFO L93 Difference]: Finished difference Result 346 states and 503 transitions. [2022-07-22 11:07:43,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-22 11:07:43,131 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.8461538461538463) internal successors, (100), 26 states have internal predecessors, (100), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 76 [2022-07-22 11:07:43,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:07:43,132 INFO L225 Difference]: With dead ends: 346 [2022-07-22 11:07:43,132 INFO L226 Difference]: Without dead ends: 251 [2022-07-22 11:07:43,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=729, Invalid=1433, Unknown=0, NotChecked=0, Total=2162 [2022-07-22 11:07:43,133 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 622 mSDsluCounter, 1462 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 1586 SdHoareTripleChecker+Invalid, 1236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:07:43,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 1586 Invalid, 1236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-22 11:07:43,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-07-22 11:07:43,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 128. [2022-07-22 11:07:43,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 117 states have (on average 1.5042735042735043) internal successors, (176), 119 states have internal predecessors, (176), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-22 11:07:43,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 194 transitions. [2022-07-22 11:07:43,148 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 194 transitions. Word has length 76 [2022-07-22 11:07:43,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:07:43,148 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 194 transitions. [2022-07-22 11:07:43,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.8461538461538463) internal successors, (100), 26 states have internal predecessors, (100), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-22 11:07:43,148 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 194 transitions. [2022-07-22 11:07:43,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-22 11:07:43,149 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:07:43,149 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:07:43,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-22 11:07:43,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 11:07:43,349 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:07:43,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:07:43,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1709984302, now seen corresponding path program 1 times [2022-07-22 11:07:43,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:07:43,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1820866758] [2022-07-22 11:07:43,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:07:43,350 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:07:43,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:07:43,352 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 11:07:43,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-22 11:07:43,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:07:43,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-22 11:07:43,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:07:43,662 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 24 proven. 273 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 11:07:43,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:07:44,282 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 4 proven. 281 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-22 11:07:44,283 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 11:07:44,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1820866758] [2022-07-22 11:07:44,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1820866758] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:07:44,283 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 11:07:44,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2022-07-22 11:07:44,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976872823] [2022-07-22 11:07:44,283 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 11:07:44,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-22 11:07:44,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 11:07:44,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-22 11:07:44,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2022-07-22 11:07:44,284 INFO L87 Difference]: Start difference. First operand 128 states and 194 transitions. Second operand has 34 states, 34 states have (on average 3.588235294117647) internal successors, (122), 34 states have internal predecessors, (122), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-22 11:07:45,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:07:45,724 INFO L93 Difference]: Finished difference Result 347 states and 509 transitions. [2022-07-22 11:07:45,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-22 11:07:45,724 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.588235294117647) internal successors, (122), 34 states have internal predecessors, (122), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 87 [2022-07-22 11:07:45,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:07:45,725 INFO L225 Difference]: With dead ends: 347 [2022-07-22 11:07:45,726 INFO L226 Difference]: Without dead ends: 226 [2022-07-22 11:07:45,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=991, Invalid=2315, Unknown=0, NotChecked=0, Total=3306 [2022-07-22 11:07:45,727 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 1066 mSDsluCounter, 1605 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1066 SdHoareTripleChecker+Valid, 1682 SdHoareTripleChecker+Invalid, 1453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-22 11:07:45,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1066 Valid, 1682 Invalid, 1453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 1236 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-22 11:07:45,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-07-22 11:07:45,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 132. [2022-07-22 11:07:45,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 121 states have (on average 1.512396694214876) internal successors, (183), 123 states have internal predecessors, (183), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-22 11:07:45,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 201 transitions. [2022-07-22 11:07:45,736 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 201 transitions. Word has length 87 [2022-07-22 11:07:45,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:07:45,737 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 201 transitions. [2022-07-22 11:07:45,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.588235294117647) internal successors, (122), 34 states have internal predecessors, (122), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-22 11:07:45,737 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 201 transitions. [2022-07-22 11:07:45,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-22 11:07:45,738 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:07:45,738 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 22, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:07:45,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-22 11:07:45,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 11:07:45,945 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:07:45,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:07:45,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1989016285, now seen corresponding path program 2 times [2022-07-22 11:07:45,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:07:45,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [67031129] [2022-07-22 11:07:45,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 11:07:45,946 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:07:45,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:07:45,948 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 11:07:45,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-22 11:07:45,984 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-22 11:07:45,984 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 11:07:45,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 11:07:45,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:07:46,001 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 767 trivial. 0 not checked. [2022-07-22 11:07:46,002 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 11:07:46,002 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 11:07:46,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [67031129] [2022-07-22 11:07:46,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [67031129] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:07:46,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:07:46,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:07:46,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889520331] [2022-07-22 11:07:46,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:07:46,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:07:46,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 11:07:46,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:07:46,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:07:46,004 INFO L87 Difference]: Start difference. First operand 132 states and 201 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-22 11:07:46,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:07:46,030 INFO L93 Difference]: Finished difference Result 169 states and 251 transitions. [2022-07-22 11:07:46,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:07:46,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 112 [2022-07-22 11:07:46,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:07:46,032 INFO L225 Difference]: With dead ends: 169 [2022-07-22 11:07:46,032 INFO L226 Difference]: Without dead ends: 159 [2022-07-22 11:07:46,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:07:46,033 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 44 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:07:46,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 199 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:07:46,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-07-22 11:07:46,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 137. [2022-07-22 11:07:46,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 126 states have (on average 1.5) internal successors, (189), 128 states have internal predecessors, (189), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-22 11:07:46,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 207 transitions. [2022-07-22 11:07:46,046 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 207 transitions. Word has length 112 [2022-07-22 11:07:46,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:07:46,046 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 207 transitions. [2022-07-22 11:07:46,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-22 11:07:46,046 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 207 transitions. [2022-07-22 11:07:46,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-22 11:07:46,047 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:07:46,047 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 22, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:07:46,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-22 11:07:46,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 11:07:46,253 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:07:46,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:07:46,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1496604385, now seen corresponding path program 1 times [2022-07-22 11:07:46,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:07:46,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1097593931] [2022-07-22 11:07:46,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:07:46,254 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:07:46,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:07:46,255 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 11:07:46,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-22 11:07:46,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:07:46,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-22 11:07:46,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:07:46,951 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 24 proven. 737 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 11:07:46,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:07:49,160 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 4 proven. 745 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-22 11:07:49,160 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 11:07:49,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1097593931] [2022-07-22 11:07:49,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1097593931] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:07:49,160 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 11:07:49,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-07-22 11:07:49,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718573403] [2022-07-22 11:07:49,160 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 11:07:49,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-22 11:07:49,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 11:07:49,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-22 11:07:49,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=673, Invalid=1777, Unknown=0, NotChecked=0, Total=2450 [2022-07-22 11:07:49,162 INFO L87 Difference]: Start difference. First operand 137 states and 207 transitions. Second operand has 50 states, 50 states have (on average 3.44) internal successors, (172), 50 states have internal predecessors, (172), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-22 11:08:04,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:08:04,383 INFO L93 Difference]: Finished difference Result 590 states and 867 transitions. [2022-07-22 11:08:04,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-07-22 11:08:04,383 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.44) internal successors, (172), 50 states have internal predecessors, (172), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 112 [2022-07-22 11:08:04,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:08:04,385 INFO L225 Difference]: With dead ends: 590 [2022-07-22 11:08:04,386 INFO L226 Difference]: Without dead ends: 460 [2022-07-22 11:08:04,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1452 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=2901, Invalid=6029, Unknown=0, NotChecked=0, Total=8930 [2022-07-22 11:08:04,388 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 2282 mSDsluCounter, 4896 mSDsCounter, 0 mSdLazyCounter, 4441 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2282 SdHoareTripleChecker+Valid, 5104 SdHoareTripleChecker+Invalid, 4786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 4441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-22 11:08:04,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2282 Valid, 5104 Invalid, 4786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 4441 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-07-22 11:08:04,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2022-07-22 11:08:04,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 205. [2022-07-22 11:08:04,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 194 states have (on average 1.556701030927835) internal successors, (302), 196 states have internal predecessors, (302), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-22 11:08:04,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 320 transitions. [2022-07-22 11:08:04,405 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 320 transitions. Word has length 112 [2022-07-22 11:08:04,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:08:04,405 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 320 transitions. [2022-07-22 11:08:04,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.44) internal successors, (172), 50 states have internal predecessors, (172), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-22 11:08:04,405 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 320 transitions. [2022-07-22 11:08:04,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-22 11:08:04,406 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:08:04,406 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:08:04,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-22 11:08:04,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 11:08:04,614 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:08:04,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:08:04,614 INFO L85 PathProgramCache]: Analyzing trace with hash 746014060, now seen corresponding path program 1 times [2022-07-22 11:08:04,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:08:04,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [877622093] [2022-07-22 11:08:04,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:08:04,615 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:08:04,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:08:04,617 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 11:08:04,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-22 11:08:04,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:08:04,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 63 conjunts are in the unsatisfiable core [2022-07-22 11:08:04,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:08:06,311 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 10 proven. 836 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-22 11:08:06,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:08:09,943 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 10 proven. 836 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-22 11:08:09,943 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 11:08:09,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [877622093] [2022-07-22 11:08:09,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [877622093] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:08:09,943 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 11:08:09,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 66 [2022-07-22 11:08:09,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142413379] [2022-07-22 11:08:09,944 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 11:08:09,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-07-22 11:08:09,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 11:08:09,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-07-22 11:08:09,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=766, Invalid=3524, Unknown=0, NotChecked=0, Total=4290 [2022-07-22 11:08:09,947 INFO L87 Difference]: Start difference. First operand 205 states and 320 transitions. Second operand has 66 states, 66 states have (on average 2.8636363636363638) internal successors, (189), 62 states have internal predecessors, (189), 4 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 3 states have call successors, (7)