./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/byte_add_2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 574ddb4e 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/byte_add_2-2.i -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 de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-17 05:41:43,720 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 05:41:43,724 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 05:41:43,750 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 05:41:43,750 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 05:41:43,753 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 05:41:43,755 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 05:41:43,758 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 05:41:43,760 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 05:41:43,764 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 05:41:43,765 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 05:41:43,767 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 05:41:43,767 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 05:41:43,771 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 05:41:43,773 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 05:41:43,775 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 05:41:43,776 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 05:41:43,777 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 05:41:43,779 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 05:41:43,783 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 05:41:43,785 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 05:41:43,785 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 05:41:43,787 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 05:41:43,788 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 05:41:43,796 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 05:41:43,796 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 05:41:43,797 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 05:41:43,799 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 05:41:43,799 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 05:41:43,800 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 05:41:43,800 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 05:41:43,801 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 05:41:43,802 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 05:41:43,803 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 05:41:43,804 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 05:41:43,804 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 05:41:43,805 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 05:41:43,805 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 05:41:43,805 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 05:41:43,806 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 05:41:43,807 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 05:41:43,808 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 05:41:43,844 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 05:41:43,845 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 05:41:43,845 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 05:41:43,845 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 05:41:43,846 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 05:41:43,846 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 05:41:43,847 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 05:41:43,847 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 05:41:43,847 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 05:41:43,848 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 05:41:43,848 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 05:41:43,849 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 05:41:43,849 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 05:41:43,849 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 05:41:43,849 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 05:41:43,849 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 05:41:43,849 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 05:41:43,850 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 05:41:43,850 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 05:41:43,850 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 05:41:43,850 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 05:41:43,850 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 05:41:43,851 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 05:41:43,851 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 05:41:43,851 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 05:41:43,851 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 05:41:43,851 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 05:41:43,852 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 05:41:43,852 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 05:41:43,852 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 05:41:43,853 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 05:41:43,853 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 05:41:43,853 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 05:41:43,853 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 05:41:43,854 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 05:41:43,854 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba [2023-02-17 05:41:44,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 05:41:44,142 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 05:41:44,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 05:41:44,145 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 05:41:44,146 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 05:41:44,147 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_2-2.i [2023-02-17 05:41:45,336 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 05:41:45,522 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 05:41:45,523 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i [2023-02-17 05:41:45,531 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96dd5958a/c7807bbafa2947baa66eaa5b87be9d0d/FLAGf89fc5dfd [2023-02-17 05:41:45,558 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96dd5958a/c7807bbafa2947baa66eaa5b87be9d0d [2023-02-17 05:41:45,560 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 05:41:45,562 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 05:41:45,565 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 05:41:45,565 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 05:41:45,568 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 05:41:45,569 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 05:41:45" (1/1) ... [2023-02-17 05:41:45,570 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@651f5462 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:41:45, skipping insertion in model container [2023-02-17 05:41:45,570 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 05:41:45" (1/1) ... [2023-02-17 05:41:45,577 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 05:41:45,607 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 05:41:45,742 WARN L237 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/byte_add_2-2.i[1168,1181] [2023-02-17 05:41:45,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 05:41:45,805 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 05:41:45,819 WARN L237 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/byte_add_2-2.i[1168,1181] [2023-02-17 05:41:45,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 05:41:45,849 INFO L208 MainTranslator]: Completed translation [2023-02-17 05:41:45,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:41:45 WrapperNode [2023-02-17 05:41:45,850 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 05:41:45,851 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 05:41:45,851 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 05:41:45,851 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 05:41:45,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:41:45" (1/1) ... [2023-02-17 05:41:45,873 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:41:45" (1/1) ... [2023-02-17 05:41:45,904 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 141 [2023-02-17 05:41:45,905 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 05:41:45,906 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 05:41:45,906 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 05:41:45,906 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 05:41:45,915 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:41:45" (1/1) ... [2023-02-17 05:41:45,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:41:45" (1/1) ... [2023-02-17 05:41:45,918 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:41:45" (1/1) ... [2023-02-17 05:41:45,918 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:41:45" (1/1) ... [2023-02-17 05:41:45,929 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:41:45" (1/1) ... [2023-02-17 05:41:45,933 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:41:45" (1/1) ... [2023-02-17 05:41:45,936 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:41:45" (1/1) ... [2023-02-17 05:41:45,938 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:41:45" (1/1) ... [2023-02-17 05:41:45,947 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 05:41:45,948 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 05:41:45,948 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 05:41:45,948 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 05:41:45,949 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:41:45" (1/1) ... [2023-02-17 05:41:45,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 05:41:45,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 05:41:45,983 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) [2023-02-17 05:41:45,993 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 [2023-02-17 05:41:46,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 05:41:46,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 05:41:46,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 05:41:46,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 05:41:46,094 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 05:41:46,097 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 05:41:46,493 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 05:41:46,499 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 05:41:46,499 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-17 05:41:46,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 05:41:46 BoogieIcfgContainer [2023-02-17 05:41:46,501 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 05:41:46,503 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 05:41:46,503 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 05:41:46,505 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 05:41:46,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 05:41:45" (1/3) ... [2023-02-17 05:41:46,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72f70853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 05:41:46, skipping insertion in model container [2023-02-17 05:41:46,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:41:45" (2/3) ... [2023-02-17 05:41:46,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72f70853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 05:41:46, skipping insertion in model container [2023-02-17 05:41:46,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 05:41:46" (3/3) ... [2023-02-17 05:41:46,508 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_2-2.i [2023-02-17 05:41:46,526 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 05:41:46,526 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 05:41:46,583 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 05:41:46,590 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7dbd9d9d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 05:41:46,590 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 05:41:46,595 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 45 states have (on average 1.7777777777777777) internal successors, (80), 46 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:46,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-17 05:41:46,601 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:41:46,602 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:41:46,603 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:41:46,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:41:46,609 INFO L85 PathProgramCache]: Analyzing trace with hash 903950584, now seen corresponding path program 1 times [2023-02-17 05:41:46,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:41:46,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466110199] [2023-02-17 05:41:46,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:41:46,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:41:46,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:41:46,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:41:46,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:41:46,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466110199] [2023-02-17 05:41:46,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466110199] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:41:46,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:41:46,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 05:41:46,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305135871] [2023-02-17 05:41:46,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:41:46,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 05:41:46,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:41:46,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 05:41:46,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 05:41:46,916 INFO L87 Difference]: Start difference. First operand has 47 states, 45 states have (on average 1.7777777777777777) internal successors, (80), 46 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:46,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:41:46,940 INFO L93 Difference]: Finished difference Result 64 states and 105 transitions. [2023-02-17 05:41:46,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 05:41:46,943 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-17 05:41:46,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:41:46,951 INFO L225 Difference]: With dead ends: 64 [2023-02-17 05:41:46,951 INFO L226 Difference]: Without dead ends: 43 [2023-02-17 05:41:46,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 05:41:46,959 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 05:41:46,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 05:41:46,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-02-17 05:41:46,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-02-17 05:41:46,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.7380952380952381) internal successors, (73), 42 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:46,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 73 transitions. [2023-02-17 05:41:46,994 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 73 transitions. Word has length 13 [2023-02-17 05:41:46,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:41:46,995 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 73 transitions. [2023-02-17 05:41:46,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:46,996 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 73 transitions. [2023-02-17 05:41:46,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-17 05:41:46,998 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:41:46,998 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:41:46,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 05:41:46,998 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:41:46,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:41:46,999 INFO L85 PathProgramCache]: Analyzing trace with hash 430337229, now seen corresponding path program 1 times [2023-02-17 05:41:47,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:41:47,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717313254] [2023-02-17 05:41:47,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:41:47,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:41:47,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:41:47,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:41:47,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:41:47,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717313254] [2023-02-17 05:41:47,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717313254] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:41:47,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:41:47,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 05:41:47,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993000748] [2023-02-17 05:41:47,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:41:47,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 05:41:47,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:41:47,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 05:41:47,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:41:47,234 INFO L87 Difference]: Start difference. First operand 43 states and 73 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:47,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:41:47,368 INFO L93 Difference]: Finished difference Result 102 states and 179 transitions. [2023-02-17 05:41:47,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 05:41:47,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-17 05:41:47,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:41:47,370 INFO L225 Difference]: With dead ends: 102 [2023-02-17 05:41:47,370 INFO L226 Difference]: Without dead ends: 69 [2023-02-17 05:41:47,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:41:47,372 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 29 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:41:47,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 77 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 05:41:47,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-02-17 05:41:47,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2023-02-17 05:41:47,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.5606060606060606) internal successors, (103), 66 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:47,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 103 transitions. [2023-02-17 05:41:47,380 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 103 transitions. Word has length 13 [2023-02-17 05:41:47,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:41:47,380 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 103 transitions. [2023-02-17 05:41:47,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:47,381 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 103 transitions. [2023-02-17 05:41:47,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-17 05:41:47,382 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:41:47,382 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:41:47,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-17 05:41:47,383 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:41:47,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:41:47,383 INFO L85 PathProgramCache]: Analyzing trace with hash -2037878536, now seen corresponding path program 1 times [2023-02-17 05:41:47,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:41:47,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054910783] [2023-02-17 05:41:47,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:41:47,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:41:47,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:41:47,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:41:47,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:41:47,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054910783] [2023-02-17 05:41:47,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054910783] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:41:47,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:41:47,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 05:41:47,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431221712] [2023-02-17 05:41:47,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:41:47,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 05:41:47,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:41:47,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 05:41:47,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 05:41:47,516 INFO L87 Difference]: Start difference. First operand 67 states and 103 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:47,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:41:47,814 INFO L93 Difference]: Finished difference Result 168 states and 287 transitions. [2023-02-17 05:41:47,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 05:41:47,814 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-02-17 05:41:47,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:41:47,815 INFO L225 Difference]: With dead ends: 168 [2023-02-17 05:41:47,816 INFO L226 Difference]: Without dead ends: 135 [2023-02-17 05:41:47,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 05:41:47,817 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 112 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 05:41:47,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 105 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 05:41:47,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-02-17 05:41:47,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 93. [2023-02-17 05:41:47,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.5543478260869565) internal successors, (143), 92 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:47,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 143 transitions. [2023-02-17 05:41:47,828 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 143 transitions. Word has length 19 [2023-02-17 05:41:47,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:41:47,828 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 143 transitions. [2023-02-17 05:41:47,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:47,829 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 143 transitions. [2023-02-17 05:41:47,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-17 05:41:47,830 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:41:47,830 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:41:47,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-17 05:41:47,831 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:41:47,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:41:47,831 INFO L85 PathProgramCache]: Analyzing trace with hash -21369817, now seen corresponding path program 1 times [2023-02-17 05:41:47,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:41:47,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954290413] [2023-02-17 05:41:47,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:41:47,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:41:47,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:41:47,955 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-17 05:41:47,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:41:47,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954290413] [2023-02-17 05:41:47,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954290413] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:41:47,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:41:47,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 05:41:47,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934906320] [2023-02-17 05:41:47,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:41:47,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 05:41:47,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:41:47,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 05:41:47,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 05:41:47,961 INFO L87 Difference]: Start difference. First operand 93 states and 143 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:48,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:41:48,136 INFO L93 Difference]: Finished difference Result 272 states and 412 transitions. [2023-02-17 05:41:48,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 05:41:48,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-02-17 05:41:48,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:41:48,142 INFO L225 Difference]: With dead ends: 272 [2023-02-17 05:41:48,142 INFO L226 Difference]: Without dead ends: 192 [2023-02-17 05:41:48,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 05:41:48,151 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 105 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:41:48,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 201 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 05:41:48,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2023-02-17 05:41:48,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 101. [2023-02-17 05:41:48,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.52) internal successors, (152), 100 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:48,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 152 transitions. [2023-02-17 05:41:48,163 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 152 transitions. Word has length 25 [2023-02-17 05:41:48,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:41:48,163 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 152 transitions. [2023-02-17 05:41:48,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:48,164 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 152 transitions. [2023-02-17 05:41:48,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-17 05:41:48,169 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:41:48,169 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:41:48,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-17 05:41:48,169 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:41:48,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:41:48,171 INFO L85 PathProgramCache]: Analyzing trace with hash -53067146, now seen corresponding path program 1 times [2023-02-17 05:41:48,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:41:48,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468718143] [2023-02-17 05:41:48,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:41:48,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:41:48,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:41:48,318 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-17 05:41:48,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:41:48,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468718143] [2023-02-17 05:41:48,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468718143] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:41:48,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:41:48,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 05:41:48,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208523249] [2023-02-17 05:41:48,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:41:48,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 05:41:48,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:41:48,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 05:41:48,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:41:48,321 INFO L87 Difference]: Start difference. First operand 101 states and 152 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:48,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:41:48,333 INFO L93 Difference]: Finished difference Result 179 states and 272 transitions. [2023-02-17 05:41:48,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 05:41:48,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-02-17 05:41:48,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:41:48,334 INFO L225 Difference]: With dead ends: 179 [2023-02-17 05:41:48,334 INFO L226 Difference]: Without dead ends: 93 [2023-02-17 05:41:48,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:41:48,336 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 64 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 05:41:48,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 67 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 05:41:48,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-02-17 05:41:48,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2023-02-17 05:41:48,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.5108695652173914) internal successors, (139), 92 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:48,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 139 transitions. [2023-02-17 05:41:48,351 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 139 transitions. Word has length 26 [2023-02-17 05:41:48,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:41:48,351 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 139 transitions. [2023-02-17 05:41:48,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:48,352 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 139 transitions. [2023-02-17 05:41:48,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-17 05:41:48,353 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:41:48,353 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:41:48,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-17 05:41:48,353 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:41:48,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:41:48,354 INFO L85 PathProgramCache]: Analyzing trace with hash -350554629, now seen corresponding path program 1 times [2023-02-17 05:41:48,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:41:48,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18843132] [2023-02-17 05:41:48,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:41:48,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:41:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:41:48,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 05:41:48,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:41:48,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18843132] [2023-02-17 05:41:48,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18843132] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:41:48,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:41:48,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 05:41:48,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281201068] [2023-02-17 05:41:48,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:41:48,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 05:41:48,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:41:48,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 05:41:48,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 05:41:48,500 INFO L87 Difference]: Start difference. First operand 93 states and 139 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:48,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:41:48,641 INFO L93 Difference]: Finished difference Result 273 states and 407 transitions. [2023-02-17 05:41:48,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 05:41:48,641 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-02-17 05:41:48,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:41:48,643 INFO L225 Difference]: With dead ends: 273 [2023-02-17 05:41:48,643 INFO L226 Difference]: Without dead ends: 194 [2023-02-17 05:41:48,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 05:41:48,646 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 102 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:41:48,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 195 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 05:41:48,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-02-17 05:41:48,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 98. [2023-02-17 05:41:48,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.4845360824742269) internal successors, (144), 97 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:48,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 144 transitions. [2023-02-17 05:41:48,659 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 144 transitions. Word has length 32 [2023-02-17 05:41:48,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:41:48,660 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 144 transitions. [2023-02-17 05:41:48,660 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:48,660 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 144 transitions. [2023-02-17 05:41:48,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-17 05:41:48,662 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:41:48,662 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:41:48,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-17 05:41:48,663 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:41:48,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:41:48,663 INFO L85 PathProgramCache]: Analyzing trace with hash -143141955, now seen corresponding path program 1 times [2023-02-17 05:41:48,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:41:48,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075812826] [2023-02-17 05:41:48,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:41:48,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:41:48,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:41:48,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 05:41:48,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:41:48,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075812826] [2023-02-17 05:41:48,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075812826] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:41:48,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:41:48,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 05:41:48,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548295753] [2023-02-17 05:41:48,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:41:48,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 05:41:48,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:41:48,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 05:41:48,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 05:41:48,765 INFO L87 Difference]: Start difference. First operand 98 states and 144 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:48,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:41:48,954 INFO L93 Difference]: Finished difference Result 274 states and 429 transitions. [2023-02-17 05:41:48,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 05:41:48,955 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-02-17 05:41:48,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:41:48,956 INFO L225 Difference]: With dead ends: 274 [2023-02-17 05:41:48,956 INFO L226 Difference]: Without dead ends: 196 [2023-02-17 05:41:48,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 05:41:48,959 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 116 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 05:41:48,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 86 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 05:41:48,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2023-02-17 05:41:48,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 137. [2023-02-17 05:41:48,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 1.536764705882353) internal successors, (209), 136 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:48,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 209 transitions. [2023-02-17 05:41:48,978 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 209 transitions. Word has length 33 [2023-02-17 05:41:48,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:41:48,979 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 209 transitions. [2023-02-17 05:41:48,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:48,979 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 209 transitions. [2023-02-17 05:41:48,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-17 05:41:48,983 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:41:48,983 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-17 05:41:48,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-17 05:41:48,984 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:41:48,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:41:48,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1481468776, now seen corresponding path program 1 times [2023-02-17 05:41:48,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:41:48,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349283160] [2023-02-17 05:41:48,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:41:48,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:41:49,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:41:49,190 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 05:41:49,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:41:49,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349283160] [2023-02-17 05:41:49,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349283160] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 05:41:49,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828594700] [2023-02-17 05:41:49,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:41:49,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:41:49,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 05:41:49,201 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) [2023-02-17 05:41:49,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-17 05:41:49,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:41:49,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 05:41:49,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:41:49,363 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-17 05:41:49,364 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 05:41:49,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828594700] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:41:49,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 05:41:49,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-02-17 05:41:49,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081160281] [2023-02-17 05:41:49,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:41:49,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 05:41:49,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:41:49,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 05:41:49,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-17 05:41:49,367 INFO L87 Difference]: Start difference. First operand 137 states and 209 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:49,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:41:49,427 INFO L93 Difference]: Finished difference Result 275 states and 432 transitions. [2023-02-17 05:41:49,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 05:41:49,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-02-17 05:41:49,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:41:49,429 INFO L225 Difference]: With dead ends: 275 [2023-02-17 05:41:49,429 INFO L226 Difference]: Without dead ends: 151 [2023-02-17 05:41:49,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-02-17 05:41:49,430 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 55 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:41:49,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 82 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 05:41:49,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-02-17 05:41:49,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 131. [2023-02-17 05:41:49,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.5307692307692307) internal successors, (199), 130 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:49,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 199 transitions. [2023-02-17 05:41:49,438 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 199 transitions. Word has length 39 [2023-02-17 05:41:49,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:41:49,439 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 199 transitions. [2023-02-17 05:41:49,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:49,439 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 199 transitions. [2023-02-17 05:41:49,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-17 05:41:49,440 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:41:49,440 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:41:49,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-17 05:41:49,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:41:49,648 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:41:49,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:41:49,648 INFO L85 PathProgramCache]: Analyzing trace with hash -115920210, now seen corresponding path program 1 times [2023-02-17 05:41:49,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:41:49,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438451750] [2023-02-17 05:41:49,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:41:49,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:41:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:41:49,831 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-02-17 05:41:49,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:41:49,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438451750] [2023-02-17 05:41:49,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438451750] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:41:49,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:41:49,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 05:41:49,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512311999] [2023-02-17 05:41:49,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:41:49,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 05:41:49,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:41:49,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 05:41:49,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 05:41:49,834 INFO L87 Difference]: Start difference. First operand 131 states and 199 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:49,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:41:49,970 INFO L93 Difference]: Finished difference Result 389 states and 601 transitions. [2023-02-17 05:41:49,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 05:41:49,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2023-02-17 05:41:49,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:41:49,972 INFO L225 Difference]: With dead ends: 389 [2023-02-17 05:41:49,972 INFO L226 Difference]: Without dead ends: 273 [2023-02-17 05:41:49,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 05:41:49,973 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 100 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:41:49,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 82 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 05:41:49,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2023-02-17 05:41:49,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 172. [2023-02-17 05:41:49,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 1.5789473684210527) internal successors, (270), 171 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:49,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 270 transitions. [2023-02-17 05:41:49,980 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 270 transitions. Word has length 53 [2023-02-17 05:41:49,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:41:49,980 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 270 transitions. [2023-02-17 05:41:49,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:49,981 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 270 transitions. [2023-02-17 05:41:49,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-02-17 05:41:49,981 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:41:49,982 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:41:49,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-17 05:41:49,982 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:41:49,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:41:49,983 INFO L85 PathProgramCache]: Analyzing trace with hash 380800779, now seen corresponding path program 1 times [2023-02-17 05:41:49,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:41:49,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48963214] [2023-02-17 05:41:49,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:41:49,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:41:50,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:41:50,121 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-02-17 05:41:50,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:41:50,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48963214] [2023-02-17 05:41:50,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48963214] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:41:50,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:41:50,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 05:41:50,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957473112] [2023-02-17 05:41:50,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:41:50,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 05:41:50,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:41:50,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 05:41:50,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 05:41:50,123 INFO L87 Difference]: Start difference. First operand 172 states and 270 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:50,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:41:50,346 INFO L93 Difference]: Finished difference Result 681 states and 1068 transitions. [2023-02-17 05:41:50,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 05:41:50,346 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2023-02-17 05:41:50,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:41:50,349 INFO L225 Difference]: With dead ends: 681 [2023-02-17 05:41:50,349 INFO L226 Difference]: Without dead ends: 525 [2023-02-17 05:41:50,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-17 05:41:50,350 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 187 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 05:41:50,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 312 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 05:41:50,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2023-02-17 05:41:50,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 172. [2023-02-17 05:41:50,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 1.5789473684210527) internal successors, (270), 171 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:50,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 270 transitions. [2023-02-17 05:41:50,359 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 270 transitions. Word has length 66 [2023-02-17 05:41:50,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:41:50,359 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 270 transitions. [2023-02-17 05:41:50,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:50,360 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 270 transitions. [2023-02-17 05:41:50,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-02-17 05:41:50,360 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:41:50,360 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:41:50,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-17 05:41:50,361 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:41:50,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:41:50,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1313996354, now seen corresponding path program 1 times [2023-02-17 05:41:50,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:41:50,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601173090] [2023-02-17 05:41:50,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:41:50,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:41:50,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:41:50,598 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-02-17 05:41:50,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:41:50,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601173090] [2023-02-17 05:41:50,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601173090] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:41:50,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:41:50,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-17 05:41:50,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409042140] [2023-02-17 05:41:50,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:41:50,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 05:41:50,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:41:50,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 05:41:50,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-17 05:41:50,601 INFO L87 Difference]: Start difference. First operand 172 states and 270 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:51,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:41:51,037 INFO L93 Difference]: Finished difference Result 877 states and 1364 transitions. [2023-02-17 05:41:51,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 05:41:51,038 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2023-02-17 05:41:51,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:41:51,040 INFO L225 Difference]: With dead ends: 877 [2023-02-17 05:41:51,040 INFO L226 Difference]: Without dead ends: 721 [2023-02-17 05:41:51,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-02-17 05:41:51,041 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 377 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 05:41:51,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 602 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 05:41:51,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2023-02-17 05:41:51,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 167. [2023-02-17 05:41:51,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 166 states have (on average 1.5903614457831325) internal successors, (264), 166 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:51,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 264 transitions. [2023-02-17 05:41:51,051 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 264 transitions. Word has length 67 [2023-02-17 05:41:51,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:41:51,051 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 264 transitions. [2023-02-17 05:41:51,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:51,052 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 264 transitions. [2023-02-17 05:41:51,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-02-17 05:41:51,052 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:41:51,053 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-02-17 05:41:51,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-17 05:41:51,053 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:41:51,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:41:51,053 INFO L85 PathProgramCache]: Analyzing trace with hash -725391719, now seen corresponding path program 1 times [2023-02-17 05:41:51,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:41:51,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622721668] [2023-02-17 05:41:51,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:41:51,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:41:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:41:51,225 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 47 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-02-17 05:41:51,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:41:51,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622721668] [2023-02-17 05:41:51,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622721668] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 05:41:51,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672902415] [2023-02-17 05:41:51,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:41:51,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:41:51,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 05:41:51,227 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) [2023-02-17 05:41:51,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-17 05:41:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:41:51,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-17 05:41:51,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:41:51,336 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 46 proven. 3 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-02-17 05:41:51,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 05:41:51,391 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 38 proven. 25 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-02-17 05:41:51,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672902415] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 05:41:51,391 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 05:41:51,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 6] total 11 [2023-02-17 05:41:51,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269327222] [2023-02-17 05:41:51,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 05:41:51,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 05:41:51,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:41:51,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 05:41:51,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-02-17 05:41:51,393 INFO L87 Difference]: Start difference. First operand 167 states and 264 transitions. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:51,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:41:51,948 INFO L93 Difference]: Finished difference Result 987 states and 1572 transitions. [2023-02-17 05:41:51,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-17 05:41:51,949 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2023-02-17 05:41:51,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:41:51,953 INFO L225 Difference]: With dead ends: 987 [2023-02-17 05:41:51,953 INFO L226 Difference]: Without dead ends: 734 [2023-02-17 05:41:51,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 130 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2023-02-17 05:41:51,955 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 579 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 05:41:51,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 307 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 05:41:51,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2023-02-17 05:41:51,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 501. [2023-02-17 05:41:51,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 500 states have (on average 1.48) internal successors, (740), 500 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:51,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 740 transitions. [2023-02-17 05:41:51,979 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 740 transitions. Word has length 69 [2023-02-17 05:41:51,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:41:51,980 INFO L495 AbstractCegarLoop]: Abstraction has 501 states and 740 transitions. [2023-02-17 05:41:51,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:51,980 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 740 transitions. [2023-02-17 05:41:51,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-02-17 05:41:51,981 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:41:51,981 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-02-17 05:41:51,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-17 05:41:52,189 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,SelfDestructingSolverStorable11 [2023-02-17 05:41:52,190 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:41:52,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:41:52,191 INFO L85 PathProgramCache]: Analyzing trace with hash 319706574, now seen corresponding path program 1 times [2023-02-17 05:41:52,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:41:52,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264606852] [2023-02-17 05:41:52,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:41:52,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:41:52,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 05:41:52,275 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 05:41:52,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 05:41:52,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 05:41:52,372 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-17 05:41:52,373 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-17 05:41:52,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-17 05:41:52,377 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:41:52,380 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 05:41:52,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 05:41:52 BoogieIcfgContainer [2023-02-17 05:41:52,447 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 05:41:52,448 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 05:41:52,448 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 05:41:52,448 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 05:41:52,449 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 05:41:46" (3/4) ... [2023-02-17 05:41:52,451 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-17 05:41:52,452 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 05:41:52,452 INFO L158 Benchmark]: Toolchain (without parser) took 6889.99ms. Allocated memory was 151.0MB in the beginning and 239.1MB in the end (delta: 88.1MB). Free memory was 106.9MB in the beginning and 199.9MB in the end (delta: -93.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 05:41:52,452 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 109.1MB. Free memory is still 82.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 05:41:52,453 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.16ms. Allocated memory is still 151.0MB. Free memory was 106.3MB in the beginning and 94.3MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-17 05:41:52,453 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.13ms. Allocated memory is still 151.0MB. Free memory was 94.3MB in the beginning and 91.1MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 05:41:52,453 INFO L158 Benchmark]: Boogie Preprocessor took 41.16ms. Allocated memory is still 151.0MB. Free memory was 91.1MB in the beginning and 89.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 05:41:52,454 INFO L158 Benchmark]: RCFGBuilder took 553.16ms. Allocated memory is still 151.0MB. Free memory was 89.0MB in the beginning and 70.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-02-17 05:41:52,455 INFO L158 Benchmark]: TraceAbstraction took 5944.56ms. Allocated memory was 151.0MB in the beginning and 239.1MB in the end (delta: 88.1MB). Free memory was 69.7MB in the beginning and 199.9MB in the end (delta: -130.2MB). Peak memory consumption was 69.0MB. Max. memory is 16.1GB. [2023-02-17 05:41:52,455 INFO L158 Benchmark]: Witness Printer took 3.94ms. Allocated memory is still 239.1MB. Free memory is still 199.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 05:41:52,457 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 109.1MB. Free memory is still 82.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 285.16ms. Allocated memory is still 151.0MB. Free memory was 106.3MB in the beginning and 94.3MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.13ms. Allocated memory is still 151.0MB. Free memory was 94.3MB in the beginning and 91.1MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.16ms. Allocated memory is still 151.0MB. Free memory was 91.1MB in the beginning and 89.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 553.16ms. Allocated memory is still 151.0MB. Free memory was 89.0MB in the beginning and 70.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 5944.56ms. Allocated memory was 151.0MB in the beginning and 239.1MB in the end (delta: 88.1MB). Free memory was 69.7MB in the beginning and 199.9MB in the end (delta: -130.2MB). Peak memory consumption was 69.0MB. Max. memory is 16.1GB. * Witness Printer took 3.94ms. Allocated memory is still 239.1MB. Free memory is still 199.9MB. 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: 25]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 116. Possible FailurePath: [L124] unsigned int a, b, r; [L125] a = __VERIFIER_nondet_uint() [L127] b = 234770789 [L129] CALL, EXPR mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=4] [L59] COND TRUE a3 == (unsigned char)0 [L60] na = na - 1 VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=3] [L61] COND TRUE a2 == (unsigned char)0 [L62] na = na - 1 VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=2] [L63] COND TRUE a1 == (unsigned char)0 [L64] na = na - 1 VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=1] [L68] nb = (unsigned char)4 VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=1, nb=4] [L69] COND FALSE !(b3 == (unsigned char)0) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=1, nb=4] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=0] [L83] COND TRUE i < na VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 [L84] partial_sum = partial_sum + a0 VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=0] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=0] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=0] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=0] [L89] COND TRUE i < nb VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=0] [L90] COND TRUE i == (unsigned char)0 [L90] partial_sum = partial_sum + b0 VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=101] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=101] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=101] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=101] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=101] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=101, r0=101] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=101, r0=101] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=101, r0=101] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=101, r0=101] [L104] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=101, r0=101] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=101] [L83] COND FALSE !(i < na) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=101] [L89] COND TRUE i < nb VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=101] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=101] [L91] COND TRUE i == (unsigned char)1 [L91] partial_sum = partial_sum + b1 VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=81, r0=101] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=81, r0=101] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=81, r0=101] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=81, r0=101] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=81, r0=101] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=81, r0=101, r1=81] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=81, r0=101, r1=81] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=81, r0=101, r1=81] [L104] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=81, r0=101, r1=81] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=101, r1=81] [L83] COND FALSE !(i < na) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=101, r1=81] [L89] COND TRUE i < nb VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=101, r1=81] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=101, r1=81] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=101, r1=81] [L92] COND TRUE i == (unsigned char)2 [L92] partial_sum = partial_sum + b2 VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=101, r1=81] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=101, r1=81] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=101, r1=81] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=101, r1=81] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=101, r1=81] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=101, r1=81, r2=254] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=101, r1=81, r2=254] [L104] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=254, r0=101, r1=81, r2=254] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=101, r1=81, r2=254] [L83] COND FALSE !(i < na) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=101, r1=81, r2=254] [L89] COND TRUE i < nb VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=101, r1=81, r2=254] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=101, r1=81, r2=254] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=101, r1=81, r2=254] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=101, r1=81, r2=254] [L93] COND TRUE i == (unsigned char)3 [L93] partial_sum = partial_sum + b3 VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=101, r1=81, r2=254] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=101, r1=81, r2=254] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=101, r1=81, r2=254] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=101, r1=81, r2=254] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=101, r1=81, r2=254] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=101, r1=81, r2=254, r3=13] [L104] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=1, nb=4, partial_sum=13, r0=101, r1=81, r2=254, r3=13] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=1, nb=4, partial_sum=13, r0=101, r1=81, r2=254, r3=13] [L107] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=1, nb=4, partial_sum=13, r0=101, r1=81, r2=254, r3=13] [L116] r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) [L118] return r; VAL [\old(a)=0, \old(b)=234770789, \result=218103808, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=1, nb=4, partial_sum=13, r=218103808, r0=101, r1=81, r2=254, r3=13] [L129] RET, EXPR mp_add(a, b) [L129] r = mp_add(a, b) [L131] CALL __VERIFIER_assert(r == a + b) [L24] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L25] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.8s, OverallIterations: 13, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1826 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1826 mSDsluCounter, 2193 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1335 mSDsCounter, 249 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1829 IncrementalHoareTripleChecker+Invalid, 2078 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 249 mSolverCounterUnsat, 858 mSDtfsCounter, 1829 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 275 GetRequests, 191 SyntacticMatches, 24 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=501occurred in iteration=12, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 1551 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 634 NumberOfCodeBlocks, 634 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 617 ConstructedInterpolants, 0 QuantifiedInterpolants, 2933 SizeOfPredicates, 7 NumberOfNonLiveVariables, 307 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 15 InterpolantComputations, 11 PerfectInterpolantSequences, 459/491 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 [2023-02-17 05:41:52,490 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/byte_add_2-2.i -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 de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-17 05:41:54,609 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 05:41:54,611 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 05:41:54,655 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 05:41:54,658 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 05:41:54,661 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 05:41:54,663 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 05:41:54,666 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 05:41:54,671 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 05:41:54,676 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 05:41:54,677 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 05:41:54,678 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 05:41:54,678 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 05:41:54,679 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 05:41:54,680 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 05:41:54,681 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 05:41:54,681 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 05:41:54,682 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 05:41:54,683 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 05:41:54,685 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 05:41:54,686 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 05:41:54,687 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 05:41:54,688 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 05:41:54,689 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 05:41:54,692 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 05:41:54,692 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 05:41:54,693 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 05:41:54,694 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 05:41:54,694 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 05:41:54,695 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 05:41:54,695 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 05:41:54,697 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 05:41:54,698 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 05:41:54,699 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 05:41:54,700 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 05:41:54,700 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 05:41:54,701 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 05:41:54,702 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 05:41:54,702 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 05:41:54,702 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 05:41:54,703 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 05:41:54,704 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-02-17 05:41:54,743 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 05:41:54,744 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 05:41:54,745 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 05:41:54,745 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 05:41:54,746 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 05:41:54,746 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 05:41:54,747 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 05:41:54,747 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 05:41:54,747 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 05:41:54,748 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 05:41:54,748 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 05:41:54,749 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 05:41:54,749 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 05:41:54,749 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 05:41:54,749 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 05:41:54,749 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 05:41:54,750 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-17 05:41:54,750 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-17 05:41:54,750 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-17 05:41:54,750 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 05:41:54,750 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 05:41:54,751 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 05:41:54,751 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 05:41:54,751 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 05:41:54,751 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 05:41:54,751 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 05:41:54,752 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 05:41:54,752 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 05:41:54,752 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 05:41:54,752 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 05:41:54,752 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-17 05:41:54,753 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-17 05:41:54,753 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 05:41:54,753 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 05:41:54,753 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 05:41:54,754 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 05:41:54,754 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-17 05:41:54,754 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 05:41:54,754 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba [2023-02-17 05:41:55,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 05:41:55,089 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 05:41:55,092 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 05:41:55,093 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 05:41:55,095 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 05:41:55,096 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_2-2.i [2023-02-17 05:41:56,365 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 05:41:56,590 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 05:41:56,591 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i [2023-02-17 05:41:56,602 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07ff8bcb1/5e9a1507f3ee4ce1b1c05fa0e8a710f4/FLAGfab8d3b7e [2023-02-17 05:41:56,617 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07ff8bcb1/5e9a1507f3ee4ce1b1c05fa0e8a710f4 [2023-02-17 05:41:56,619 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 05:41:56,620 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 05:41:56,621 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 05:41:56,621 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 05:41:56,624 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 05:41:56,626 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 05:41:56" (1/1) ... [2023-02-17 05:41:56,627 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60edcda0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:41:56, skipping insertion in model container [2023-02-17 05:41:56,627 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 05:41:56" (1/1) ... [2023-02-17 05:41:56,633 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 05:41:56,665 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 05:41:56,792 WARN L237 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/byte_add_2-2.i[1168,1181] [2023-02-17 05:41:56,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 05:41:56,841 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 05:41:56,866 WARN L237 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/byte_add_2-2.i[1168,1181] [2023-02-17 05:41:56,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 05:41:56,916 INFO L208 MainTranslator]: Completed translation [2023-02-17 05:41:56,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:41:56 WrapperNode [2023-02-17 05:41:56,917 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 05:41:56,919 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 05:41:56,919 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 05:41:56,919 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 05:41:56,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:41:56" (1/1) ... [2023-02-17 05:41:56,942 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:41:56" (1/1) ... [2023-02-17 05:41:56,970 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 123 [2023-02-17 05:41:56,971 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 05:41:56,972 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 05:41:56,973 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 05:41:56,973 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 05:41:56,980 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:41:56" (1/1) ... [2023-02-17 05:41:56,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:41:56" (1/1) ... [2023-02-17 05:41:56,994 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:41:56" (1/1) ... [2023-02-17 05:41:56,994 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:41:56" (1/1) ... [2023-02-17 05:41:57,004 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:41:56" (1/1) ... [2023-02-17 05:41:57,014 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:41:56" (1/1) ... [2023-02-17 05:41:57,016 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:41:56" (1/1) ... [2023-02-17 05:41:57,021 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:41:56" (1/1) ... [2023-02-17 05:41:57,024 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 05:41:57,027 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 05:41:57,045 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 05:41:57,045 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 05:41:57,046 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:41:56" (1/1) ... [2023-02-17 05:41:57,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 05:41:57,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 05:41:57,098 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) [2023-02-17 05:41:57,131 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 [2023-02-17 05:41:57,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 05:41:57,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-17 05:41:57,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 05:41:57,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 05:41:57,217 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 05:41:57,221 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 05:41:57,527 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 05:41:57,542 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 05:41:57,543 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-17 05:41:57,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 05:41:57 BoogieIcfgContainer [2023-02-17 05:41:57,545 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 05:41:57,546 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 05:41:57,547 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 05:41:57,549 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 05:41:57,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 05:41:56" (1/3) ... [2023-02-17 05:41:57,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32f30288 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 05:41:57, skipping insertion in model container [2023-02-17 05:41:57,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:41:56" (2/3) ... [2023-02-17 05:41:57,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32f30288 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 05:41:57, skipping insertion in model container [2023-02-17 05:41:57,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 05:41:57" (3/3) ... [2023-02-17 05:41:57,553 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_2-2.i [2023-02-17 05:41:57,569 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 05:41:57,569 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 05:41:57,629 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 05:41:57,636 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6132b032, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 05:41:57,637 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 05:41:57,641 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:57,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-17 05:41:57,649 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:41:57,650 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:41:57,651 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:41:57,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:41:57,657 INFO L85 PathProgramCache]: Analyzing trace with hash 255061167, now seen corresponding path program 1 times [2023-02-17 05:41:57,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 05:41:57,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [55209851] [2023-02-17 05:41:57,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:41:57,669 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:41:57,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 05:41:57,677 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 05:41:57,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-17 05:41:57,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:41:57,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-17 05:41:57,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:41:57,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:41:57,789 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 05:41:57,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 05:41:57,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [55209851] [2023-02-17 05:41:57,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [55209851] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:41:57,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:41:57,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 05:41:57,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844080711] [2023-02-17 05:41:57,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:41:57,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 05:41:57,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 05:41:57,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 05:41:57,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 05:41:57,852 INFO L87 Difference]: Start difference. First operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:57,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:41:57,876 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2023-02-17 05:41:57,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 05:41:57,878 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-17 05:41:57,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:41:57,886 INFO L225 Difference]: With dead ends: 57 [2023-02-17 05:41:57,886 INFO L226 Difference]: Without dead ends: 38 [2023-02-17 05:41:57,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 05:41:57,894 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 05:41:57,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 05:41:57,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-17 05:41:57,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-02-17 05:41:57,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 37 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:57,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 64 transitions. [2023-02-17 05:41:57,932 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 64 transitions. Word has length 12 [2023-02-17 05:41:57,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:41:57,933 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 64 transitions. [2023-02-17 05:41:57,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:57,934 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 64 transitions. [2023-02-17 05:41:57,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-17 05:41:57,935 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:41:57,935 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:41:57,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-02-17 05:41:58,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:41:58,148 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:41:58,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:41:58,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1803477009, now seen corresponding path program 1 times [2023-02-17 05:41:58,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 05:41:58,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [323344504] [2023-02-17 05:41:58,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:41:58,149 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:41:58,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 05:41:58,185 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 05:41:58,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-17 05:41:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:41:58,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 05:41:58,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:41:58,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:41:58,266 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 05:41:58,267 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 05:41:58,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [323344504] [2023-02-17 05:41:58,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [323344504] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:41:58,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:41:58,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 05:41:58,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175271623] [2023-02-17 05:41:58,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:41:58,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 05:41:58,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 05:41:58,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 05:41:58,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-17 05:41:58,272 INFO L87 Difference]: Start difference. First operand 38 states and 64 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:58,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:41:58,411 INFO L93 Difference]: Finished difference Result 116 states and 201 transitions. [2023-02-17 05:41:58,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 05:41:58,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-17 05:41:58,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:41:58,414 INFO L225 Difference]: With dead ends: 116 [2023-02-17 05:41:58,414 INFO L226 Difference]: Without dead ends: 88 [2023-02-17 05:41:58,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-17 05:41:58,416 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 92 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:41:58,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 137 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 05:41:58,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-17 05:41:58,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2023-02-17 05:41:58,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.625) internal successors, (130), 80 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:58,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 130 transitions. [2023-02-17 05:41:58,427 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 130 transitions. Word has length 12 [2023-02-17 05:41:58,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:41:58,427 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 130 transitions. [2023-02-17 05:41:58,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:58,428 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 130 transitions. [2023-02-17 05:41:58,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-17 05:41:58,429 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:41:58,429 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:41:58,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-17 05:41:58,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:41:58,639 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:41:58,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:41:58,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1087802014, now seen corresponding path program 1 times [2023-02-17 05:41:58,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 05:41:58,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1461816893] [2023-02-17 05:41:58,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:41:58,641 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:41:58,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 05:41:58,642 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 05:41:58,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-17 05:41:58,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:41:58,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-17 05:41:58,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:41:58,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:41:58,719 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 05:41:58,719 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 05:41:58,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1461816893] [2023-02-17 05:41:58,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1461816893] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:41:58,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:41:58,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 05:41:58,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626036386] [2023-02-17 05:41:58,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:41:58,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 05:41:58,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 05:41:58,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 05:41:58,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:41:58,722 INFO L87 Difference]: Start difference. First operand 81 states and 130 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:58,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:41:58,732 INFO L93 Difference]: Finished difference Result 86 states and 134 transitions. [2023-02-17 05:41:58,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 05:41:58,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-17 05:41:58,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:41:58,734 INFO L225 Difference]: With dead ends: 86 [2023-02-17 05:41:58,734 INFO L226 Difference]: Without dead ends: 55 [2023-02-17 05:41:58,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:41:58,735 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 55 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 05:41:58,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 58 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 05:41:58,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-02-17 05:41:58,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-02-17 05:41:58,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 54 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:58,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 80 transitions. [2023-02-17 05:41:58,748 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 80 transitions. Word has length 13 [2023-02-17 05:41:58,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:41:58,749 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 80 transitions. [2023-02-17 05:41:58,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:58,749 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 80 transitions. [2023-02-17 05:41:58,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-17 05:41:58,751 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:41:58,752 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:41:58,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-17 05:41:58,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:41:58,973 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:41:58,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:41:58,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1480128500, now seen corresponding path program 1 times [2023-02-17 05:41:58,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 05:41:58,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [381758850] [2023-02-17 05:41:58,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:41:58,974 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:41:58,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 05:41:58,981 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 05:41:58,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-17 05:41:59,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:41:59,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 05:41:59,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:41:59,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:41:59,033 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 05:41:59,034 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 05:41:59,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [381758850] [2023-02-17 05:41:59,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [381758850] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:41:59,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:41:59,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 05:41:59,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198121505] [2023-02-17 05:41:59,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:41:59,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 05:41:59,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 05:41:59,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 05:41:59,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-17 05:41:59,037 INFO L87 Difference]: Start difference. First operand 55 states and 80 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:59,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:41:59,183 INFO L93 Difference]: Finished difference Result 151 states and 219 transitions. [2023-02-17 05:41:59,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 05:41:59,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-02-17 05:41:59,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:41:59,186 INFO L225 Difference]: With dead ends: 151 [2023-02-17 05:41:59,187 INFO L226 Difference]: Without dead ends: 107 [2023-02-17 05:41:59,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-17 05:41:59,193 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 65 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:41:59,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 146 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 05:41:59,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-02-17 05:41:59,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 60. [2023-02-17 05:41:59,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 59 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:59,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 85 transitions. [2023-02-17 05:41:59,208 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 85 transitions. Word has length 25 [2023-02-17 05:41:59,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:41:59,208 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 85 transitions. [2023-02-17 05:41:59,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:59,208 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 85 transitions. [2023-02-17 05:41:59,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-17 05:41:59,209 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:41:59,209 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:41:59,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-17 05:41:59,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:41:59,410 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:41:59,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:41:59,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1384042382, now seen corresponding path program 1 times [2023-02-17 05:41:59,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 05:41:59,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [47458401] [2023-02-17 05:41:59,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:41:59,411 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:41:59,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 05:41:59,414 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 05:41:59,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-17 05:41:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:41:59,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 05:41:59,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:41:59,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:41:59,466 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 05:41:59,466 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 05:41:59,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [47458401] [2023-02-17 05:41:59,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [47458401] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:41:59,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:41:59,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 05:41:59,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819249113] [2023-02-17 05:41:59,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:41:59,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 05:41:59,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 05:41:59,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 05:41:59,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-17 05:41:59,468 INFO L87 Difference]: Start difference. First operand 60 states and 85 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:59,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:41:59,663 INFO L93 Difference]: Finished difference Result 201 states and 290 transitions. [2023-02-17 05:41:59,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 05:41:59,663 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-02-17 05:41:59,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:41:59,664 INFO L225 Difference]: With dead ends: 201 [2023-02-17 05:41:59,664 INFO L226 Difference]: Without dead ends: 157 [2023-02-17 05:41:59,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-17 05:41:59,665 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 117 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 05:41:59,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 312 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 05:41:59,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-02-17 05:41:59,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 60. [2023-02-17 05:41:59,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 59 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:59,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 85 transitions. [2023-02-17 05:41:59,672 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 85 transitions. Word has length 26 [2023-02-17 05:41:59,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:41:59,672 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 85 transitions. [2023-02-17 05:41:59,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:41:59,672 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 85 transitions. [2023-02-17 05:41:59,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-17 05:41:59,673 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:41:59,673 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:41:59,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-17 05:41:59,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:41:59,882 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:41:59,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:41:59,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1985045161, now seen corresponding path program 1 times [2023-02-17 05:41:59,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 05:41:59,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1136421060] [2023-02-17 05:41:59,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:41:59,884 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:41:59,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 05:41:59,885 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 05:41:59,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-17 05:41:59,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:41:59,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 05:41:59,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:41:59,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:41:59,949 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 05:41:59,949 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 05:41:59,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1136421060] [2023-02-17 05:41:59,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1136421060] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:41:59,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:41:59,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-17 05:41:59,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702861881] [2023-02-17 05:41:59,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:41:59,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 05:41:59,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 05:41:59,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 05:41:59,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-17 05:41:59,952 INFO L87 Difference]: Start difference. First operand 60 states and 85 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:00,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:42:00,291 INFO L93 Difference]: Finished difference Result 248 states and 355 transitions. [2023-02-17 05:42:00,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 05:42:00,292 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-02-17 05:42:00,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:42:00,293 INFO L225 Difference]: With dead ends: 248 [2023-02-17 05:42:00,293 INFO L226 Difference]: Without dead ends: 204 [2023-02-17 05:42:00,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-17 05:42:00,297 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 213 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 05:42:00,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 718 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 05:42:00,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2023-02-17 05:42:00,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 92. [2023-02-17 05:42:00,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.4285714285714286) internal successors, (130), 91 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:00,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 130 transitions. [2023-02-17 05:42:00,313 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 130 transitions. Word has length 27 [2023-02-17 05:42:00,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:42:00,314 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 130 transitions. [2023-02-17 05:42:00,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:00,314 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 130 transitions. [2023-02-17 05:42:00,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-17 05:42:00,316 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:42:00,316 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:42:00,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-02-17 05:42:00,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:42:00,525 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:42:00,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:42:00,526 INFO L85 PathProgramCache]: Analyzing trace with hash 179606827, now seen corresponding path program 1 times [2023-02-17 05:42:00,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 05:42:00,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [872686156] [2023-02-17 05:42:00,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:42:00,527 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:42:00,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 05:42:00,528 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 05:42:00,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-17 05:42:00,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:42:00,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-17 05:42:00,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:42:00,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:42:00,581 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 05:42:00,581 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 05:42:00,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [872686156] [2023-02-17 05:42:00,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [872686156] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:42:00,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:42:00,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 05:42:00,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876101835] [2023-02-17 05:42:00,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:42:00,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 05:42:00,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 05:42:00,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 05:42:00,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-17 05:42:00,583 INFO L87 Difference]: Start difference. First operand 92 states and 130 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:00,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:42:00,699 INFO L93 Difference]: Finished difference Result 247 states and 352 transitions. [2023-02-17 05:42:00,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 05:42:00,700 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-02-17 05:42:00,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:42:00,701 INFO L225 Difference]: With dead ends: 247 [2023-02-17 05:42:00,701 INFO L226 Difference]: Without dead ends: 203 [2023-02-17 05:42:00,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-17 05:42:00,702 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 192 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:42:00,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 392 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 05:42:00,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2023-02-17 05:42:00,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 87. [2023-02-17 05:42:00,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.441860465116279) internal successors, (124), 86 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:00,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 124 transitions. [2023-02-17 05:42:00,716 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 124 transitions. Word has length 27 [2023-02-17 05:42:00,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:42:00,717 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 124 transitions. [2023-02-17 05:42:00,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:00,717 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 124 transitions. [2023-02-17 05:42:00,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-17 05:42:00,718 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:42:00,718 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:42:00,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-17 05:42:00,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:42:00,921 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:42:00,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:42:00,922 INFO L85 PathProgramCache]: Analyzing trace with hash 221982208, now seen corresponding path program 1 times [2023-02-17 05:42:00,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 05:42:00,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [80499486] [2023-02-17 05:42:00,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:42:00,923 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:42:00,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 05:42:00,924 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 05:42:00,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-17 05:42:00,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:42:00,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-17 05:42:00,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:42:01,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:42:01,020 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 05:42:01,020 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 05:42:01,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [80499486] [2023-02-17 05:42:01,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [80499486] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:42:01,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:42:01,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 05:42:01,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251286282] [2023-02-17 05:42:01,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:42:01,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 05:42:01,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 05:42:01,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 05:42:01,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:42:01,022 INFO L87 Difference]: Start difference. First operand 87 states and 124 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:01,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:42:01,031 INFO L93 Difference]: Finished difference Result 121 states and 172 transitions. [2023-02-17 05:42:01,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 05:42:01,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-02-17 05:42:01,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:42:01,032 INFO L225 Difference]: With dead ends: 121 [2023-02-17 05:42:01,032 INFO L226 Difference]: Without dead ends: 107 [2023-02-17 05:42:01,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:42:01,033 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 4 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 05:42:01,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 113 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 05:42:01,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-02-17 05:42:01,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-02-17 05:42:01,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.4339622641509433) internal successors, (152), 106 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:01,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 152 transitions. [2023-02-17 05:42:01,047 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 152 transitions. Word has length 29 [2023-02-17 05:42:01,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:42:01,048 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 152 transitions. [2023-02-17 05:42:01,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:01,048 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 152 transitions. [2023-02-17 05:42:01,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-17 05:42:01,049 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:42:01,049 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:42:01,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-17 05:42:01,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:42:01,250 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:42:01,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:42:01,251 INFO L85 PathProgramCache]: Analyzing trace with hash 480147646, now seen corresponding path program 1 times [2023-02-17 05:42:01,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 05:42:01,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1334981741] [2023-02-17 05:42:01,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:42:01,251 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:42:01,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 05:42:01,252 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 05:42:01,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-17 05:42:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:42:01,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 05:42:01,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:42:01,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:42:01,324 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 05:42:01,324 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 05:42:01,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1334981741] [2023-02-17 05:42:01,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1334981741] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:42:01,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:42:01,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 05:42:01,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645562565] [2023-02-17 05:42:01,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:42:01,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 05:42:01,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 05:42:01,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 05:42:01,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 05:42:01,326 INFO L87 Difference]: Start difference. First operand 107 states and 152 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:01,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:42:01,466 INFO L93 Difference]: Finished difference Result 253 states and 381 transitions. [2023-02-17 05:42:01,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 05:42:01,467 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-02-17 05:42:01,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:42:01,468 INFO L225 Difference]: With dead ends: 253 [2023-02-17 05:42:01,468 INFO L226 Difference]: Without dead ends: 161 [2023-02-17 05:42:01,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 05:42:01,469 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 70 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:42:01,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 67 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 05:42:01,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-02-17 05:42:01,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 143. [2023-02-17 05:42:01,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.3450704225352113) internal successors, (191), 142 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:01,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 191 transitions. [2023-02-17 05:42:01,476 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 191 transitions. Word has length 29 [2023-02-17 05:42:01,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:42:01,476 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 191 transitions. [2023-02-17 05:42:01,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:01,477 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 191 transitions. [2023-02-17 05:42:01,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-17 05:42:01,478 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:42:01,478 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:42:01,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-17 05:42:01,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:42:01,687 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:42:01,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:42:01,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1538767779, now seen corresponding path program 1 times [2023-02-17 05:42:01,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 05:42:01,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1761049869] [2023-02-17 05:42:01,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:42:01,688 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:42:01,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 05:42:01,689 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 05:42:01,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-02-17 05:42:01,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:42:01,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 05:42:01,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:42:01,760 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:42:01,760 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 05:42:01,761 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 05:42:01,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1761049869] [2023-02-17 05:42:01,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1761049869] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:42:01,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:42:01,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 05:42:01,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580612442] [2023-02-17 05:42:01,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:42:01,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 05:42:01,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 05:42:01,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 05:42:01,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 05:42:01,768 INFO L87 Difference]: Start difference. First operand 143 states and 191 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:01,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:42:01,920 INFO L93 Difference]: Finished difference Result 306 states and 408 transitions. [2023-02-17 05:42:01,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 05:42:01,921 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2023-02-17 05:42:01,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:42:01,922 INFO L225 Difference]: With dead ends: 306 [2023-02-17 05:42:01,922 INFO L226 Difference]: Without dead ends: 229 [2023-02-17 05:42:01,922 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 [2023-02-17 05:42:01,923 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 89 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:42:01,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 128 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 05:42:01,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2023-02-17 05:42:01,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 206. [2023-02-17 05:42:01,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.3463414634146342) internal successors, (276), 205 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:01,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 276 transitions. [2023-02-17 05:42:01,933 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 276 transitions. Word has length 42 [2023-02-17 05:42:01,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:42:01,933 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 276 transitions. [2023-02-17 05:42:01,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:01,934 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 276 transitions. [2023-02-17 05:42:01,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-17 05:42:01,934 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:42:01,935 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:42:01,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-02-17 05:42:02,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:42:02,144 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:42:02,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:42:02,145 INFO L85 PathProgramCache]: Analyzing trace with hash -390869275, now seen corresponding path program 1 times [2023-02-17 05:42:02,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 05:42:02,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1101940202] [2023-02-17 05:42:02,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:42:02,145 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:42:02,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 05:42:02,147 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 05:42:02,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-02-17 05:42:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:42:02,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-17 05:42:02,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:42:02,245 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:42:02,245 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 05:42:02,245 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 05:42:02,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1101940202] [2023-02-17 05:42:02,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1101940202] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:42:02,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:42:02,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 05:42:02,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162189094] [2023-02-17 05:42:02,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:42:02,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 05:42:02,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 05:42:02,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 05:42:02,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-17 05:42:02,247 INFO L87 Difference]: Start difference. First operand 206 states and 276 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:02,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:42:02,462 INFO L93 Difference]: Finished difference Result 389 states and 517 transitions. [2023-02-17 05:42:02,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 05:42:02,462 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2023-02-17 05:42:02,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:42:02,464 INFO L225 Difference]: With dead ends: 389 [2023-02-17 05:42:02,464 INFO L226 Difference]: Without dead ends: 312 [2023-02-17 05:42:02,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-17 05:42:02,465 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 136 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 05:42:02,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 269 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 05:42:02,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2023-02-17 05:42:02,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 206. [2023-02-17 05:42:02,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.3463414634146342) internal successors, (276), 205 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:02,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 276 transitions. [2023-02-17 05:42:02,481 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 276 transitions. Word has length 43 [2023-02-17 05:42:02,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:42:02,481 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 276 transitions. [2023-02-17 05:42:02,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:02,481 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 276 transitions. [2023-02-17 05:42:02,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-17 05:42:02,482 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:42:02,482 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:42:02,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-02-17 05:42:02,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:42:02,696 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:42:02,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:42:02,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1822068338, now seen corresponding path program 1 times [2023-02-17 05:42:02,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 05:42:02,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1639649211] [2023-02-17 05:42:02,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:42:02,697 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:42:02,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 05:42:02,698 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 05:42:02,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-02-17 05:42:02,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:42:02,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-17 05:42:02,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:42:02,775 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:42:02,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 05:42:02,810 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:42:02,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 05:42:02,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1639649211] [2023-02-17 05:42:02,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1639649211] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 05:42:02,810 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 05:42:02,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-02-17 05:42:02,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744902235] [2023-02-17 05:42:02,811 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 05:42:02,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 05:42:02,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 05:42:02,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 05:42:02,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-02-17 05:42:02,813 INFO L87 Difference]: Start difference. First operand 206 states and 276 transitions. Second operand has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:03,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:42:03,093 INFO L93 Difference]: Finished difference Result 619 states and 939 transitions. [2023-02-17 05:42:03,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 05:42:03,093 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2023-02-17 05:42:03,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:42:03,095 INFO L225 Difference]: With dead ends: 619 [2023-02-17 05:42:03,095 INFO L226 Difference]: Without dead ends: 434 [2023-02-17 05:42:03,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2023-02-17 05:42:03,096 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 182 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 05:42:03,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 99 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 05:42:03,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2023-02-17 05:42:03,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 353. [2023-02-17 05:42:03,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 352 states have (on average 1.4318181818181819) internal successors, (504), 352 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:03,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 504 transitions. [2023-02-17 05:42:03,116 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 504 transitions. Word has length 44 [2023-02-17 05:42:03,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:42:03,116 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 504 transitions. [2023-02-17 05:42:03,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:03,117 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 504 transitions. [2023-02-17 05:42:03,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-02-17 05:42:03,118 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:42:03,118 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-02-17 05:42:03,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-02-17 05:42:03,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:42:03,328 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:42:03,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:42:03,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1373021230, now seen corresponding path program 1 times [2023-02-17 05:42:03,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 05:42:03,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [728690635] [2023-02-17 05:42:03,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:42:03,330 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:42:03,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 05:42:03,331 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 05:42:03,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-02-17 05:42:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:42:03,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 05:42:03,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:42:03,412 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-02-17 05:42:03,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 05:42:03,446 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 49 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-02-17 05:42:03,446 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 05:42:03,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [728690635] [2023-02-17 05:42:03,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [728690635] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 05:42:03,446 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 05:42:03,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-02-17 05:42:03,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101514950] [2023-02-17 05:42:03,447 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 05:42:03,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 05:42:03,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 05:42:03,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 05:42:03,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-02-17 05:42:03,448 INFO L87 Difference]: Start difference. First operand 353 states and 504 transitions. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:03,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:42:03,633 INFO L93 Difference]: Finished difference Result 1121 states and 1560 transitions. [2023-02-17 05:42:03,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 05:42:03,634 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2023-02-17 05:42:03,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:42:03,637 INFO L225 Difference]: With dead ends: 1121 [2023-02-17 05:42:03,638 INFO L226 Difference]: Without dead ends: 790 [2023-02-17 05:42:03,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 128 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2023-02-17 05:42:03,639 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 235 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:42:03,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 338 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 05:42:03,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2023-02-17 05:42:03,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 472. [2023-02-17 05:42:03,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 471 states have (on average 1.4522292993630572) internal successors, (684), 471 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:03,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 684 transitions. [2023-02-17 05:42:03,664 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 684 transitions. Word has length 70 [2023-02-17 05:42:03,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:42:03,665 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 684 transitions. [2023-02-17 05:42:03,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:03,665 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 684 transitions. [2023-02-17 05:42:03,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-02-17 05:42:03,666 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:42:03,667 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-02-17 05:42:03,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-02-17 05:42:03,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:42:03,876 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:42:03,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:42:03,876 INFO L85 PathProgramCache]: Analyzing trace with hash 343661932, now seen corresponding path program 2 times [2023-02-17 05:42:03,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 05:42:03,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [502250940] [2023-02-17 05:42:03,877 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 05:42:03,877 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:42:03,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 05:42:03,878 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 05:42:03,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-02-17 05:42:03,922 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 05:42:03,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 05:42:03,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 05:42:03,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:42:03,950 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 66 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 05:42:03,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 05:42:03,973 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 68 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 05:42:03,973 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 05:42:03,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [502250940] [2023-02-17 05:42:03,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [502250940] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 05:42:03,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 05:42:03,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2023-02-17 05:42:03,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016837689] [2023-02-17 05:42:03,974 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 05:42:03,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-17 05:42:03,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 05:42:03,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-17 05:42:03,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-17 05:42:03,976 INFO L87 Difference]: Start difference. First operand 472 states and 684 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:04,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:42:04,135 INFO L93 Difference]: Finished difference Result 1214 states and 1676 transitions. [2023-02-17 05:42:04,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 05:42:04,136 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2023-02-17 05:42:04,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:42:04,139 INFO L225 Difference]: With dead ends: 1214 [2023-02-17 05:42:04,139 INFO L226 Difference]: Without dead ends: 764 [2023-02-17 05:42:04,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 135 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2023-02-17 05:42:04,141 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 260 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:42:04,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 262 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 05:42:04,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2023-02-17 05:42:04,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 465. [2023-02-17 05:42:04,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 464 states have (on average 1.4051724137931034) internal successors, (652), 464 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:04,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 652 transitions. [2023-02-17 05:42:04,174 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 652 transitions. Word has length 70 [2023-02-17 05:42:04,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:42:04,174 INFO L495 AbstractCegarLoop]: Abstraction has 465 states and 652 transitions. [2023-02-17 05:42:04,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:04,175 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 652 transitions. [2023-02-17 05:42:04,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-02-17 05:42:04,176 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:42:04,176 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-02-17 05:42:04,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-02-17 05:42:04,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:42:04,385 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:42:04,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:42:04,385 INFO L85 PathProgramCache]: Analyzing trace with hash 484210542, now seen corresponding path program 3 times [2023-02-17 05:42:04,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 05:42:04,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1541839865] [2023-02-17 05:42:04,397 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 05:42:04,397 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:42:04,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 05:42:04,399 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 05:42:04,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-02-17 05:42:04,478 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-02-17 05:42:04,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 05:42:04,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 42 conjunts are in the unsatisfiable core [2023-02-17 05:42:04,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:42:05,281 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:42:05,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 05:42:07,271 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:42:07,272 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 05:42:07,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1541839865] [2023-02-17 05:42:07,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1541839865] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 05:42:07,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 05:42:07,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 45 [2023-02-17 05:42:07,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132183008] [2023-02-17 05:42:07,273 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 05:42:07,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-02-17 05:42:07,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 05:42:07,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-02-17 05:42:07,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1832, Unknown=0, NotChecked=0, Total=1980 [2023-02-17 05:42:07,277 INFO L87 Difference]: Start difference. First operand 465 states and 652 transitions. Second operand has 45 states, 45 states have (on average 3.066666666666667) internal successors, (138), 45 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:16,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:42:16,124 INFO L93 Difference]: Finished difference Result 1736 states and 2294 transitions. [2023-02-17 05:42:16,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2023-02-17 05:42:16,125 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.066666666666667) internal successors, (138), 45 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2023-02-17 05:42:16,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:42:16,131 INFO L225 Difference]: With dead ends: 1736 [2023-02-17 05:42:16,131 INFO L226 Difference]: Without dead ends: 1615 [2023-02-17 05:42:16,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2662 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=2355, Invalid=11687, Unknown=0, NotChecked=0, Total=14042 [2023-02-17 05:42:16,137 INFO L413 NwaCegarLoop]: 366 mSDtfsCounter, 3184 mSDsluCounter, 7369 mSDsCounter, 0 mSdLazyCounter, 4205 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3184 SdHoareTripleChecker+Valid, 7735 SdHoareTripleChecker+Invalid, 4330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 4205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2023-02-17 05:42:16,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3184 Valid, 7735 Invalid, 4330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 4205 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2023-02-17 05:42:16,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1615 states. [2023-02-17 05:42:16,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1615 to 730. [2023-02-17 05:42:16,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 729 states have (on average 1.4170096021947873) internal successors, (1033), 729 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:16,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1033 transitions. [2023-02-17 05:42:16,197 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1033 transitions. Word has length 70 [2023-02-17 05:42:16,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:42:16,197 INFO L495 AbstractCegarLoop]: Abstraction has 730 states and 1033 transitions. [2023-02-17 05:42:16,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 3.066666666666667) internal successors, (138), 45 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:16,198 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1033 transitions. [2023-02-17 05:42:16,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-02-17 05:42:16,199 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:42:16,199 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-02-17 05:42:16,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-02-17 05:42:16,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:42:16,405 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:42:16,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:42:16,406 INFO L85 PathProgramCache]: Analyzing trace with hash -247756884, now seen corresponding path program 1 times [2023-02-17 05:42:16,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 05:42:16,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [868651136] [2023-02-17 05:42:16,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:42:16,406 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:42:16,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 05:42:16,408 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 05:42:16,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-02-17 05:42:16,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:42:16,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 05:42:16,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:42:16,480 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-02-17 05:42:16,481 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 05:42:16,481 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 05:42:16,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [868651136] [2023-02-17 05:42:16,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [868651136] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:42:16,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:42:16,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-17 05:42:16,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846061804] [2023-02-17 05:42:16,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:42:16,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 05:42:16,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 05:42:16,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 05:42:16,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-17 05:42:16,483 INFO L87 Difference]: Start difference. First operand 730 states and 1033 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:16,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:42:16,689 INFO L93 Difference]: Finished difference Result 1181 states and 1655 transitions. [2023-02-17 05:42:16,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 05:42:16,689 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2023-02-17 05:42:16,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:42:16,693 INFO L225 Difference]: With dead ends: 1181 [2023-02-17 05:42:16,693 INFO L226 Difference]: Without dead ends: 985 [2023-02-17 05:42:16,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-17 05:42:16,694 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 193 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:42:16,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 467 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 05:42:16,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2023-02-17 05:42:16,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 556. [2023-02-17 05:42:16,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 555 states have (on average 1.4072072072072073) internal successors, (781), 555 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:16,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 781 transitions. [2023-02-17 05:42:16,748 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 781 transitions. Word has length 70 [2023-02-17 05:42:16,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:42:16,748 INFO L495 AbstractCegarLoop]: Abstraction has 556 states and 781 transitions. [2023-02-17 05:42:16,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:16,749 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 781 transitions. [2023-02-17 05:42:16,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-02-17 05:42:16,750 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:42:16,750 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:42:16,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-02-17 05:42:16,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:42:16,957 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:42:16,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:42:16,957 INFO L85 PathProgramCache]: Analyzing trace with hash 946149333, now seen corresponding path program 1 times [2023-02-17 05:42:16,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 05:42:16,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1996615467] [2023-02-17 05:42:16,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:42:16,958 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:42:16,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 05:42:16,959 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 05:42:16,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-02-17 05:42:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:42:16,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-17 05:42:16,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:42:17,056 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 63 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-17 05:42:17,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 05:42:17,112 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 53 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-17 05:42:17,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 05:42:17,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1996615467] [2023-02-17 05:42:17,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1996615467] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 05:42:17,113 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 05:42:17,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-02-17 05:42:17,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704018899] [2023-02-17 05:42:17,114 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 05:42:17,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 05:42:17,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 05:42:17,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 05:42:17,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-02-17 05:42:17,115 INFO L87 Difference]: Start difference. First operand 556 states and 781 transitions. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:17,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:42:17,906 INFO L93 Difference]: Finished difference Result 1226 states and 1743 transitions. [2023-02-17 05:42:17,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-17 05:42:17,907 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2023-02-17 05:42:17,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:42:17,911 INFO L225 Difference]: With dead ends: 1226 [2023-02-17 05:42:17,911 INFO L226 Difference]: Without dead ends: 1032 [2023-02-17 05:42:17,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2023-02-17 05:42:17,912 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 266 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-17 05:42:17,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 277 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-17 05:42:17,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2023-02-17 05:42:17,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 868. [2023-02-17 05:42:17,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 867 states have (on average 1.4209919261822377) internal successors, (1232), 867 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:17,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1232 transitions. [2023-02-17 05:42:17,985 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1232 transitions. Word has length 72 [2023-02-17 05:42:17,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:42:17,986 INFO L495 AbstractCegarLoop]: Abstraction has 868 states and 1232 transitions. [2023-02-17 05:42:17,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:17,986 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1232 transitions. [2023-02-17 05:42:17,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-02-17 05:42:17,988 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:42:17,988 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:42:18,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-02-17 05:42:18,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:42:18,197 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:42:18,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:42:18,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1135042114, now seen corresponding path program 1 times [2023-02-17 05:42:18,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 05:42:18,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1543957463] [2023-02-17 05:42:18,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:42:18,198 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:42:18,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 05:42:18,200 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 05:42:18,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-02-17 05:42:18,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:42:18,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 43 conjunts are in the unsatisfiable core [2023-02-17 05:42:18,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:42:18,957 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:42:18,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 05:42:21,107 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:42:21,107 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 05:42:21,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1543957463] [2023-02-17 05:42:21,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1543957463] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 05:42:21,108 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 05:42:21,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2023-02-17 05:42:21,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400848713] [2023-02-17 05:42:21,110 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 05:42:21,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-17 05:42:21,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 05:42:21,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-17 05:42:21,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1921, Unknown=0, NotChecked=0, Total=2070 [2023-02-17 05:42:21,112 INFO L87 Difference]: Start difference. First operand 868 states and 1232 transitions. Second operand has 46 states, 46 states have (on average 3.1739130434782608) internal successors, (146), 46 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:49,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:42:49,082 INFO L93 Difference]: Finished difference Result 5167 states and 6948 transitions. [2023-02-17 05:42:49,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2023-02-17 05:42:49,083 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 3.1739130434782608) internal successors, (146), 46 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2023-02-17 05:42:49,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:42:49,097 INFO L225 Difference]: With dead ends: 5167 [2023-02-17 05:42:49,097 INFO L226 Difference]: Without dead ends: 4833 [2023-02-17 05:42:49,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18245 ImplicationChecksByTransitivity, 21.9s TimeCoverageRelationStatistics Valid=7625, Invalid=50697, Unknown=0, NotChecked=0, Total=58322 [2023-02-17 05:42:49,110 INFO L413 NwaCegarLoop]: 715 mSDtfsCounter, 3330 mSDsluCounter, 14363 mSDsCounter, 0 mSdLazyCounter, 9030 mSolverCounterSat, 418 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3330 SdHoareTripleChecker+Valid, 15078 SdHoareTripleChecker+Invalid, 9448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 418 IncrementalHoareTripleChecker+Valid, 9030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2023-02-17 05:42:49,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3330 Valid, 15078 Invalid, 9448 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [418 Valid, 9030 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2023-02-17 05:42:49,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4833 states. [2023-02-17 05:42:49,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4833 to 2640. [2023-02-17 05:42:49,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2640 states, 2639 states have (on average 1.4369079196665404) internal successors, (3792), 2639 states have internal predecessors, (3792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:49,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2640 states to 2640 states and 3792 transitions. [2023-02-17 05:42:49,387 INFO L78 Accepts]: Start accepts. Automaton has 2640 states and 3792 transitions. Word has length 74 [2023-02-17 05:42:49,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:42:49,387 INFO L495 AbstractCegarLoop]: Abstraction has 2640 states and 3792 transitions. [2023-02-17 05:42:49,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 3.1739130434782608) internal successors, (146), 46 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:49,388 INFO L276 IsEmpty]: Start isEmpty. Operand 2640 states and 3792 transitions. [2023-02-17 05:42:49,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-02-17 05:42:49,391 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:42:49,392 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-02-17 05:42:49,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-02-17 05:42:49,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:42:49,601 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:42:49,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:42:49,601 INFO L85 PathProgramCache]: Analyzing trace with hash -777616002, now seen corresponding path program 1 times [2023-02-17 05:42:49,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 05:42:49,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1660628108] [2023-02-17 05:42:49,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:42:49,602 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:42:49,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 05:42:49,603 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 05:42:49,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-02-17 05:42:49,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:42:49,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 41 conjunts are in the unsatisfiable core [2023-02-17 05:42:49,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:42:50,269 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:42:50,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 05:42:52,076 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:42:52,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 05:42:52,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1660628108] [2023-02-17 05:42:52,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1660628108] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 05:42:52,077 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 05:42:52,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2023-02-17 05:42:52,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145566078] [2023-02-17 05:42:52,077 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 05:42:52,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-17 05:42:52,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 05:42:52,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-17 05:42:52,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1933, Unknown=0, NotChecked=0, Total=2070 [2023-02-17 05:42:52,079 INFO L87 Difference]: Start difference. First operand 2640 states and 3792 transitions. Second operand has 46 states, 46 states have (on average 3.1739130434782608) internal successors, (146), 46 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:09,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:43:09,976 INFO L93 Difference]: Finished difference Result 7390 states and 10334 transitions. [2023-02-17 05:43:09,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2023-02-17 05:43:09,978 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 3.1739130434782608) internal successors, (146), 46 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2023-02-17 05:43:09,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:43:09,992 INFO L225 Difference]: With dead ends: 7390 [2023-02-17 05:43:09,993 INFO L226 Difference]: Without dead ends: 5464 [2023-02-17 05:43:09,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5251 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=2685, Invalid=18777, Unknown=0, NotChecked=0, Total=21462 [2023-02-17 05:43:09,997 INFO L413 NwaCegarLoop]: 490 mSDtfsCounter, 1767 mSDsluCounter, 10149 mSDsCounter, 0 mSdLazyCounter, 6113 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1767 SdHoareTripleChecker+Valid, 10639 SdHoareTripleChecker+Invalid, 6223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 6113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2023-02-17 05:43:09,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1767 Valid, 10639 Invalid, 6223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 6113 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2023-02-17 05:43:10,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5464 states. [2023-02-17 05:43:10,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5464 to 3148. [2023-02-17 05:43:10,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3148 states, 3147 states have (on average 1.4496345726088338) internal successors, (4562), 3147 states have internal predecessors, (4562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:10,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3148 states to 3148 states and 4562 transitions. [2023-02-17 05:43:10,274 INFO L78 Accepts]: Start accepts. Automaton has 3148 states and 4562 transitions. Word has length 74 [2023-02-17 05:43:10,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:43:10,274 INFO L495 AbstractCegarLoop]: Abstraction has 3148 states and 4562 transitions. [2023-02-17 05:43:10,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 3.1739130434782608) internal successors, (146), 46 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:10,275 INFO L276 IsEmpty]: Start isEmpty. Operand 3148 states and 4562 transitions. [2023-02-17 05:43:10,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-02-17 05:43:10,279 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:43:10,279 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-02-17 05:43:10,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-02-17 05:43:10,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:43:10,488 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:43:10,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:43:10,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1420916641, now seen corresponding path program 1 times [2023-02-17 05:43:10,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 05:43:10,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1797701623] [2023-02-17 05:43:10,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:43:10,489 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:43:10,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 05:43:10,490 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 05:43:10,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-02-17 05:43:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:43:10,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 05:43:10,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:43:10,612 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 29 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:43:10,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 05:43:10,672 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 29 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:43:10,673 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 05:43:10,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1797701623] [2023-02-17 05:43:10,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1797701623] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 05:43:10,673 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 05:43:10,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-02-17 05:43:10,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192959627] [2023-02-17 05:43:10,674 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 05:43:10,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 05:43:10,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 05:43:10,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 05:43:10,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-02-17 05:43:10,675 INFO L87 Difference]: Start difference. First operand 3148 states and 4562 transitions. Second operand has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:11,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:43:11,786 INFO L93 Difference]: Finished difference Result 11929 states and 19086 transitions. [2023-02-17 05:43:11,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-17 05:43:11,787 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2023-02-17 05:43:11,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:43:11,804 INFO L225 Difference]: With dead ends: 11929 [2023-02-17 05:43:11,804 INFO L226 Difference]: Without dead ends: 5906 [2023-02-17 05:43:11,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2023-02-17 05:43:11,811 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 415 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-17 05:43:11,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 171 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-17 05:43:11,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5906 states. [2023-02-17 05:43:12,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5906 to 4982. [2023-02-17 05:43:12,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4982 states, 4981 states have (on average 1.2379040353342703) internal successors, (6166), 4981 states have internal predecessors, (6166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:12,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4982 states to 4982 states and 6166 transitions. [2023-02-17 05:43:12,247 INFO L78 Accepts]: Start accepts. Automaton has 4982 states and 6166 transitions. Word has length 76 [2023-02-17 05:43:12,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:43:12,248 INFO L495 AbstractCegarLoop]: Abstraction has 4982 states and 6166 transitions. [2023-02-17 05:43:12,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:12,248 INFO L276 IsEmpty]: Start isEmpty. Operand 4982 states and 6166 transitions. [2023-02-17 05:43:12,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-02-17 05:43:12,250 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:43:12,250 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-02-17 05:43:12,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-02-17 05:43:12,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:43:12,459 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:43:12,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:43:12,459 INFO L85 PathProgramCache]: Analyzing trace with hash 881251465, now seen corresponding path program 1 times [2023-02-17 05:43:12,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 05:43:12,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1115577490] [2023-02-17 05:43:12,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:43:12,460 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:43:12,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 05:43:12,461 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 05:43:12,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-02-17 05:43:12,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:43:12,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-17 05:43:12,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:43:13,323 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:43:13,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 05:43:16,138 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:43:16,139 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 05:43:16,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1115577490] [2023-02-17 05:43:16,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1115577490] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 05:43:16,139 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 05:43:16,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-02-17 05:43:16,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719908375] [2023-02-17 05:43:16,139 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 05:43:16,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-02-17 05:43:16,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 05:43:16,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-02-17 05:43:16,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2277, Unknown=0, NotChecked=0, Total=2450 [2023-02-17 05:43:16,141 INFO L87 Difference]: Start difference. First operand 4982 states and 6166 transitions. Second operand has 50 states, 50 states have (on average 3.04) internal successors, (152), 50 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:40,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:43:40,268 INFO L93 Difference]: Finished difference Result 6726 states and 8193 transitions. [2023-02-17 05:43:40,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2023-02-17 05:43:40,269 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.04) internal successors, (152), 50 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2023-02-17 05:43:40,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:43:40,285 INFO L225 Difference]: With dead ends: 6726 [2023-02-17 05:43:40,285 INFO L226 Difference]: Without dead ends: 6469 [2023-02-17 05:43:40,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9932 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=4517, Invalid=32155, Unknown=0, NotChecked=0, Total=36672 [2023-02-17 05:43:40,289 INFO L413 NwaCegarLoop]: 286 mSDtfsCounter, 2629 mSDsluCounter, 7304 mSDsCounter, 0 mSdLazyCounter, 4455 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2629 SdHoareTripleChecker+Valid, 7590 SdHoareTripleChecker+Invalid, 4724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 4455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:43:40,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2629 Valid, 7590 Invalid, 4724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 4455 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2023-02-17 05:43:40,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6469 states. [2023-02-17 05:43:40,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6469 to 5620. [2023-02-17 05:43:40,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5620 states, 5619 states have (on average 1.2343833422317139) internal successors, (6936), 5619 states have internal predecessors, (6936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:40,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5620 states to 5620 states and 6936 transitions. [2023-02-17 05:43:40,984 INFO L78 Accepts]: Start accepts. Automaton has 5620 states and 6936 transitions. Word has length 77 [2023-02-17 05:43:40,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:43:40,985 INFO L495 AbstractCegarLoop]: Abstraction has 5620 states and 6936 transitions. [2023-02-17 05:43:40,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.04) internal successors, (152), 50 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:40,985 INFO L276 IsEmpty]: Start isEmpty. Operand 5620 states and 6936 transitions. [2023-02-17 05:43:40,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-02-17 05:43:40,987 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:43:40,987 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-02-17 05:43:40,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-02-17 05:43:41,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:43:41,197 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:43:41,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:43:41,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1269946569, now seen corresponding path program 2 times [2023-02-17 05:43:41,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 05:43:41,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1800497412] [2023-02-17 05:43:41,198 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 05:43:41,198 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:43:41,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 05:43:41,199 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 05:43:41,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-02-17 05:43:41,238 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 05:43:41,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 05:43:41,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-17 05:43:41,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:43:42,028 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:43:42,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 05:43:44,405 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:43:44,405 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 05:43:44,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1800497412] [2023-02-17 05:43:44,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1800497412] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 05:43:44,405 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 05:43:44,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-02-17 05:43:44,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521564451] [2023-02-17 05:43:44,406 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 05:43:44,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-02-17 05:43:44,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 05:43:44,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-02-17 05:43:44,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=2267, Unknown=0, NotChecked=0, Total=2450 [2023-02-17 05:43:44,407 INFO L87 Difference]: Start difference. First operand 5620 states and 6936 transitions. Second operand has 50 states, 50 states have (on average 3.04) internal successors, (152), 50 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:44:22,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:44:22,698 INFO L93 Difference]: Finished difference Result 9354 states and 11391 transitions. [2023-02-17 05:44:22,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 224 states. [2023-02-17 05:44:22,699 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.04) internal successors, (152), 50 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2023-02-17 05:44:22,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:44:22,711 INFO L225 Difference]: With dead ends: 9354 [2023-02-17 05:44:22,712 INFO L226 Difference]: Without dead ends: 8454 [2023-02-17 05:44:22,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24617 ImplicationChecksByTransitivity, 32.2s TimeCoverageRelationStatistics Valid=8391, Invalid=64779, Unknown=0, NotChecked=0, Total=73170 [2023-02-17 05:44:22,717 INFO L413 NwaCegarLoop]: 469 mSDtfsCounter, 3157 mSDsluCounter, 12032 mSDsCounter, 0 mSdLazyCounter, 7049 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3157 SdHoareTripleChecker+Valid, 12501 SdHoareTripleChecker+Invalid, 7368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 7049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2023-02-17 05:44:22,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3157 Valid, 12501 Invalid, 7368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 7049 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2023-02-17 05:44:22,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8454 states. [2023-02-17 05:44:23,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8454 to 6832. [2023-02-17 05:44:23,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6832 states, 6831 states have (on average 1.2349582784365394) internal successors, (8436), 6831 states have internal predecessors, (8436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:44:23,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6832 states to 6832 states and 8436 transitions. [2023-02-17 05:44:23,424 INFO L78 Accepts]: Start accepts. Automaton has 6832 states and 8436 transitions. Word has length 77 [2023-02-17 05:44:23,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:44:23,424 INFO L495 AbstractCegarLoop]: Abstraction has 6832 states and 8436 transitions. [2023-02-17 05:44:23,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.04) internal successors, (152), 50 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:44:23,424 INFO L276 IsEmpty]: Start isEmpty. Operand 6832 states and 8436 transitions. [2023-02-17 05:44:23,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-02-17 05:44:23,426 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:44:23,427 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-02-17 05:44:23,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-02-17 05:44:23,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:44:23,633 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:44:23,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:44:23,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1690097737, now seen corresponding path program 3 times [2023-02-17 05:44:23,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 05:44:23,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [188523080] [2023-02-17 05:44:23,634 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 05:44:23,634 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:44:23,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 05:44:23,635 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 05:44:23,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-02-17 05:44:23,689 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-02-17 05:44:23,689 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 05:44:23,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-17 05:44:23,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:44:24,404 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:44:24,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 05:44:26,872 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:44:26,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 05:44:26,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [188523080] [2023-02-17 05:44:26,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [188523080] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 05:44:26,872 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 05:44:26,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 49 [2023-02-17 05:44:26,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558761434] [2023-02-17 05:44:26,873 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 05:44:26,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-02-17 05:44:26,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 05:44:26,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-02-17 05:44:26,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2197, Unknown=0, NotChecked=0, Total=2352 [2023-02-17 05:44:26,875 INFO L87 Difference]: Start difference. First operand 6832 states and 8436 transitions. Second operand has 49 states, 49 states have (on average 3.1020408163265305) internal successors, (152), 49 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:45:02,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:45:02,984 INFO L93 Difference]: Finished difference Result 12167 states and 14803 transitions. [2023-02-17 05:45:02,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2023-02-17 05:45:02,984 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 3.1020408163265305) internal successors, (152), 49 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2023-02-17 05:45:02,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:45:02,999 INFO L225 Difference]: With dead ends: 12167 [2023-02-17 05:45:02,999 INFO L226 Difference]: Without dead ends: 10051 [2023-02-17 05:45:03,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16375 ImplicationChecksByTransitivity, 29.8s TimeCoverageRelationStatistics Valid=7672, Invalid=44998, Unknown=0, NotChecked=0, Total=52670 [2023-02-17 05:45:03,008 INFO L413 NwaCegarLoop]: 443 mSDtfsCounter, 2698 mSDsluCounter, 11802 mSDsCounter, 0 mSdLazyCounter, 6724 mSolverCounterSat, 361 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2698 SdHoareTripleChecker+Valid, 12245 SdHoareTripleChecker+Invalid, 7085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 361 IncrementalHoareTripleChecker+Valid, 6724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2023-02-17 05:45:03,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2698 Valid, 12245 Invalid, 7085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [361 Valid, 6724 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2023-02-17 05:45:03,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10051 states. [2023-02-17 05:45:03,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10051 to 7509. [2023-02-17 05:45:03,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7509 states, 7508 states have (on average 1.234283431006926) internal successors, (9267), 7508 states have internal predecessors, (9267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:45:03,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7509 states to 7509 states and 9267 transitions. [2023-02-17 05:45:03,949 INFO L78 Accepts]: Start accepts. Automaton has 7509 states and 9267 transitions. Word has length 77 [2023-02-17 05:45:03,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:45:03,950 INFO L495 AbstractCegarLoop]: Abstraction has 7509 states and 9267 transitions. [2023-02-17 05:45:03,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 3.1020408163265305) internal successors, (152), 49 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:45:03,950 INFO L276 IsEmpty]: Start isEmpty. Operand 7509 states and 9267 transitions. [2023-02-17 05:45:03,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-02-17 05:45:03,952 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:45:03,952 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:45:03,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2023-02-17 05:45:04,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:45:04,161 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:45:04,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:45:04,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1471420594, now seen corresponding path program 1 times [2023-02-17 05:45:04,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 05:45:04,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1768641201] [2023-02-17 05:45:04,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:45:04,162 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:45:04,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 05:45:04,163 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 05:45:04,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-02-17 05:45:04,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:45:04,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 05:45:04,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:45:04,248 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 76 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-17 05:45:04,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 05:45:04,333 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 61 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-17 05:45:04,333 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 05:45:04,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1768641201] [2023-02-17 05:45:04,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1768641201] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 05:45:04,333 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 05:45:04,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-02-17 05:45:04,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959829373] [2023-02-17 05:45:04,334 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 05:45:04,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-17 05:45:04,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 05:45:04,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-17 05:45:04,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2023-02-17 05:45:04,335 INFO L87 Difference]: Start difference. First operand 7509 states and 9267 transitions. Second operand has 14 states, 14 states have (on average 8.214285714285714) internal successors, (115), 14 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:45:06,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:45:06,661 INFO L93 Difference]: Finished difference Result 16548 states and 20687 transitions. [2023-02-17 05:45:06,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-02-17 05:45:06,662 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.214285714285714) internal successors, (115), 14 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2023-02-17 05:45:06,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:45:06,677 INFO L225 Difference]: With dead ends: 16548 [2023-02-17 05:45:06,677 INFO L226 Difference]: Without dead ends: 8626 [2023-02-17 05:45:06,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=254, Invalid=1006, Unknown=0, NotChecked=0, Total=1260 [2023-02-17 05:45:06,685 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 603 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 1551 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 1646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-17 05:45:06,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 556 Invalid, 1646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1551 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-17 05:45:06,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8626 states. [2023-02-17 05:45:07,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8626 to 6793. [2023-02-17 05:45:07,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6793 states, 6792 states have (on average 1.1831566548881036) internal successors, (8036), 6792 states have internal predecessors, (8036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:45:07,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6793 states to 6793 states and 8036 transitions. [2023-02-17 05:45:07,604 INFO L78 Accepts]: Start accepts. Automaton has 6793 states and 8036 transitions. Word has length 78 [2023-02-17 05:45:07,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:45:07,604 INFO L495 AbstractCegarLoop]: Abstraction has 6793 states and 8036 transitions. [2023-02-17 05:45:07,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.214285714285714) internal successors, (115), 14 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:45:07,604 INFO L276 IsEmpty]: Start isEmpty. Operand 6793 states and 8036 transitions. [2023-02-17 05:45:07,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-02-17 05:45:07,606 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:45:07,606 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-02-17 05:45:07,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2023-02-17 05:45:07,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:45:07,813 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:45:07,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:45:07,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1794630633, now seen corresponding path program 1 times [2023-02-17 05:45:07,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 05:45:07,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1303248773] [2023-02-17 05:45:07,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:45:07,814 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:45:07,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 05:45:07,815 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 05:45:07,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-02-17 05:45:07,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:45:07,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-17 05:45:07,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:45:08,729 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:45:08,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 05:45:11,728 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:45:11,729 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 05:45:11,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1303248773] [2023-02-17 05:45:11,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1303248773] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 05:45:11,729 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 05:45:11,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-02-17 05:45:11,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034985828] [2023-02-17 05:45:11,729 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 05:45:11,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-02-17 05:45:11,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 05:45:11,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-02-17 05:45:11,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=2285, Unknown=0, NotChecked=0, Total=2450 [2023-02-17 05:45:11,731 INFO L87 Difference]: Start difference. First operand 6793 states and 8036 transitions. Second operand has 50 states, 50 states have (on average 3.16) internal successors, (158), 50 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:45:53,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:45:53,756 INFO L93 Difference]: Finished difference Result 10792 states and 12598 transitions. [2023-02-17 05:45:53,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2023-02-17 05:45:53,757 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.16) internal successors, (158), 50 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2023-02-17 05:45:53,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:45:53,771 INFO L225 Difference]: With dead ends: 10792 [2023-02-17 05:45:53,771 INFO L226 Difference]: Without dead ends: 10584 [2023-02-17 05:45:53,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 260 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22819 ImplicationChecksByTransitivity, 34.1s TimeCoverageRelationStatistics Valid=6893, Invalid=61489, Unknown=0, NotChecked=0, Total=68382 [2023-02-17 05:45:53,776 INFO L413 NwaCegarLoop]: 461 mSDtfsCounter, 2583 mSDsluCounter, 12700 mSDsCounter, 0 mSdLazyCounter, 7780 mSolverCounterSat, 358 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2583 SdHoareTripleChecker+Valid, 13161 SdHoareTripleChecker+Invalid, 8138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 358 IncrementalHoareTripleChecker+Valid, 7780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2023-02-17 05:45:53,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2583 Valid, 13161 Invalid, 8138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [358 Valid, 7780 Invalid, 0 Unknown, 0 Unchecked, 9.6s Time] [2023-02-17 05:45:53,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10584 states. [2023-02-17 05:45:54,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10584 to 7700. [2023-02-17 05:45:54,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7700 states, 7699 states have (on average 1.1754773347187946) internal successors, (9050), 7699 states have internal predecessors, (9050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:45:54,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7700 states to 7700 states and 9050 transitions. [2023-02-17 05:45:54,887 INFO L78 Accepts]: Start accepts. Automaton has 7700 states and 9050 transitions. Word has length 80 [2023-02-17 05:45:54,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:45:54,887 INFO L495 AbstractCegarLoop]: Abstraction has 7700 states and 9050 transitions. [2023-02-17 05:45:54,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.16) internal successors, (158), 50 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:45:54,888 INFO L276 IsEmpty]: Start isEmpty. Operand 7700 states and 9050 transitions. [2023-02-17 05:45:54,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-02-17 05:45:54,889 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:45:54,890 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-02-17 05:45:54,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2023-02-17 05:45:55,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:45:55,099 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:45:55,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:45:55,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1519845463, now seen corresponding path program 2 times [2023-02-17 05:45:55,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 05:45:55,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1881100843] [2023-02-17 05:45:55,100 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 05:45:55,100 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:45:55,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 05:45:55,101 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 05:45:55,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-02-17 05:45:55,141 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 05:45:55,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 05:45:55,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-17 05:45:55,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:45:55,885 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:45:55,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 05:45:58,557 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:45:58,557 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 05:45:58,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1881100843] [2023-02-17 05:45:58,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1881100843] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 05:45:58,557 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 05:45:58,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-02-17 05:45:58,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27616962] [2023-02-17 05:45:58,558 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 05:45:58,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-02-17 05:45:58,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 05:45:58,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-02-17 05:45:58,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=2289, Unknown=0, NotChecked=0, Total=2450 [2023-02-17 05:45:58,560 INFO L87 Difference]: Start difference. First operand 7700 states and 9050 transitions. Second operand has 50 states, 50 states have (on average 3.16) internal successors, (158), 50 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)